Sciweavers

14 search results - page 3 / 3
» Scalable Probabilistic Databases with Factor Graphs and MCMC
Sort
View
WWW
2005
ACM
14 years 5 months ago
Scaling link-based similarity search
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 ...
Balázs Rácz, Dániel Fogaras
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
14 years 5 months ago
SNARE: a link analytic system for graph labeling and risk detection
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...
Mary McGlohon, Stephen Bay, Markus G. Anderle, Dav...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 2 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
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...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
RECSYS
2010
ACM
13 years 4 months ago
Recommending based on rating frequencies
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...
Fatih Gedikli, Dietmar Jannach