Authoritative sources in a hyperlinked environment
From MaRDI portal
Publication:3158552
DOI10.1145/324133.324140zbMATH Open1065.68660OpenAlexW2138621811WikidataQ29647542 ScholiaQ29647542MaRDI QIDQ3158552FDOQ3158552
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
Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Network design and communication in computer systems (68M10)
Cited In (only showing first 100 items - show all)
- New results for finding common neighborhoods in massive graphs in the data stream model
- Design of biased random walks on a graph with application to collaborative recommendation
- Competitive collaborative learning
- Distribution of PageRank Mass Among Principle Components of the Web
- Matrix functions in network analysis
- Tensor decomposition for link prediction in temporal directed networks*
- Choose the damping, choose the ranking?
- A new method (K-method) of calculating the mutual influence of nodes indirected weight complex networks
- Detecting cooperative and organized spammer groups in micro-blogging community
- On a matrix-based measure of the degree of coreness of a node in a network
- A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance
- Intrinsic Graph Structure Estimation Using Graph Laplacian
- On finding common neighborhoods in massive graphs.
- SPECTRAL METHODS CLUSTER WORDS OF THE SAME CLASS IN A SYNTACTIC DEPENDENCY NETWORK
- Evaluating user reputation in online rating systems via an iterative group-based ranking method
- Low-Rank Binary Matrix Approximation in Column-Sum Norm.
- A new centrality measure of nodes in multilayer networks under the framework of tensor computation
- How to identify experts in a community?
- Who's who in global value chains? A weighted network approach
- Organization mining using online social networks
- Bayesian belief networks for IR.
- Combined social networks and data envelopment analysis for ranking
- A metric to compare vulnerability of the graphs of different sizes
- The science of science: from the perspective of complex systems
- Underestimated cost of targeted attacks on complex networks
- Iterative methods for low rank approximation of graph similarity matrices
- Closure spaces that are not uniquely generated
- Eigenvector-Based Centrality Measures for Temporal Networks
- A complex network approach to text summarization
- The mathematics of internet search engines
- Principle components and importance ranking of distributed anomalies
- Agglomerative clustering via maximum incremental path integral
- \textit{Post-mortem} examination of the international financial network
- On maximum signless Laplacian Estrada index of graphs with given parameters II
- Predicting link directions via a recursive subgraph-based ranking
- TEXTUAL-BASED CLUSTERING OF WEB DOCUMENTS
- Mutual rankings
- Toward Quantifying Vertex Similarity in Networks
- Computing multiperiod efficiency using dominance networks
- Modelling the navigation potential of a web page
- Network-based marketing: identifying likely adopters via consumer networks
- Visualizing bivariate long-tailed data
- Social Forwarding in Mobile Opportunistic Networks: A Case of PeopleRank
- QoRank: A query-dependent ranking model using LSE-based weighted multiple hyperplanes aggregation for information retrieval
- Parameterized complexity of multi-node hubs
- Experiments on \(F\)-restricted bi-pattern mining
- On the exponential ranking and its linear counterpart
- Comprehensive decomposition optimization method for locating key sets of commenters spreading conspiracy theory in complex social networks
- Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results
- An adaptive spectral clustering algorithm based on the importance of shared nearest neighbors
- Non-Backtracking Alternating Walks
- Community detection with the label propagation algorithm: a survey
- HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
- Learning to Rank in Entity Relationship Graphs
- A generalization of the Buckley-Osthus model for web graphs
- PageRank centrality for temporal networks
- Optimizing spread dynamics on graphs by message passing
- Hierarchical relational models for document networks
- Entropy of dialogues creates coherent structures in e-mail traffic
- Statistical ranking and combinatorial Hodge theory
- Disease invasion on community networks with environmental pathogen movement
- Anti-modularity and anti-community detecting in complex networks
- ORCA: outlier detection and robust clustering for attributed graphs
- Analysis of multiview legislative networks with structured matrix factorization: does Twitter influence translate to the real world?
- Deriving Pandemic Disease Mitigation Strategies by Mining Social Contact Networks
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- A decentralized algorithm for spectral analysis
- Ranking the spreading ability of nodes in complex networks based on local structure
- A Fast Greedy Algorithm for the Critical Node Detection Problem
- Reconstruction methods for networks: the case of economic and financial systems
- On the influence of a ranking system
- CENTRALITY ESTIMATION IN LARGE NETWORKS
- Random walks and diffusion on networks
- Diffusion maps
- Axioms for centrality scoring with principal eigenvectors
- Fifty years of graph matching, network alignment and network comparison
- PageRank beyond the web
- Learn to rank images: a unified probabilistic hypergraph model for visual search
- Determining Factors Behind the PageRank Log-Log Plot
- CENTRALITY ESTIMATION IN LARGE NETWORKS
- Behavior-based reputation management in P2P file-sharing networks
- Information mining in weighted complex networks with nonlinear rating projection
- Topic-adjusted visibility metric for scientific articles
- Graph spectra in computer science
- A hybrid approach to predicting sports results and an accurate rating system
- Enhancing multi-document summarization using concepts
- Edge importance in a network via line graphs and the matrix exponential
- Ranking in evolving complex networks
- A matrix-based measure of inter-node walk relatedness in a network
- Semantic association ranking schemes for information retrieval applications using term association graph representation
- Analysis of directed networks via the matrix exponential
- BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Information ranking and power laws on trees
- Graph similarity scoring and matching
- Edge modification criteria for enhancing the communicability of digraphs
- Large-scale structure of time evolving citation networks
- Data mining of social networks represented as graphs
- Reliable social sensing with physical constraints: analytic bounds and performance evaluation
- Perron vector optimization applied to search engines
This page was built for publication: Authoritative sources in a hyperlinked environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158552)