4972 search results - page 900 / 995 » Ranking on graph data |
140
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
137
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
117
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
129
click to vote
ICML
1996
IEEE
16 years 5 months ago
1996
IEEE
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
148
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
In this paper we give models and algorithms to describe and analyze the collaboration among authors of Wikipedia from a network analytical perspective. The edit network encodes wh...