Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
10 years 19 days ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
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...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
SADM
2010
123views more  SADM 2010»
10 years 1 months ago
Discriminative frequent subgraph mining with optimality guarantees
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
Marisa Thoma, Hong Cheng, Arthur Gretton, Jiawei H...
ECEASST
2006
305views more  ECEASST 2006»
10 years 2 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...
PKDD
2004
Springer
147views Data Mining» more  PKDD 2004»
10 years 8 months ago
Using a Hash-Based Method for Apriori-Based Graph Mining
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
Phu Chien Nguyen, Takashi Washio, Kouzou Ohara, Hi...
ICDM
2006
IEEE
184views Data Mining» more  ICDM 2006»
10 years 8 months ago
MARGIN: Maximal Frequent Subgraph Mining
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
Lini T. Thomas, Satyanarayana R. Valluri, Kamalaka...
MLG
2007
Springer
10 years 9 months ago
Improving Frequent Subgraph Mining in the Presence of Symmetry
While recent algorithms for mining the frequent subgraphs of a database are efficient in the general case, these algorithms tend to do poorly on databases that have a few or no la...
Christian Desrosiers, Philippe Galinier, Pierre Ha...
EDBT
2009
ACM
138views Database» more  EDBT 2009»
10 years 9 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
books