5046 search results - page 50 / 1010 » Non-redundant data clustering |
154
click to vote
ICPR
2008
IEEE
16 years 18 days ago
2008
IEEE
A novel unsupervised clustering algorithm called Hyperclique Pattern-KMEANS (HP-KMEANS) is presented. Considering recent success in semisupervised clustering using pair-wise const...
185
click to vote
IJUFKS
2007
15 years 6 months ago
2007
Abstract. Resampling methods are among the best approaches to determine the number of clusters in prototype-based clustering. The core idea is that with the right choice for the nu...
163
click to vote
CIDM
2007
IEEE
16 years 16 days ago
2007
IEEE
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
146
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Detecting local clustered anomalies is an intricate problem for many existing anomaly detection methods. Distance-based and density-based methods are inherently restricted by their...
160
click to vote
FUZZIEEE
2007
IEEE
16 years 15 days ago
2007
IEEE
Abstract—In contrast to standard fuzzy clustering, which optimizes a set of prototypes, one for each cluster, this paper studies fuzzy clustering without prototypes. Starting fro...