2137 search results - page 80 / 428 » Experiments on Graph Clustering Algorithms |
TVCG
2008
15 years 2 months ago
2008
Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorit...
115
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
102
click to vote
SIGIR
2006
ACM
15 years 8 months ago
2006
ACM
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
98
Voted
ACIVS
2006
Springer
15 years 8 months ago
2006
Springer
In fuzzy clustering, the fuzzy c-means (FCM) algorithm is the best known and most used method. Although FCM is a very useful method, it is sensitive to noise and outliers so that W...
AUSAI
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present a novel algorithm called DBSC, which finds subspace clusters in numerical datasets based on the concept of ”dependency”. This algorithm employs a depth-...