199 search results - page 15 / 40 » A large time-aware web graph |
VLDB
2000
ACM
13 years 11 months ago
2000
ACM
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
COLING
2010
13 years 2 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
ICITA
2005
IEEE
14 years 1 months ago
2005
IEEE
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...