87 search results - page 3 / 18 » ShatterPlots: Fast Tools for Mining Large Graphs. |
JCP
2008
13 years 11 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
KDD
2004
ACM
14 years 11 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
ICDM
2010
IEEE
13 years 8 months ago
2010
IEEE
A large number of data mining methods are, as such, not applicable to fast, intuitive, and interactive use. Thus, there is a need for visually controllable data mining methods. Suc...
SSDBM
2010
IEEE
13 years 9 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
KDD
2007
ACM
14 years 11 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...