Sciweavers

113 search results - page 3 / 23
» Frequent subgraph pattern mining on uncertain graph data
Sort
View
ICDM
2008
IEEE
127views Data Mining» more  ICDM 2008»
13 years 11 months ago
Frequent Subgraph Retrieval in Geometric Graph Databases
Sebastian Nowozin, Koji Tsuda
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 3 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
13 years 3 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
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 ...
Shirong Li, Shijie Zhang, Jiong Yang
IS
2007
13 years 5 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
ICDM
2002
IEEE
178views Data Mining» more  ICDM 2002»
13 years 10 months ago
gSpan: Graph-Based Substructure Pattern Mining
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
Xifeng Yan, Jiawei Han