On the use of spreading activation methods in automatic information
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
Improved Boosting Algorithms Using Confidence-rated Predictions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Learning to Create Customized Authority Lists
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
An adaptive information retrieval system based on associative networks
APCCM '04 Proceedings of the first Asian-Pacific conference on Conceptual modelling - Volume 31
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Learning random walk models for inducing word dependency distributions
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Object-level ranking: bringing order to Web objects
WWW '05 Proceedings of the 14th international conference on World Wide Web
Ranking algorithms for named-entity extraction: boosting and the voted perceptron
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
SimFusion: measuring similarity using unified relationship matrix
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
SPIN: searching personal information networks
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Query expansion using random walk models
Proceedings of the 14th ACM international conference on Information and knowledge management
Discriminative Reranking for Natural Language Parsing
Computational Linguistics
Contextual search and name disambiguation in email using graphs
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Learning to rank networked entities
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Journal of Artificial Intelligence Research
Learning web page scores by error back-propagation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
WebKDD/SNAKDD 2007: web mining and social network analysis post-workshop report
ACM SIGKDD Explorations Newsletter - Special issue on visual analytics
Learning graph walk based similarity measures for parsed text
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Random walks for text semantic similarity
TextGraphs-4 Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing
ACM Transactions on Information Systems (TOIS)
Supervised random walks: predicting and recommending links in social networks
Proceedings of the fourth ACM international conference on Web search and data mining
Distributional memory: A general framework for corpus-based semantics
Computational Linguistics
Typed graph models for semi-supervised learning of name ethnicity
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Unifying guilt-by-association approaches: theorems and fast algorithms
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Maximum consistency preferential random walks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
| Hi-index | 0.00 |
We consider the setting of lazy random graph walks over directed graphs, where entities are represented as nodes and typed edges represent the relations between them. This framework has been used in a variety of problems to derive an extended measure of entity similarity. In this paper we contrast two different approaches for applying supervised learning in this framework to improve graph walk performance: a gradient descent algorithm that tunes the transition probabilities of the graph, and a reranking approach that uses features describing global properties of the traversed paths. An empirical evaluation on a set of tasks from the domain of personal information management and multiple corpora show that reranking performance is usually superior to the local gradient descent algorithm, and that the methods often yield best results when combined.