243 search results - page 5 / 49 » Scalable mining of large disk-based graph databases |
DEXAW
2009
IEEE
14 years 2 months ago
2009
IEEE
—A novel method CLOSS intended for textual databases is proposed. It successfully identifies misspelled string clusters, even if the cluster border is not prominent. The method ...
EDBT
2009
ACM
14 years 3 days ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
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...
PAKDD
2010
ACM
14 years 8 days ago
2010
ACM
Given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to he...