340 search results - page 15 / 68 » Clustering with Lower Bound on Similarity |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
109
click to vote
ICOIN
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
SIAMCO
2010
14 years 4 months ago
2010
We study a simple continuous-time multiagent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by e...
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
Video signatures are compact representations of video sequences designed for efficient similarity measurement. In this paper, we propose a feature extraction technique to support ...