894 search results - page 33 / 179 » Learning to cluster using local neighborhood structure |
178
click to vote
COR
2010
15 years 6 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
161
click to vote
ICPP
2005
IEEE
15 years 11 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
293
click to vote
SADM
2010
15 years 25 days ago
2010
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
183
click to vote
ICDM
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we propose a semi-supervised framework for learning a weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on user-const...
168
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...