370 search results - page 48 / 74 » Hierarchical Link Analysis for Ranking Web Data |
153
click to vote
WSDM
2009
ACM
16 years 29 days ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
173
click to vote
SDM
2007
SIAM
15 years 7 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...
131
click to vote
WWW
2009
ACM
16 years 6 months ago
2009
ACM
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
167
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
169
click to vote
KAIS
2008
15 years 6 months ago
2008
This paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006: C4.5, k-Means, SVM, Apriori, EM, Page...