Sciweavers

4039 search results - page 96 / 808
» A Method for Dynamic Clustering of Data
Sort
View
DEXAW
2009
IEEE
173views Database» more  DEXAW 2009»
15 years 11 months ago
Automatic Cluster Number Selection Using a Split and Merge K-Means Approach
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
Markus Muhr, Michael Granitzer
SDM
2009
SIAM
220views Data Mining» more  SDM 2009»
16 years 1 months ago
Bayesian Cluster Ensembles.
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...
Hongjun Wang, Hanhuai Shan, Arindam Banerjee
ACMSE
2010
ACM
15 years 2 months ago
Mining relaxed closed subspace clusters
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
Erich Allen Peterson, Peiyi Tang
ISCA
2003
IEEE
88views Hardware» more  ISCA 2003»
15 years 9 months ago
Dynamically Managing the Communication-Parallelism Trade-off in Future Clustered Processors
Clustered microarchitectures are an attractive alternative to large monolithic superscalar designs due to their potential for higher clock rates in the face of increasingly wire-d...
Rajeev Balasubramonian, Sandhya Dwarkadas, David H...
BMCBI
2004
158views more  BMCBI 2004»
15 years 4 months ago
Incremental genetic K-means algorithm and its application in gene expression data analysis
Background: In recent years, clustering algorithms have been effectively applied in molecular biology for gene expression data analysis. With the help of clustering algorithms suc...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Youping Deng, ...