2174 search results - page 40 / 435 » cluster 2007 |
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
66
Voted
COMBINATORICS
2007
14 years 9 months ago
2007
In this paper, we prove that in a multigraph whose density Γ exceeds the maximum vertex degree ∆, the collection of minimal clusters (maximally dense sets of vertices) is cycle...
WAOA
2007
Springer
15 years 3 months ago
2007
Springer
We continue the study of the online unit clustering problem, introduced by Chan and Zarrabi-Zadeh
66
Voted
ENGL
2007
14 years 9 months ago
2007
Abstract— In this paper, a new method of representing twodimensional shapes using fuzzy-symbolic features and a similarity measure defined over fuzzy-symbolic features useful for...
120
Voted
KDD
2007
ACM
15 years 10 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...