14 search results - page 3 / 3 » Scalable Probabilistic Databases with Factor Graphs and MCMC |
115
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
151
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
141
Voted
SSDBM
2010
IEEE
15 years 1 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
123
Voted
RECSYS
2010
ACM
15 years 3 months ago
2010
ACM
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...