Sciweavers

25041 search results - page 40 / 5009
» Algorithms for Clustering Data
Sort
View
ITSL
2008
13 years 9 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
SDM
2004
SIAM
253views Data Mining» more  SDM 2004»
13 years 9 months ago
Density-Connected Subspace Clustering for High-Dimensional Data
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be managed without the help of efficient and effective ...
Peer Kröger, Hans-Peter Kriegel, Karin Kailin...
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 9 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 5 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
ICDM
2006
IEEE
161views Data Mining» more  ICDM 2006»
14 years 2 months ago
Hierarchical Density Shaving: A clustering and visualization framework for large biological datasets
In many clustering applications for bioinformatics, only part of the data clusters into one or more groups while the rest needs to be pruned. For such situations, we present Hiera...
Gunjan Gupta, Alexander Liu, Joydeep Ghosh