Sciweavers

2227 search results - page 51 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
138
Voted
DASFAA
2006
IEEE
168views Database» more  DASFAA 2006»
15 years 4 months ago
COWES: Clustering Web Users Based on Historical Web Sessions
Clustering web users is one of the most important research topics in web usage mining. Existing approaches cluster web users based on the snapshots of web user sessions. They do no...
Ling Chen 0002, Sourav S. Bhowmick, Jinyan Li
96
Voted
IPPS
2008
IEEE
15 years 7 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
ICDM
2008
IEEE
97views Data Mining» more  ICDM 2008»
15 years 7 months ago
OntoDM: An Ontology of Data Mining
Motivated by the need for unification of the field of data mining and the growing demand for formalized representation of outcomes of research, we address the task of constructi...
Pance Panov, Saso Dzeroski, Larisa N. Soldatova
114
Voted
IPPS
2008
IEEE
15 years 7 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
108
Voted
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
15 years 6 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher