767 search results - page 61 / 154 » On Clustering Using Random Walks |
117
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
124
Voted
SIGIR
2002
ACM
15 years 2 months ago
2002
ACM
In this paper, we propose a document clustering method that strives to achieve: (1) a high accuracy of document clustering, and (2) the capability of estimating the number of clus...
148
click to vote
ISSTA
2007
ACM
15 years 4 months ago
2007
ACM
Progress in testing requires that we evaluate the effectiveness of testing strategies on the basis of hard experimental evidence, not just intuition or a priori arguments. Random ...
SIGIR
2008
ACM
15 years 2 months ago
2008
ACM
With a growing number of works utilizing link information in enhancing document clustering, it becomes necessary to make a comparative evaluation of the impacts of different link ...
142
Voted
MICS
2010
15 years 26 days ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...