767 search results - page 39 / 154 » On Clustering Using Random Walks |
ICASSP
2011
IEEE
13 years 12 days ago
2011
IEEE
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
COLT
2004
Springer
14 years 2 months ago
2004
Springer
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
PDP
2006
IEEE
14 years 2 months ago
2006
IEEE
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...