Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 19 of 19 for “"personalized PageRank"”.

  1. IVIS: Search and visualization on heterogeneous information networks

    … the ranking algorithm, and we show that the personalized PageRank and proposed Hetero-personalized PageRank outperform the TF-IDF ranking or mixture of TF-IDF and authority ranking. Our work opens several directions for future research.

    uiuc Repository record for IVIS: Search and visualization on heterogeneous information networks (opens in a new tab)

  2. People and reverse people search on the internet

    … like entity resolution, clustering, random walk, personalized PageRank and etc. System is practical and produces good results.

    uiuc Repository record for People and reverse people search on the internet (opens in a new tab)

  3. Iterative Graph Computation In The Big Data Era

    … vertices and edges. We focus on the parametric PageRank problem, usually known as personalized PageRank. This method has been widely used to find vertices in a graph that are most relevant to a query or user. However, edge-weighted personalized PageRank has been an open problem for over a …

    cornell Repository record for Iterative Graph Computation In The Big Data Era (opens in a new tab)

  4. Advanced Applications Of Big Data Analytics

    … centrality, Katz Receive centrality, and PageRank centrality etc., comes handy in solving these problems. In this thesis, we propose different formulae for computing the strength for identifying top-K nodes and communities that can spread viral marketing messages into the network. The …

    unlv Repository record for Advanced Applications Of Big Data Analytics (opens in a new tab) Download PDF for Advanced Applications Of Big Data Analytics (opens in a new tab)

  5. EFFECTIVE AND EFFICIENT RANDOM WALK PROXIMITY MEASURES FOR GRAPH ANALYTICS

    … a novel node distance measure based on personalized PageRank and its fast estimation, enhancing visualization quality and efficiency. The thesis then refines spanning centrality, a critical measure of edge importance, through proposed algorithms, significantly reducing computational …

    nus Repository record for EFFECTIVE AND EFFICIENT RANDOM WALK PROXIMITY MEASURES FOR GRAPH ANALYTICS (opens in a new tab) Download file for EFFECTIVE AND EFFICIENT RANDOM WALK PROXIMITY MEASURES FOR GRAPH ANALYTICS (opens in a new tab)

  6. Local Graph Clustering Using l1-regularized PageRank Algorithms

    … been shown that the combination of Approximate Personalized PageRank (APPR) algorithm and sweep method can efficiently detect a small cluster around the starting vertex. This research explores the optimization framework proposed in the work by Fountoulakis et al., where a connection between the …

    waterloo Repository record for Local Graph Clustering Using l1-regularized PageRank Algorithms (opens in a new tab)

  7. PARALLEL GRAPH PROCESSING ON GPUS

    … GPU memory. Finally, in the third work, we study personalized PageRank (PPR) on dynamic graphs and propose a parallel approach for dynamic PPR computation.

    nus Repository record for PARALLEL GRAPH PROCESSING ON GPUS (opens in a new tab) Download file for PARALLEL GRAPH PROCESSING ON GPUS (opens in a new tab)

  8. Multiple Diagram Navigation

    … model. We also studied two ranking algorithms: Personalized PageRank (PPR), an algorithm used in similar applications; and Greedy Energy Spreading (GES), an algorithm that we designed. We also studied different approaches to computing rankings for C2D queries. Our results show encouraging …

    portland-state Repository record for Multiple Diagram Navigation (opens in a new tab)

  9. Community Detection in Complex Networks

    … graph clustering method that uses heat kernel PageRank to efficiently find a local cluster in massive graphs. The heat kernel PageRank provides a quantitative ranking of nodes, and a local cluster is then found by performing a sweep over the heat kernel PageRank vector. But computing an exact …

    wustl Repository record for Community Detection in Complex Networks (opens in a new tab)

  10. Behaviors, Interactions, And Communities In Networks

    … that it is asymptotically equivalent to personalized PageRank. This connection provides a novel formal motivation for the success of personalized PageRank in seed set expansion and node ranking generally. We then leverage this framework to develop several theoretically motivated …

    cornell Repository record for Behaviors, Interactions, And Communities In Networks (opens in a new tab)

  11. Efficient approximation of social relatedness over large social networks and application to query enabled recommender systems

    … developed in numerical linear algebra and personalized PageRank computing. Using three real-world networks, we examine scalability and accuracy of our algorithms as in a short time as milliseconds to seconds. We also hypothesize that incorporating item based tags into a recommender system …

    ubc Repository record for Efficient approximation of social relatedness over large social networks and application to query enabled recommender systems (opens in a new tab) Download PDF for Efficient approximation of social relatedness over large social networks and application to query enabled recommender systems (opens in a new tab)

  12. Evaluation of Citation Graph Thematic Dataset Construction and Paper Filtering Methods for Research Literature Recommendation

    … collaborative filtering, combined with PageRank and personalized PageRank algorithms. The experimental findings provide clear evidence that utilizing citation graph network datasets significantly enhances the efficacy of research paper recommender systems. This improvement simplifies the …

    concordia Download PDF for Evaluation of Citation Graph Thematic Dataset Construction and Paper Filtering Methods for Research Literature Recommendation (opens in a new tab)

  13. Applications of Geometric and Spectral Methods in Graph Theory

    … can be used in the context of understanding (personalized) PageRank, which was developed by Brin and Page. PageRank ranks the importance of webpages near a seed webpage, and we are interested in how this importance diffuses. We do this by using a notion of graph curvature introduced by Bauer, …

    denver Repository record for Applications of Geometric and Spectral Methods in Graph Theory (opens in a new tab)

  14. A Stochastic System Model for PageRank: Parameter Estimation and Adaptive Control

    … near the top of the list of query results. The PageRank algorithm provides one way of achieving such a useful hierarchical indexing by assigning a measure of relative importance, called the PageRank value, to each webpage. PageRank is motivated by the inherently hypertextual structure of the …

    ku Repository record for A Stochastic System Model for PageRank: Parameter Estimation and Adaptive Control (opens in a new tab)

  15. Scalable Algorithms for Mining High-dimensional and Complex Data

    … entity. A new framework is proposed that employs Personalized PageRank to quantify the matching score of each node pair. We then propose a strategy that postpones the selection of pairs that have competitors with similar matching scores; we theoretically prove the effect of postponing strategy on …

    unsw Repository record for Scalable Algorithms for Mining High-dimensional and Complex Data (opens in a new tab)

  16. Hybrid Query Expansion on Ontology Graph in Biomedical Information Retrieval

    … selected vocabularies in Metathesaurus. We apply Personalized PageRank algorithm on the ontology graph to rank and identify top terms which are highly relevant to the original user query, yet not presented in that query. Those new terms are reordered by a weighted scheme to prioritize specialized …

    clemson Repository record for Hybrid Query Expansion on Ontology Graph in Biomedical Information Retrieval (opens in a new tab)

  17. Overlapping community detection in massive social networks

    … and then greedily expand these seeds using a personalized PageRank clustering scheme. Experimental results show that our algorithm significantly outperforms other state-of-the-art overlapping community detection methods in terms of run time, cohesiveness of communities, and ground-truth …

    texas Repository record for Overlapping community detection in massive social networks (opens in a new tab)

  18. Ranking of hazardous materials facility siting through routing evaluation considering transportation preferences and risk

    … the concept of Random Walk with Restart and (Personalized) PageRank. This method evaluates the designated or shortest routes against potential hazards. This research module augments the routing part of the developed ranking methodology and answers whether an alternate path, rather a more …

    manitoba Repository record for Ranking of hazardous materials facility siting through routing evaluation considering transportation preferences and risk (opens in a new tab)

  19. Complex Network Analysis and the Applications in Vehicle Delay-Tolerant Networks

    … to overcome above drawbacks, inspired by the personalized PageRank algorithm, we design new algorithms for calculating multi-hop reachability of vehicles to different communities and vehicles dynamically. Therefore, the routing efficiency of each copy can be enhanced. Finally, extensive …

    clemson Repository record for Complex Network Analysis and the Applications in Vehicle Delay-Tolerant Networks (opens in a new tab)