Sciweavers

2227 search results - page 7 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
15 years 1 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
93
Voted
AAAI
2007
15 years 2 months ago
Graph Partitioning Based on Link Distributions
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
COMPSAC
2006
IEEE
15 years 6 months ago
Data Structure and Algorithm in Data Mining: Granular Computing View
This paper discusses foundations of conventional style of rule mining in which rules are extracted from a data table. Rule mining mainly uses the structure of a table, data partit...
Shusaku Tsumoto
103
Voted
ICDM
2002
IEEE
178views Data Mining» more  ICDM 2002»
15 years 5 months ago
gSpan: Graph-Based Substructure Pattern Mining
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
Xifeng Yan, Jiawei Han
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
16 years 22 days ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...