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 20 of 32 for “"PageRank"”.
-
Será PageRank um algoritmo fidedigno para avaliar a credibilidade de um Website?
O PageRank é um algoritmo criado pelo Google para hierarquizar os websites em termos de credibilidade, ordenando-os assim por ordem do mais credível ao menos credível na sua base de dados e motor de busca da marca. O objectivo da presente investigação foi apurar, através de uma pesquisa profunda, …
-
Webpage rank using Bayes' rule and connected components
… OF MISSOURI-COLUMBIA AT AUTHOR'S REQUEST.] The PageRank is one of the most famous link-structure based webpage ranking algorithm adopted by Google which measures the importance of the webpages by their probability of being visited. However, the bottleneck of the PageRank computing speed is the …
-
IVIS: Search and visualization on heterogeneous information networks
… 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.
-
People and reverse people search on the internet
… clustering, random walk, personalized PageRank and etc. System is practical and produces good results.
-
I2MAPREDUCE: DATA MINING FOR BIG DATA
… model that includes iteration algorithms such as PageRank, Fuzzy-C-Means(FCM), Generalized Iterated Matrix-Vector Multiplication(GIM-V), Single Source Shortest Path(SSSP). The main purpose of this project is to reduce input/output overhead, to avoid incurring the cost of re-computation and avoid …
-
Αρχιτεκτονικές λογισμικού για περιβάλλοντα επίλυσης προβλημάτων και εφαρμογές στο ασύγχρονο μοντέλο υπολογισμού
… στον υπολογισμό του διανύσματος του PageRank το οποίο χρησιμοποιεί η Google για να διατάξει τα αποτελέσματα μιας ερώτησης που υποβάλλουμε στη μηχανή αναζήτησής της. Αποδεικνύουμε πως και άλλες μέθοδοι διάταξης, οι οποίες εκφράζονται πρωταρχικά ως δυναμοσειρές ενός τροποποιημένου …
-
A novel weighted rank aggregation algorithm with applications in gene prioritization
… parameters, and outperform methods based on PageRank and Weighted Bipartite Matching. Finally, we illustrate the performance of the aggregation method on a set of test genes pertaining to the Bardet-Biedl syndrome, schizophrenia, and HIV and show that the combinatorial method matches or …
-
Applications of Geometric and Spectral Methods in Graph Theory
… 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, Horn, Lin, …
-
How to attribute credit if you must
… Katz centrality, in-degree centrality, and PageRank are three potentially useful centrality measures, with varying results: these are compared using case studies based on three papers co-authored by Andrei Shleifer. We use these centrality measures to guide how to fairly attribute credit, …
-
Networked interactions, graphical models and econometrics perspectives in data analysis
… complexes, we study a simplicial notion of PageRank centrality as defined in [Schaub et al., 2018].
-
Towards the integration of genomic profiles and gene interaction networks for machine learning
… implicated by gene ranking methods such as PageRank. Last, we apply network propagation to a dataset presented by the DREAM organization, and show we can improve a naive linear regression that solves for a drug sensitive ranking task."
-
Graph diffusions and matrix functions: fast algorithms and localization results
… matrix functions for graph analysis, PageRank and the matrix exponential, stay localized on networks that have a skewed degree sequence related to the power-law degree distribution common to many real-world networks. Our results give the first theoretical explanation of a localization …
-
Messaging for large-scale distributed computation with factor graphs
… [18], (b) native Ligra [251 for large scale PageRank, and (c) a hardware optimized implementation over 68 machine cluster of Apache Spark for computing SVD [11]. In addition, we present a new algorithm for Integer Optimization problems using Belief Propagation, which is of independent …
-
Collaboration effectiveness in energy research and development : an empirical study of patents
… to higher patent quality as defined by the PageRank of patent citations, consistent with previous findings. The novel finding is that interactions between patent technology and collaboration are meaningful. The results that renewables have less frequent and less effective partnerships is …
-
Shortest paths, Markov chains, matrix scaling and beyond : improved algorithms through the lens of continuous optimization
… such as stationary distributions, personalized PageRank vectors, hitting times, or escape probabilities. This significantly improves over the previous state-of-the-art, which was based on simulating random walks, or applying fast matrix multiplication. *-- We develop faster algorithms for …
-
Computational Labeling, Partitioning, and Balancing of Molecular Networks
… annotation, we develop AptRank, an adaptive PageRank model for protein function prediction on bilayer networks. By integrating Gene Ontology (GO) hierarchy with protein-protein interaction network, our AptRank outperforms four state-of-the-art methods in a comprehensive evaluation using …
-
High quality functional coverage based trace signal selection for post-silicon validation
… problem and propose two approaches using PageRank and HITS algorithm. Our experimental results demonstrate that our algorithm can effectively alleviate the diminishing restoration ratio effect. Furthermore, we propose a new metric to evaluate the quality of selected trace signals instead …
-
Continuous representations and models from random walk diffusion limits
… density estimation to network algorithms such as PageRank. Next, we demonstrate that continuous representations of words are a type of random walk metric estimator with close connections to manifold learning. Finally, we apply our theory to single-cell RNA seq data, and derive a way to learn …
-
Determining influence in social networks using Social Capital
… collaboration network our algorithm outperforms PageRank, PMIA and Weighted Degree baselines by up to 8% in terms of precision recall and F1-measure.Furthermore, we use Hypergraphs as a tool to model group collaborations more effectively and empirically show the superiority of hypergraph edge …
-
Distances on rankings: from social choice to flash memories
… weight bipartite matching and another is a PageRank-type algorithm in which the transition probabilities of a Markov chain model yield the aggregate ranking. In the context of coding theory, we introduce permutation codes in the Ulam metric that were not previously reported in the …
Page 1 of 2