587 search results - page 51 / 118 » Clustering Improves the Exploration of Graph Mining Results |
WSDM
2009
ACM
15 years 6 months ago
2009
ACM
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
112
click to vote
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
106
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose an approach for learning visual models of object categories in an unsupervised manner in which we first build a large-scale complex network which captures the interacti...
107
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
– Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the impact of cache replacement policy on the performance of Fre...
KDD
2005
ACM
16 years 7 days ago
2005
ACM
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...