33 search results - page 5 / 7 » Summarizing Linked Data RDF Graphs Using Approximate Graph P... |
113
Voted
ICDM
2005
IEEE
15 years 6 months ago
2005
IEEE
Recommendation algorithms aim at proposing “next” pages to a user based on her current visit and the past users’ navigational patterns. In the vast majority of related algor...
159
Voted
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
119
click to vote
SDM
2007
SIAM
15 years 2 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
135
Voted
WWW
2010
ACM
15 years 1 months ago
2010
ACM
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as ...
133
Voted
KDD
2007
ACM
16 years 1 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...