Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Network Capacity Bound for Personalized PageRank in Multimodal Networks (1706.00178v4)

Published 1 Jun 2017 in cs.SI, cs.IR, and physics.soc-ph

Abstract: In a former paper the concept of Bipartite PageRank was introduced and a theorem on the limit of authority flowing between nodes for personalized PageRank has been generalized. In this paper we want to extend those results to multimodal networks. In particular we deal with a hypergraph type that may be used for describing multimodal network where a hyperlink connects nodes from each of the modalities. We introduce a generalisation of PageRank for such graphs and define the respective random walk model that can be used for computations. We state and prove theorems on the limit of outflow of authority for cases where individual modalities have identical and distinct damping factors.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. Network Capacity Bound for Personalized Bipartite PageRank. In: S M, J M (eds.), Challenges in Computational Statistics and Data Mining, volume Studies in Computational Intelligence, vol 605, pp. 189–204. Springer, Cham. ISBN ISBN 10.1007/978-3-319-18781-5, 2016.
  2. The PageRank citation ranking: bringing order to the Web. Technical Report 1999-66, Stanford InfoLab, 1999. URL: http://ilpubs.stanford.edu:8090/422/.
  3. Brezinski C, Redivo-Zaglia M. The PageRank Vector: Properties, Computation, Approximation, and Acceleration. SIAM J. Matrix Anal. Appl., 2006. 28(2):551–575. 10.1137/050626612. URL https://doi.org/10.1137/050626612.
  4. Accelerating PageRank computations. Control & Cybernetics, 201. 40(2):259–274. https://yadda.icm.edu.pl/baztech/element/bwmeta1.element.baztech-article-BATC-0008-0003.
  5. Langville AN, Meyer CD. Google’s PageRank and beyond: the science of search engine rankings. Princeton University Press, 2006.
  6. Berkhin P. A survey on PageRank computing. Internet Mathematics, 2005. 2:73–120.
  7. Link S. Eigenvalue-based bipartite ranking. Bachelorarbeit/bachelor thesis, Institute of Computer Science, Ludwig-Maximilians-University in Munich, 2011. URL: http://www.pms.ifi.lmu.de/publikationen/#PA_Stephan.Link.
  8. A generalized Co-HITS algorithm and its application to bipartite graphs. In: Proc. of the 15th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, KDD’09. ACM New York, NY, USA, Paris, 2009 pp. 239–248. Doi: 10.1145/1557019.1557051.
  9. Bauckhage C. Image tagging using PageRank over bipartite graphs. In: Proc. of the 30th DAGM Symposium on Pattern Recognition. Springer-Verlag, Berlin, Heidelberg, 2008 pp. 426–435. Doi:10.1007/978-3-540-69321-5_43.
  10. Of Categorizers and Describers: An Evaluation of Quantitative Measures for Tagging Motivation. In: Proceedings of the 21st ACM Conference on Hypertext and Hypermedia, HT ’10. ACM, New York, NY, USA. ISBN 978-1-4503-0041-4, 2010 pp. 157–166.
  11. Multimodal hypergraph learning for microblog sentiment prediction. In: 2015 IEEE International Conference on Multimedia and Expo, ICME 2015, Turin, Italy, June 29 - July 3, 2015. IEEE, 2015 pp. 1–6.
  12. Grolmusz V. A Note on the PageRank of Undirected Graphs. CoRR, 2012. abs/1205.1960. 1205.1960, URL http://arxiv.org/abs/1205.1960.
  13. Chung F. A brief survey of PageRank algorithms. IEEE Transactions on Network Science and Engineering, 2014. 1(1):38–42.
  14. Gleich DF. PageRank Beyond the Web. SIAM Review, 2015. 57(3):321–363. 10.1137/140976649.
  15. Hypergraph Clustering Based on PageRank. CoRR, 2020. abs/2006.08302. 2006.08302, URL https://arxiv.org/abs/2006.08302.
  16. Li P, Milenkovic O. Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering. CoRR, 2018. abs/1803.03833. 1803.03833, URL http://arxiv.org/abs/1803.03833.
  17. Mycroft R. Packing k𝑘kitalic_k-partite k𝑘kitalic_k-uniform hypergraphs. Journal of Combinatorial Theory, Series A, 2016. 138:60–132. https://doi.org/10.1016/j.jcta.2015.09.007.
  18. Matchings in k-partite k-uniform hypergraphs. Journal of Graph Theory, 2020. 95(1):34–58.
  19. Schauz U. A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of k-partite k-uniform Hypergraphs. The Electronic Journal of Combinatorics, 2010. 17(R176).
  20. Petrovic D. Introducing: HyperPagerank. http://dejanseo.com.au/introducing-hyperpagerank/.
  21. Modeling the Web As a Hypergraph to Compute Page Reputation. Inf. Syst., 2010. 35(5):530–543. 10.1016/j.is.2009.02.005.
  22. Hypergraph partitioning for faster parallel PageRank computation. In: Lecture Notes in Computer Science 3670. Springer, 2005 pp. 155–171.
  23. Information Retrieval in Folksonomies: Search and Ranking. In: Proceedings of the 3rd European Conference on The Semantic Web: Research and Applications, ESWC’06. Springer-Verlag, Berlin, Heidelberg. ISBN 3-540-34544-2, 978-3-540-34544-2, 2006 pp. 411–426. 10.1007/11762256_31.
  24. FolkRank: A Ranking Algorithm for Folksonomies. In: Proc. FGIR 2006. 2006 URL http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006folkrank.pdf.
  25. Bellaachia A, Al-Dhelaan M. Random Walks in Hypergraph. In: Proceedings of the 2013 International Conference on Applied Mathematics and Computational Methods. 2013 .
  26. The cover times of random walks on random uniform hypergraphs. Theor. Comput. Sci., 2013. 509:51–69.
  27. Neubauer N, Obermayer K. Towards Community Detection in k-Partite k-Uniform Hypergraphs. In: Proceedings of the NIPS 2009 Workshop on Analyzing Networks and Learning with Graphs. 2009 pp. 1–9. http://snap.stanford.edu/nipsgraphs2009/papers/neubauer-paper.pdf.
  28. Unified hypergraph for image ranking in a multimodal context. In: ICASSP. IEEE. ISBN 978-1-4673-0046-9, 2012 pp. 2333–2336.
  29. Music Recommendation by Unified Hypergraph: Combining Social Media Information and Music Content. In: Proceedings of the International Conference on Multimedia, MM ’10. ACM, New York, NY, USA. ISBN 978-1-60558-933-6, 2010 pp. 391–400. 10.1145/1873951.1874005.
  30. Random Walks on Simplicial Complexes and the normalized Hodge Laplacian. CoRR, 2018. abs/1807.05044. 1807.05044, URL http://arxiv.org/abs/1807.05044.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now