Sciweavers

243 search results - page 19 / 49
» Scalable mining of large disk-based graph databases
Sort
View
WLP
2004
Springer
14 years 27 days ago
SQL Based Frequent Pattern Mining with FP-Growth
Scalable data mining in large databases is one of today’s real challenges to database research area. The integration of data mining with database systems is an essential componen...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 5 months 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...
PREMI
2005
Springer
14 years 1 months ago
Towards Generic Pattern Mining
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Template...
Mohammed Javeed Zaki, Nilanjana De, Feng Gao, Nage...
DATAMINE
2006
142views more  DATAMINE 2006»
13 years 7 months ago
Sequential Pattern Mining in Multi-Databases via Multiple Alignment
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010
EDBT
2009
ACM
241views Database» more  EDBT 2009»
14 years 2 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang