Sciweavers

2137 search results - page 22 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
COMAD
2008
13 years 9 months ago
An Experiment with Distance Measures for Clustering
Distance measure plays an important role in clustering data points. Choosing the right distance measure for a given dataset is a non-trivial problem. In this paper, we study vario...
Ankita Vimal, Satyanarayana R. Valluri, Kamalakar ...
EUROPAR
2001
Springer
13 years 12 months ago
Experiments in Parallel Clustering with DBSCAN
We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a...
Domenica Arlia, Massimo Coppola
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 7 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
AAAI
2010
13 years 9 months ago
Gaussian Mixture Model with Local Consistency
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
Jialu Liu, Deng Cai, Xiaofei He
WEA
2009
Springer
123views Algorithms» more  WEA 2009»
14 years 2 months ago
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes
We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex...
Hannes Moser, Rolf Niedermeier, Manuel Sorge