Sciweavers

767 search results - page 61 / 154
» On Clustering Using Random Walks
Sort
View
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 6 months ago
Random subcubes as a toy model for constraint satisfaction problems
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...
Thierry Mora, Lenka Zdeborová
SIGIR
2002
ACM
15 years 5 months ago
Document clustering with cluster refinement and model selection capabilities
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...
Xin Liu, Yihong Gong, Wei Xu, Shenghuo Zhu
ISSTA
2007
ACM
15 years 7 months ago
Experimental assessment of random testing for object-oriented software
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 ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
SIGIR
2008
ACM
15 years 6 months ago
A comparative evaluation of different link types on enhancing document clustering
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 ...
Xiaodan Zhang, Xiaohua Hu, Xiaohua Zhou
MICS
2010
134views more  MICS 2010»
15 years 4 months ago
Scale Free Properties of Random k-Trees
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...
Colin Cooper, Ryuhei Uehara