Results 201 to 210 of about 10,068 (229)
Some of the next articles are maybe not open access.
Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003), 2004
The definition of the ordering of the Web pages, returned on a given query, is a crucial topic, which gives rise to the notion of Web visibility. A fundamental contribution towards the conception of appropriate ordering criteria has been given by means of the introduction of PageRank, which takes into account only the hyper-linked structure of the Web,
Bianchini M., Gori M., Scarselli F.
openaire +2 more sources
The definition of the ordering of the Web pages, returned on a given query, is a crucial topic, which gives rise to the notion of Web visibility. A fundamental contribution towards the conception of appropriate ordering criteria has been given by means of the introduction of PageRank, which takes into account only the hyper-linked structure of the Web,
Bianchini M., Gori M., Scarselli F.
openaire +2 more sources
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014
Graph-based ranking plays a key role in many applications, such as web search and social computing. Pioneering methods of ranking on graphs (e.g., PageRank and HITS) computed ranking scores relying only on the graph structure. Recently proposed methods, such as Semi-Supervised Page-Rank, take into account both the graph structure and the metadata ...
Maxim Zhukovskiy +2 more
openaire +1 more source
Graph-based ranking plays a key role in many applications, such as web search and social computing. Pioneering methods of ranking on graphs (e.g., PageRank and HITS) computed ranking scores relying only on the graph structure. Recently proposed methods, such as Semi-Supervised Page-Rank, take into account both the graph structure and the metadata ...
Maxim Zhukovskiy +2 more
openaire +1 more source
Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004., 2004
With the rapid growth of the Web, users easily get lost in the rich hyper structure. Providing the relevant information to users to cater to their needs is the primary goal of Website owners. Therefore, finding the content of the Web and retrieving the users' interests and needs from their behavior have become increasingly important. Web mining is used
Wenpu Xing, Ali A. Ghorbani 0001
openaire +2 more sources
With the rapid growth of the Web, users easily get lost in the rich hyper structure. Providing the relevant information to users to cater to their needs is the primary goal of Website owners. Therefore, finding the content of the Web and retrieving the users' interests and needs from their behavior have become increasingly important. Web mining is used
Wenpu Xing, Ali A. Ghorbani 0001
openaire +2 more sources
A cautious surfer for PageRank
Proceedings of the 16th international conference on World Wide Web, 2007This work proposes a novel cautious surfer to incorporate trust into the process of calculating authority for web pages. We evaluate a total of sixty queries over two large, real-world datasets to demonstrate that incorporating trust can improve PageRank's performance.
Lan Nie +2 more
openaire +2 more sources
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, 2012
One of the most important features of the Web graph and social networks is that they are constantly evolving. The classical computational paradigm, which assumes a fixed data set as an input to an algorithm that terminates, is inadequate for such settings. In this paper we study the problem of computing PageRank on an evolving graph.
Bahman Bahmani +3 more
openaire +1 more source
One of the most important features of the Web graph and social networks is that they are constantly evolving. The classical computational paradigm, which assumes a fixed data set as an input to an algorithm that terminates, is inadequate for such settings. In this paper we study the problem of computing PageRank on an evolving graph.
Bahman Bahmani +3 more
openaire +1 more source
Parallelizing the Computation of PageRank
2007This paper presents a technique we call ParaSolve that exploits the sparsity structure of the web graph matrix to improve on the degree of parallelism in a number of distributed approaches for computating PageRank. Specifically, a typical algorithm (such as power iteration or GMRES) for solving the linear system corresponding to PageRank, call it ...
John R. Wicks, Amy Greenwald
openaire +2 more sources
A Calculus for Personalized PageRank
2013This paper proposes a calculus for computing personalized PageRank for complex categories given a precomputed set of primitive categories. This is a work in progress aiming at reduction of the necessary number of precomputed PageRanks for a set of (next to disjoint) categories.
Mieczyslaw A. Klopotek +4 more
openaire +1 more source
Proceedings of the 11th international conference on World Wide Web, 2002
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query.
openaire +1 more source
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query.
openaire +1 more source
2021 IEEE/ACM 11th Workshop on Irregular Applications: Architectures and Algorithms (IA3), 2021
Scott Sallinen, Matei Ripeanu
openaire +1 more source
Scott Sallinen, Matei Ripeanu
openaire +1 more source