115 search results - page 2 / 23 » Scalable Discovery of Best Clusters on Large Graphs |
ICDE
2007
IEEE
13 years 11 months ago
2007
IEEE
The wide availability of large scale databases requires more efficient and scalable tools for data understanding and knowledge discovery. In this paper, we present a method to ...
ICDE
2009
IEEE
13 years 11 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
SDM
2012
SIAM
11 years 7 months ago
2012
SIAM
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...
ICDM
2005
IEEE
13 years 10 months ago
2005
IEEE
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...