128 search results - page 15 / 26 » Towards proximity pattern mining in large graphs |
SAC
2009
ACM
14 years 2 months ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
ICCS
1993
Springer
13 years 11 months ago
1993
Springer
Adaptive predictive search (APS), is a learning system framework, which given little initial domain knowledge, increases its decision-making abilities in complex problems domains....
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
The application of frequent patterns in classification appeared in sporadic studies and achieved initial success in the classification of relational data, text documents and graph...