731 search results - page 20 / 147 » Taxonomy-superimposed graph mining |
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
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...
KDD
2004
ACM
14 years 8 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...