Sciweavers

13 search results - page 1 / 3
» RING: An Integrated Method for Frequent Representative Subgr...
Sort
View
ICDM
2009
IEEE
108views Data Mining» more  ICDM 2009»
13 years 11 months ago
RING: An Integrated Method for Frequent Representative Subgraph Mining
—We propose a novel representative based subgraph mining model. A series of standards and methods are proposed to select invariants. Patterns are mapped into invariant vectors in...
Shijie Zhang, Jiong Yang, Shirong Li
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
13 years 10 months ago
Pattern Mining in Frequent Dynamic Subgraphs
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wa...
ECEASST
2006
305views more  ECEASST 2006»
13 years 4 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
14 years 1 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
13 years 2 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