767 search results - page 29 / 154 » On Clustering Using Random Walks |
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
We investigate how random projection can best be used for clustering high dimensional data. Random projection has been shown to have promising theoretical properties. In practice,...
CN
2000
13 years 8 months ago
2000
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
WEBI
2005
Springer
14 years 2 months ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...