1010 search results - page 77 / 202 » Measuring Similarity between Sets of Overlapping Clusters |
100
click to vote
CIARP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...
128
Voted
SEDE
2008
15 years 2 months ago
2008
: In this paper, we present reliable algorithms for fuzzy k-means and C-means that could improve MRI segmentation. Since the k-means or FCM method aims to minimize the sum of squar...
108
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
114
Voted
Publication
The top-k similarity joins have been extensively studied and used
in a wide spectrum of applications such as information retrieval, decision
making, spatial data analysis and dat...
113
click to vote
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...