Sciweavers

64 search results - page 1 / 13
» Frequent Subgraph Retrieval in Geometric Graph Databases
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
IS
2007
13 years 4 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
EDBT
2012
ACM
257views Database» more  EDBT 2012»
11 years 7 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 5 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
13 years 11 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...