A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Heat kernel based community detection
2014
Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '14
Preserved Fulltext
Using this method, we propose a PageRank solution path plot to diagnose new aspects of the behavior of personalized PageRank. ...
Personalized PageRank vectors used for many community detection and graph diffusion problems have a subtle dependence on a parameter epsilon that controls their accuracy. ...
PERSONALIZED PAGERANK PATHS We now show the types of insights that our solution path methodology can provide. We should illustrate that these are primarily designed for human interpretation. ...
doi:10.1145/2623330.2623706
dblp:conf/kdd/KlosterG14
fatcat:yfh5k4xgg5cyhgf56w5hkmzzv4
PageRank optimization by edge selection
2014
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
By applying results from Markov decision theory, we show that an optimal solution to this problem can be found in polynomial time. ...
The importance of a node in a directed graph can be measured by its PageRank. ...
Stochastic Shortest Path Problems In this section we give an overview on stochastic shortest path problems, since our solutions to PageRank optimization are built upon their theory. ...
doi:10.1016/j.dam.2014.01.007
fatcat:atamsrcpsna5ljo7uap7elflze
PageRank: Standing on the shoulders of giants
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
PageRank is a Web page ranking technique that has been a fundamental ingredient in the development and success of the Google search engine. ...
The main idea behind PageRank is to determine the importance of a Web page in terms of the importance assigned to the pages hyperlinking to it. ...
COMPUTING THE PAGERANK VECTOR Does Equation 1 have a solution? Is the solution unique? Can we efficiently compute it? The success of the PageRank method rests on the answers to these queries. ...
arXiv:1002.2858v3
fatcat:uptl5l6pbfez3eedjszmnaialy
Towards Scaling Fully Personalized PageRank
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way as PageRank expresses quality over the entire Web. ...
Existing personalized PageRank algorithms can however serve on-line queries only for a restricted choice of page selection. ...
For nonuniform r the solution p will be referred to as personalized PageRank vector denoted by PPV(r). ...
doi:10.1007/978-3-540-30216-2_9
fatcat:3edt7ai75fcvvlpidjifuvflgm
Graph Analytical Re-Ranking for Entity Search
2018
International Conference on Information and Knowledge Management
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Since query-based graph analytical approaches fit to entity search tasks, this paper proposes a personalized PageRankbased re-ranking method, PPRSD (Personalized PageRank based Score Distribution), for ...
For further improvements, this paper reports investigations about relationship between queries and entities in terms of path lengths on the graph, and discusses future directions for graph analytical approaches ...
the state-of-the-art in a personalized PageRank manner. ...
dblp:conf/cikm/Komamizu18
fatcat:sjzh4ws3hrcsvccvcvxfhcxq3q
PageRank
2011
Communications of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Computing the PageRank Vector
Does Equation 1 have a solution? Is the solution unique? Can we efficiently compute it? The success of the PageRank method rests on the answers to these queries. ...
A PageRank instance with solution. each node is labeled with its PageRank score. scores have been normalized to sum to 100. We assumed α = 0.85. ...
Eigenfactor, 34 a PageRank-inspired bibliometric indicator, is among the most interesting recent proposals to collectively evaluate the status of academic journals. ...
doi:10.1145/1953122.1953146
fatcat:nvpvndyvcnb5nf6ed7mhnkktem
Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
2005
Internet Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Personalized PageRank expresses link-based page quality around userselected pages in a similar way as PageRank expresses quality over the entire web. ...
Existing personalized PageRank algorithms can, however, serve online queries only for a restricted choice of pages. ...
For nonuniform r the solution p will be referred to as the personalized PageRank vector of r, denoted by PPV( r). ...
doi:10.1080/15427951.2005.10129104
fatcat:pqvorytb75fv7orxfvxrprglqi
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
By applying results from Markov decision theory, we show that an optimal solution to this problem can be found in polynomial time. ...
The importance of a node in a directed graph can be measured by its PageRank. ...
Stochastic Shortest Path Problems In this section we give an overview on stochastic shortest path problems, since our solutions to PageRank optimization are built upon their theory. ...
doi:10.1007/978-3-642-16108-7_11
fatcat:ylugdked6fb63b2ckl3jr4q2zq
Efficient inference and learning in a large knowledge base
2015
Machine Learning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that the problem of constructing proofs for this logic is related to computation of personalized PageRank on a linearized version of the proof space, and based on this connection, we develop a ...
provably-correct approximate grounding scheme, based on the PageRank-Nibble algorithm. ...
Like ProPPR, PRA will weight some solutions to these paths more heavily than others: specifically, weights of the solutions to a PRA "path" are based on random-walk probabilities in the corresponding ...
doi:10.1007/s10994-015-5488-x
fatcat:fnm4vho5abdejiuvgsc6abtxta
Statistical guarantees for local graph clustering
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
From a computational perspective, we show that the solution path of l1-regularized PageRank is monotonic. ...
This allows for the application of the forward stagewise algorithm, which approximates the solution path in running time that does not depend on the size of the whole graph. ...
Approximate personalized PageRank (APPR): In Andersen et al. (2006) and Zhu et al. (2013) an approximate personalized PageRank (APPR) algorithm is proposed, where the personalized PageRank linear system ...
arXiv:1906.04863v3
fatcat:xgjdr3krojfopcw3uwg2lwstuu
Identification of Pivotal node in Terrorist Network using TOPSIS Method
2019
VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
traversal, graph optimization and multi criteria decision making In this paper one of the multi criteria decision making (MCDM) algorithm TOPSIS (technique for order preference by similarity to ideal solution ...
Betweenness centrality defined as a how many times a node lie on path between other nodes. PageRank centrality shows support of node from other nodes. ...
So to calculate betweenness centrality of node n, we get shortest path between all nodes and try to find out how many times shortest paths goes through n. ...
doi:10.35940/ijitee.h7096.078919
fatcat:iuqsyfw4yjhyzdw2bfywlcynz4
PageRank: Splitting Homogeneous Singular Linear Systems of Index One
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our explanation also covers a PageRank extension to accommodate TrustRank. ...
explanation, we introduce and apply a general linear algebraic theorem which allows us to map homogeneous singular linear systems of index one to inhomogeneous non-singular linear systems with a shared solution ...
The theorem may be used to apply novel solution methods to eigenvector problems. ...
doi:10.1007/978-3-642-04417-5_3
fatcat:ilwi5qicnbe7pjoo52kgkqru7q
SM-PageRank Algorithm-Based User Interest Model for Mobile Smart Tourism Platform
2022
Wireless Communications and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Through information retrieval experiment and fusion technology solution experiment, the results show that the SM-PageRank algorithm and the secondary sorting based on user interest model proposed in this ...
The function of information fusion algorithm is to find the global optimal solution for travel routing. LBS technology collects real-time tourism information through some entity sensors. ...
Figure 7 : 7 Figure 7: Optimal solution path graph and local optimal solution path graph of fusion algorithm. ...
doi:10.1155/2022/6034500
fatcat:5fv7h7zptrh4rhaqs4c5cltpyi
Community Detection Using Time-Dependent Personalized PageRank
2015
International Conference on Machine Learning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We present an efficient local algorithm for approximating a graph diffusion that generalizes both the celebrated personalized PageRank and its recent competitor/companion -the heat kernel. ...
Our experimental results suggest that it produces rankings that are distinct and competitive with the ones produced by high quality implementations of personalized PageRank and localized heat kernel, and ...
Our goal is to integrate the time-dependent personalized PageRank (2) vector in this framework, instead of the personalized PageRank vector or the heat kernel vector. ...
dblp:conf/icml/AvronH15
fatcat:xiym4oigx5gfdf65l63ynw6ksq
Spectral affinity in protein networks
2009
BMC Systems Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
PageRank considers paths of all lengths in a network, therefore PageRank Affinity is a precise measure that is robust to noise in the data. ...
Results: We develop a novel affinity measure for pairs of proteins in PPI networks, which uses personalized PageRank, a random walk based method used in context-sensitive search on the Web. ...
As discussed in Methods, personalized PageRank takes into account all paths between two nodes in a graph (with more weight given to shorter paths), by considering an arbitrarily long random walk from the ...
doi:10.1186/1752-0509-3-112
pmid:19943959
pmcid:PMC2797010
fatcat:dmfgkdxnonecjfpv3nmj4ceecm
« Previous
Showing results 1 — 15 out of 3,592 results