Authoritative sources in a hyperlinked environment

DOI10.1145/324133.324140zbMath1065.68660OpenAlexW2138621811WikidataQ29647542 ScholiaQ29647542MaRDI QIDQ3158552

Publication date: 25 January 2005

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/324133.324140

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (only showing first 100 items - show all)

On the communal analysis suspicion scoring for identity crime in streaming credit applications ⋮ Network-based marketing: identifying likely adopters via consumer networks ⋮ Social Forwarding in Mobile Opportunistic Networks: A Case of PeopleRank ⋮ Financial networks and interconnectedness in an advanced emerging market economy ⋮ Cheeger Inequalities for General Edge-Weighted Directed Graphs ⋮ Brexit news propagation in financial systems: multidimensional visibility networks for market volatility dynamics ⋮ HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank ⋮ Stochastic Bounds with a Low Rank Decomposition ⋮ A Fast Greedy Algorithm for the Critical Node Detection Problem ⋮ Design of biased random walks on a graph with application to collaborative recommendation ⋮ A metric to compare vulnerability of the graphs of different sizes ⋮ Restricted bi-pattern mining ⋮ Find Your Place: Simple Distributed Algorithms for Community Detection ⋮ Vector centrality in hypergraphs ⋮ Matrix functions in network analysis ⋮ Combining bootstrap data envelopment analysis with social networks for rank discrimination and suitable potential benchmarks ⋮ Perron communicability and sensitivity of multilayer networks ⋮ Detection of key figures in social networks by combining harmonic modularity with community structure-regulated network embedding ⋮ \textsc{PeerNomination}: a novel peer selection algorithm to handle strategic and noisy assessments ⋮ Ranking nodes in directed networks via continuous-time quantum walks ⋮ Analysis of directed networks via the matrix exponential ⋮ Link prediction based on the mutual information with high-order clustering structure of nodes in complex networks ⋮ On the resolution of cross-liabilities ⋮ Global and local structure‐based influential nodes identification in wheel‐type networks ⋮ Axiomatic characterization of PageRank ⋮ SPECTRAL METHODS CLUSTER WORDS OF THE SAME CLASS IN A SYNTACTIC DEPENDENCY NETWORK ⋮ Community detection in attributed networks for global transfer market ⋮ A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks ⋮ On computing HITS ExpertRank via lumping the hub matrix ⋮ Web Structure Mining by Isolated Stars ⋮ Representing and Quantifying Rank - Change for the Web Graph ⋮ Web page importance ranking ⋮ Graph ambiguity ⋮ Perron vector optimization applied to search engines ⋮ Intrinsic Graph Structure Estimation Using Graph Laplacian ⋮ On the influence of a ranking system ⋮ Decentralized mining social network communities with agents ⋮ Learning to Rank in Entity Relationship Graphs ⋮ Aspect and Entity Extraction for Opinion Mining ⋮ A Generalized Approach for Social Network Integration and Analysis with Privacy Preservation ⋮ Optimizing spread dynamics on graphs by message passing ⋮ On a matrix-based measure of the degree of coreness of a node in a network ⋮ On the relationship between Gaussian stochastic blockmodels and label propagation algorithms ⋮ Influence network in the Chinese stock market ⋮ M-Centrality: identifying key nodes based on global position and local degree variation ⋮ Tunable Eigenvector-Based Centralities for Multiplex and Temporal Networks ⋮ Contracted Webgraphs: Structure Mining and Scale-Freeness ⋮ Parameterized Complexity of Multi-Node Hubs ⋮ Graph similarity scoring and matching ⋮ Low-Rank Binary Matrix Approximation in Column-Sum Norm. ⋮ Core–periphery structure in directed networks ⋮ ANALYSIS OF WEB SEARCH ALGORITHM HITS ⋮ Asymptotic analysis for personalized Web search ⋮ From Affiliation Matrices to Adjacency Matrices: Methods and Techniques for the Analysis of Centrality ⋮ Eigenvector-Based Centrality Measures for Temporal Networks ⋮ A faster algorithm for betweenness centrality* ⋮ TEXTUAL-BASED CLUSTERING OF WEB DOCUMENTS ⋮ Block classical Gram–Schmidt-based block updating in low-rank matrix approximation ⋮ Diffusion maps ⋮ Scoring of web pages and tournaments-axiomatizations ⋮ QoRank: A query-dependent ranking model using LSE-based weighted multiple hyperplanes aggregation for information retrieval ⋮ Distribution of PageRank Mass Among Principle Components of the Web ⋮ Determining Factors Behind the PageRank Log-Log Plot ⋮ Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms ⋮ Information ranking and power laws on trees ⋮ Edge Modification Criteria for Enhancing the Communicability of Digraphs ⋮ Bipartite communities via spectral partitioning ⋮ Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies ⋮ Spectra of random graphs with given expected degrees ⋮ Entropy of dialogues creates coherent structures in e-mail traffic ⋮ PageRank Beyond the Web ⋮ Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ Support Vector Machines for Dyadic Data ⋮ A decentralized algorithm for spectral analysis ⋮ Non-Backtracking Alternating Walks ⋮ Axioms for Centrality ⋮ Toward Quantifying Vertex Similarity in Networks ⋮ A remark on the spectra of random graphs with given expected degrees ⋮ Application of HITS Algorithm in Web Mining in Literature Evaluation and Empirical Study ⋮ CENTRALITY ESTIMATION IN LARGE NETWORKS ⋮ CENTRALITY ESTIMATION IN LARGE NETWORKS ⋮ On maximum signless Laplacian Estrada index of graphs with given parameters II ⋮ Unnamed Item ⋮ Tensor decomposition for link prediction in temporal directed networks* ⋮ On the Limiting Behavior of Parameter-Dependent Network Centrality Measures ⋮ Settlement Fund Circulation Problem ⋮ V–E Algorithm: A New Vital Vertex Identifying Algorithm Based on Vertex–Edge Interaction ⋮ Three Hypergraph Eigenvector Centralities ⋮ A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance ⋮ Deriving Pandemic Disease Mitigation Strategies by Mining Social Contact Networks ⋮ Organization mining using online social networks ⋮ On finding common neighborhoods in massive graphs. ⋮ PageRank centrality for temporal networks ⋮ Evaluating user reputation in online rating systems via an iterative group-based ranking method ⋮ Ranking in evolving complex networks ⋮ Axioms for centrality scoring with principal eigenvectors ⋮ Multi-attribute community detection in international trade network ⋮ Topic-adjusted visibility metric for scientific articles ⋮ Who's who in global value chains? A weighted network approach

This page was built for publication: Authoritative sources in a hyperlinked environment