17 search results - page 2 / 4 » Measuring extremal dependencies in web graphs |
WSDM
2009
ACM
13 years 11 months 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...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
WEBI
2005
Springer
13 years 10 months ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
WIDM
2004
ACM
13 years 10 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...