4972 search results - page 239 / 995 » Ranking on graph data |
146
click to vote
ERCIMDL
2007
Springer
16 years 25 days ago
2007
Springer
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
165
click to vote
EJC
2008
15 years 6 months ago
2008
Abstract. We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new ...
206
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
141
click to vote
INCDM
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. In a recommender system where users rate items we predict the rating of items users have not rated. We define a rating graph containing users and items as vertices and r...
202
click to vote
ICDE
2010
IEEE
15 years 12 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...