2600 search results - page 46 / 520 » Clustering with or without the Approximation |
ICML
2000
IEEE
14 years 9 months ago
2000
IEEE
Clustering algorithms conduct a search through the space of possible organizations of a data set. In this paper, we propose two types of instance-level clustering constraints ? mu...
ICANN
2001
Springer
14 years 1 months ago
2001
Springer
EEG segments recorded during microsleep events were transformed to the frequency domain and were subsequently clustered without the common summation of power densities in spectral ...
NCI
2004
13 years 10 months ago
2004
This paper presents a new semi-competitive learning paradigm named Competitive and Cooperative Learning (CCL), in which seed points not only compete each other for updating to ada...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
In many clustering applications, the user has some vague notion of the number and membership of the desired clusters. However, it is difficult for the user to provide such knowled...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...