Sciweavers

733 search results - page 23 / 147
» Recommending random walks
Sort
View
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
15 years 4 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
74
Voted
MM
2006
ACM
190views Multimedia» more  MM 2006»
15 years 3 months ago
Image annotation refinement using random walk with restarts
Image annotation plays an important role in image retrieval and management. However, the results of the state-of-the-art image annotation methods are often unsatisfactory. Therefo...
Changhu Wang, Feng Jing, Lei Zhang, HongJiang Zhan...
AOSD
2007
ACM
15 years 1 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
LREC
2010
199views Education» more  LREC 2010»
14 years 11 months ago
A Random Graph Walk based Approach to Computing Semantic Relatedness Using Knowledge from Wikipedia
Determining semantic relatedness between words or concepts is a fundamental process to many Natural Language Processing applications. Approaches for this task typically make use o...
Ziqi Zhang, Anna Lisa Gentile, Lei Xia, José...
CORR
2008
Springer
143views Education» more  CORR 2008»
14 years 9 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...