Affiliation:
1. Computer Science Department The George Washington University Washington, DC 20052, USA
Abstract
Random walks on graphs have been extensively used for a variety of graph-based problems such as ranking vertices, predicting links, recommendations, and clustering. However, many complex problems mandate a high-order graph representation to accurately capture the relationship structure inherent in them. Hypergraphs are particularly useful for such models due to the density of information stored in their structure. In this paper, we propose a novel extension to defining random walks on hypergraphs. Our proposed approach combines the weights of destination vertices and hyperedges in a probabilistic manner to accurately capture transition probabilities. We study and analyze our generalized form of random walks suitable for the structure of hypergraphs. We show the effectiveness of our model by conducting a text ranking experiment on a real world data set with a 9% to 33% improvement in precision and a range of 7% to 50% improvement in Bpref over other random walk approaches.
Publisher
North Atlantic University Union (NAUN)
Reference33 articles.
1. S. Agarwal, K. Branson, and S. Belongie, “Higher order learning with graphs,” in Proceedings of the 23rd international conference on Machine learning, ser. ICML ’06. New York, NY, USA: ACM, 2006, pp. 17–24. [Online]. Available: http://doi.acm.org/10.1145/1143844.1143847
2. H. Liu, P. Le Pendu, R. Jin, and D. Dou, “A hypergraph-based method for discovering semantically associated itemsets,” in Proceedings of the 11th IEEE International Conference on Data Mining, ser. ICDM ’11. Washington, DC, USA: IEEE Computer Society, 2011, pp. 398–406. [Online]. Available: http://dx.doi.org/10.1109/ICDM.2011.12
3. C. Avin, Y. Lando, and Z. Lotker, “Radio cover time in hypergraphs,” in Proceedings of the 6th International Workshop on Foundations of Mobile Computing, ser. DIALM-POMC ’10. New York, NY, USA: ACM, 2010, pp. 3–12. [Online]. Available: http://doi.acm.org/10.1145/1860684.1860689
4. D. Zhou, J. Huang, and B. Scholkopf, “Learning with hypergraphs: Clustering, classification, and embedding,” Advances in neural information processing systems, vol. 19, p. 1601, 2007.
5. S. Vempala, “Geometric random walks: a survey,” MSRI volume on Combinatorial and Computational Geometry, 2005.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献