Sciweavers

4177 search results - page 161 / 836
» On the Performance of Ant-based Clustering
Sort
View
ICPP
2000
IEEE
15 years 10 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
ITSL
2008
15 years 7 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
NIPS
2008
15 years 7 months ago
On the Reliability of Clustering Stability in the Large Sample Regime
Clustering stability is an increasingly popular family of methods for performing model selection in data clustering. The basic idea is that the chosen model should be stable under...
Ohad Shamir, Naftali Tishby
BMCBI
2007
134views more  BMCBI 2007»
15 years 6 months ago
Nearest Neighbor Networks: clustering expression data based on gene neighborhoods
Background: The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both indiv...
Curtis Huttenhower, Avi I. Flamholz, Jessica N. La...
DATAMINE
2006
89views more  DATAMINE 2006»
15 years 6 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh