Searching for information in a hypertext medical handbook
Communications of the ACM
Structural analysis of hypertexts: identifying hierarchies and useful metrics
ACM Transactions on Information Systems (TOIS)
HyPursuit: a hierarchical network search engine that exploits content-link hypertext clustering
Proceedings of the the seventh ACM conference on Hypertext
Silk from a sow's ear: extracting usable structures from the Web
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Latent semantic indexing: a probabilistic analysis
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Inferring Web communities from link topology
Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
The quest for correct information on the Web: hyper search engines
Selected papers from the sixth international conference on World Wide Web
WebQuery: searching and visualizing the Web through connectivity
Selected papers from the sixth international conference on World Wide Web
Improved algorithms for topic distillation in a hyperlinked environment
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Automatic resource compilation by analyzing hyperlink structure and associated text
WWW7 Proceedings of the seventh international conference on World Wide Web 7
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An Analysis of Some Graph Theoretical Cluster Techniques
Journal of the ACM (JACM)
Information Retrieval
Mining the Web's Link Structure
Computer
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Web page scoring systems for horizontal and vertical search
Proceedings of the 11th international conference on World Wide Web
Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
Reasoning for web document associations and its applications in site map construction
Data & Knowledge Engineering
Local versus global link information in the Web
ACM Transactions on Information Systems (TOIS)
A Theoretical Analysis of Google's PageRank
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Links Between Kleinberg's Hubs and Authorities, Correspondence Analysis, and Markov Chains
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
A Unified Probabilistic Framework for Web Page Scoring Systems
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 13th international conference on World Wide Web
Link fusion: a unified link analysis framework for multi-type interrelated data objects
Proceedings of the 13th international conference on World Wide Web
A Theoretical Study of a Generalized Version of Kleinberg's HITS Algorithm
Information Retrieval
PageRank as a function of the damping factor
WWW '05 Proceedings of the 14th international conference on World Wide Web
What do we know about links and linking? A framework for studying links in academic environments
Information Processing and Management: an International Journal
Higher-Order Web Link Analysis Using Multilinear Algebra
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
A Random Walk through Human Associations
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Core algorithms in the CLEVER system
ACM Transactions on Internet Technology (TOIT)
Generalized comparison of graph-based ranking algorithms for publications and authors
Journal of Systems and Software
Comparing the effectiveness of hits and salsa
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Symbolic links in the Open Directory Project
Information Processing and Management: an International Journal
Ranking with tagging as quality indicators
Proceedings of the 2008 ACM symposium on Applied computing
Efficient and effective link analysis with precomputed salsa maps
Proceedings of the 17th ACM conference on Information and knowledge management
Modeling multi-step relevance propagation for expert finding
Proceedings of the 17th ACM conference on Information and knowledge management
Less is more: sampling the neighborhood graph makes SALSA better and faster
Proceedings of the Second ACM International Conference on Web Search and Data Mining
On the properties of von Neumann kernels for link analysis
Machine Learning
Distributed discovery of large near-cliques
Proceedings of the 28th ACM symposium on Principles of distributed computing
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
TripleRank: Ranking Semantic Web Data by Tensor Decomposition
ISWC '09 Proceedings of the 8th International Semantic Web Conference
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Topic-Based Computing Model for Web Page Popularity and Website Influence
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Eigenvectors of directed graphs and importance scores: dominance, T-Rank, and sink remedies
Data Mining and Knowledge Discovery
Early online identification of attention gathering items in social media
Proceedings of the third ACM international conference on Web search and data mining
Modeling the web as a hypergraph to compute page reputation
Information Systems
Stochastic models for tabbed browsing
Proceedings of the 19th international conference on World wide web
Using bloom filters to speed up HITS-like ranking algorithms
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Co-citations as citation endorsements and co-links as link endorsements
Journal of Information Science
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Dependable filtering: Philosophy and realizations
ACM Transactions on Information Systems (TOIS)
Structure vs. content in hierarchical corpora
Information Retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Fast incremental and personalized PageRank
Proceedings of the VLDB Endowment
Providing built-in keyword search capabilities in RDBMS
The VLDB Journal — The International Journal on Very Large Data Bases
Topic Distillation with Query-Dependent Link Connections and Page Characteristics
ACM Transactions on the Web (TWEB)
Generating summaries for ontology search
Proceedings of the 20th international conference companion on World wide web
Network performance engineering
Are semantically related links more effective for retrieval?
ECIR'11 Proceedings of the 33rd European conference on Advances in information retrieval
Exploiting link analysis with a three-layer web structure model
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Incremental aspect models for mining document streams
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Graph-based term weighting for information retrieval
Information Retrieval
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
ACM Transactions on Information Systems (TOIS)
Are web users really Markovian?
Proceedings of the 21st international conference on World Wide Web
Survey on web spam detection: principles and algorithms
ACM SIGKDD Explorations Newsletter
Optimised K-means for web search
International Journal of Advanced Intelligence Paradigms
Discovering and ranking new links for linked data supplier
JIST'11 Proceedings of the 2011 joint international conference on The Semantic Web
Towards an effective and unbiased ranking of scientific literature through mutual reinforcement
Proceedings of the 21st ACM international conference on Information and knowledge management
Interest-matching information propagation in multiple online social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Semantic similarity-based PageRank using wordnet
International Journal of Computer Applications in Technology
Mutual evaluation of editors and texts for assessing quality of Wikipedia articles
Proceedings of the Eighth Annual International Symposium on Wikis and Open Collaboration
WTF: the who to follow service at Twitter
Proceedings of the 22nd international conference on World Wide Web
About learning models with multiple query-dependent features
ACM Transactions on Information Systems (TOIS)
DrunkardMob: billions of random walks on just a PC
Proceedings of the 7th ACM conference on Recommender systems
Are Some Tweets More Interesting Than Others? #HardQuestion
Proceedings of the Symposium on Human-Computer Interaction and Information Retrieval
Power walk: revisiting the random surfer
Proceedings of the 18th Australasian Document Computing Symposium
iHypR: Prominence ranking in networks of collaborations with hyperedges1
ACM Transactions on Knowledge Discovery from Data (TKDD)
Hi-index | 0.00 |
Today, when searching for information on the WWW, one usually performs a query through a term-based search engine. These engines return, as the query's result, a list of Web pages whose contents matches the query. For broad-topic queries, such searches often result in a huge set of retrieved documents, many of which are irrelevant to the user. However, much information is contained in the link-structure of the WWW. Information such as which pages are linked to others can be used to augment search algorithms. In this context, Jon Kleinberg introduced the notion of two distinct types of Web pages: hubs and authorities. Kleinberg argued that hubs and authorities exhibit a mutually reinforcing relationship: a good hub will point to many authorities, and a good authority will be pointed at by many hubs. In light of this, he dervised an algoirthm aimed at finding authoritative pages. We present SALSA, a new stochastic approach for link-structure analysis, which examines random walks on graphs derived from the link-structure. We show that both SALSA and Kleinberg's Mutual Reinforcement approach employ the same metaalgorithm. We then prove that SALSA is quivalent to a weighted in degree analysis of the link-sturcutre of WWW subgraphs, making it computationally more efficient than the Mutual reinforcement approach. We compare that results of applying SALSA to the results derived through Kleinberg's approach. These comparisions reveal a topological Phenomenon called the TKC effectwhich, in certain cases, prevents the Mutual reinforcement approach from identifying meaningful authorities.