5046 search results - page 247 / 1010 » Non-redundant data clustering |
169
click to vote
WILF
2007
Springer
16 years 23 days ago
2007
Springer
In this paper we propose the Possibilistic C-Means in Feature Space and the One-Cluster Possibilistic C-Means in Feature Space algorithms which are kernel methods for clustering in...
216
click to vote
IJCNN
2006
IEEE
16 years 21 days ago
2006
IEEE
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
191
click to vote
ICTAI
2005
IEEE
16 years 8 days ago
2005
IEEE
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
156
click to vote
CLUSTER
2002
IEEE
15 years 11 months ago
2002
IEEE
Supermon is a flexible set of tools for high speed, scalable cluster monitoring. Node behavior can be monitored much faster than with other commonly used methods (e.g., rstatd). ...
164
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Semi-supervised classification uses aspects of both unsupervised and supervised learning to improve upon the performance of traditional classification methods. Semi-supervised clu...