1839 search results - page 40 / 368 » Feature Selection in Clustering Problems |
143
Voted
JCSS
2002
15 years 2 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
131
Voted
FUIN
2010
14 years 9 months ago
2010
Machine learning methods are often used to classify objects described by hundreds of attributes; in many applications of this kind a great fraction of attributes may be totally irr...
131
Voted
INFORMS
1998
15 years 2 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
85
Voted
ICCBR
2005
Springer
15 years 8 months ago
2005
Springer
In conversational case-based reasoning (CCBR), a main problem is how to select the most discriminative questions and display them to users in a natural way to alleviate users’ co...
114
Voted
KDD
2006
ACM
16 years 3 months ago
2006
ACM
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...