Sciweavers

1109 search results - page 186 / 222
» Crawling on web graphs
Sort
View
ICDE
2000
IEEE
96views Database» more  ICDE 2000»
16 years 5 months ago
Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani
WWW
2009
ACM
16 years 5 months ago
idMesh: graph-based disambiguation of linked data
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
Hermann de Meer, Karl Aberer, Michael Jost, Parisa...
WWW
2005
ACM
16 years 5 months ago
TruRank: taking PageRank to the limit
PageRank is defined as the stationary state of a Markov chain depending on a damping factor that spreads uniformly part of the rank. The choice of is eminently empirical, and in...
Sebastiano Vigna
WWW
2004
ACM
16 years 5 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
ICDIM
2007
IEEE
15 years 10 months ago
Route navigation method for disabled access GIS in consideration of abilities and psychologies
: This paper aims to propose a route navigation method for disabled access GIS. We focused the disabled’s psychologies as well as their physical conditions. This paper represents...
Shinobu Izumi, Go Kobayashi, Takaichi Yoshida