1658 search results - page 138 / 332 » Learning Unknown Graphs |
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another ...
132
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
144
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
140
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in a step-by-step lab...
157
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...