Sciweavers

5046 search results - page 7 / 1010
» Non-redundant data clustering
Sort
View
DEXAW
2009
IEEE
173views Database» more  DEXAW 2009»
15 years 4 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
ESWA
2010
158views more  ESWA 2010»
14 years 6 months ago
Interval competitive agglomeration clustering algorithm
1 In this study, a novel robust clustering algorithm, robust interval competitive agglomeration (RICA) clustering algorithm, is proposed to overcome the problems of the outliers, t...
Jin-Tsong Jeng, Chen-Chia Chuang, Chin-Wang Tao
PRL
2010
188views more  PRL 2010»
14 years 4 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
CORR
2011
Springer
229views Education» more  CORR 2011»
14 years 4 months ago
"Improved FCM algorithm for Clustering on Web Usage Mining"
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
K. Suresh
ICDM
2009
IEEE
169views Data Mining» more  ICDM 2009»
14 years 7 months ago
Learning the Shared Subspace for Multi-task Clustering and Transductive Transfer Classification
There are many clustering tasks which are closely related in the real world, e.g. clustering the web pages of different universities. However, existing clustering approaches neglec...
Quanquan Gu, Jie Zhou