Sciweavers

767 search results - page 1 / 154
» On Clustering Using Random Walks
Sort
View
FSTTCS
2001
Springer
13 years 9 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
ICML
2006
IEEE
14 years 5 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
SIGIR
2008
ACM
13 years 4 months ago
Multi-document summarization using cluster-based link analysis
The Markov Random Walk model has been recently exploited for multi-document summarization by making use of the link relationships between sentences in the document set, under the ...
Xiaojun Wan, Jianwu Yang
ICIP
2010
IEEE
13 years 2 months ago
Detecting pitching frames in baseball game video using Markov random walk
Pitching is the starting point of an event in baseball games. Hence, locating pitching shots is a critical step in content analysis of a baseball game video. However, pitching fra...
Chih-Yi Chiu, Po-Chih Lin, Wei-Ming Chang, Hsin-Mi...
AIRWEB
2007
Springer
13 years 10 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla