Maximum Consistency Preferential Random Walks
Abstract
Random walk plays a significant role in computer science. The popular PageRank algorithm uses random walk. Personalized random walks force random walk to “personalized views” of the graph according to users’ preferences. In this paper, we show the close relations between different preferential random walks and label propagation methods used in semi-supervised learning. We further present a maximum consistency algorithm on these preferential random walk/label propagation methods to ensure maximum consistency from labeled data to unlabeled data. Extensive experimental results on 9 datasets provide performance comparisons of different preferential random walks/label propagation methods. They also indicate that the proposed maximum consistency algorithm clearly improves the classification accuracy over existing methods.
Cite
Text
Kong and Ding. "Maximum Consistency Preferential Random Walks." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2012. doi:10.1007/978-3-642-33486-3_22Markdown
[Kong and Ding. "Maximum Consistency Preferential Random Walks." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2012.](https://mlanthology.org/ecmlpkdd/2012/kong2012ecmlpkdd-maximum/) doi:10.1007/978-3-642-33486-3_22BibTeX
@inproceedings{kong2012ecmlpkdd-maximum,
title = {{Maximum Consistency Preferential Random Walks}},
author = {Kong, Deguang and Ding, Chris H. Q.},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2012},
pages = {339-354},
doi = {10.1007/978-3-642-33486-3_22},
url = {https://mlanthology.org/ecmlpkdd/2012/kong2012ecmlpkdd-maximum/}
}