Web page scoring systems for horizontal and vertical search
Proceedings of the 11th international conference on World Wide Web
Diffusion Kernels on Graphs and Other Discrete Input Spaces
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Learning to Create Customized Authority Lists
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Focused Crawling Using Context Graphs
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
WWW '03 Proceedings of the 12th international conference on World Wide Web
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
A learning algorithm for web page scoring systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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
Extending query translation to cross-language query expansion with markov chain models
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
RSS: A framework enabling ranked search on the semantic web
Information Processing and Management: an International Journal
Learning to rank typed graph walks: local and global approaches
Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Practical and effective IR-style keyword search over semantic web
Information Processing and Management: an International Journal
Learning graph walk based similarity measures for parsed text
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
A graphical framework for contextual search and name disambiguation in email
TextGraphs-1 Proceedings of the First Workshop on Graph Based Methods for Natural Language Processing
Fast query execution for retrieval models based on path-constrained random walks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
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
Learning parameters in entity relationship graphs from ranking preferences
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
| Hi-index | 0.00 |
In this paper we present a novel algorithm to learn a score distribution over the nodes of a labeled graph (directed or undirected). Markov Chain theory is used to define the model of a random walker that converges to a score distribution which depends both on the graph connectivity and on the node labels. A supervised learning task is defined on the given graph by assigning a target score for some nodes and a training algorithm based on error backpropagation through the graph is devised to learn the model parameters. The trained model can assign scores to the graph nodes generalizing the criteria provided by the supervisor in the examples. The proposed algorithm has been applied to learn a ranking function for Web pages. The experimental results show the effectiveness of the proposed technique in reorganizing the rank accordingly to the examples provided in the training set.