7387 search results - page 1153 / 1478 » Knowledge-based data mining |
215
click to vote
PAKDD
2011
ACM
14 years 9 months ago
2011
ACM
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
359
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
372
click to vote
SISAP
2011
IEEE
14 years 9 months ago
2011
IEEE
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
187
click to vote
WSDM
2012
ACM
14 years 2 months ago
2012
ACM
Prediction of popular items in online content sharing systems has recently attracted a lot of attention due to the tremendous need of users and its commercial values. Different fr...
229
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
In this paper, we investigate a problem of predicting what images are likely to appear on the Web at a future time point, given a query word and a database of historical image str...