Sciweavers

85 search results - page 7 / 17
» Component structure induced by a random walk on a random gra...
Sort
View
ICML
2006
IEEE
14 years 8 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
BIOINFORMATICS
2007
83views more  BIOINFORMATICS 2007»
13 years 7 months ago
Exploring biological network structure using exponential random graph models
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
Zachary M. Saul, Vladimir Filkov
ICPR
2008
IEEE
14 years 1 months ago
Graph drawing using quantum commute time
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
David Emms, Edwin R. Hancock, Richard C. Wilson
ICPR
2006
IEEE
14 years 8 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu
WWW
2010
ACM
13 years 7 months ago
LINKREC: a unified framework for link recommendation with user attributes and graph structure
With the phenomenal success of networking sites (e.g., Facebook, Twitter and LinkedIn), social networks have drawn substantial attention. On online social networking sites, link r...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han