Sciweavers

1976 search results - page 54 / 396
» Predictive Graph Mining
Sort
View
ICDM
2007
IEEE
118views Data Mining» more  ICDM 2007»
14 years 3 months ago
Subgraph Support in a Single Large Graph
—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...
Mathias Fiedler, Christian Borgelt
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 9 months ago
Fast discovery of connection subgraphs
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...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
CIKM
2009
Springer
14 years 3 months ago
Independent informative subgraph mining for graph information retrieval
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...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ICDM
2007
IEEE
199views Data Mining» more  ICDM 2007»
14 years 3 months ago
Discovering Structural Anomalies in Graph-Based Data
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
William Eberle, Lawrence B. Holder
ICDM
2007
IEEE
179views Data Mining» more  ICDM 2007»
14 years 3 months ago
GDClust: A Graph-Based Document Clustering Technique
This paper introduces a new technique of document clustering based on frequent senses. The proposed system, GDClust (Graph-Based Document Clustering) works with frequent senses ra...
M. Shahriar Hossain, Rafal A. Angryk