{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:53:59Z","timestamp":1730278439826,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,17]]},"DOI":"10.1109\/itw48936.2021.9611457","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T16:46:27Z","timestamp":1637685987000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs"],"prefix":"10.1109","author":[{"given":"Eli","family":"Chien","sequence":"first","affiliation":[]},{"given":"Pan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Mémoire sur les équations algébrique où on démontre l’impossiblité de la résolution de l’equation générale du cinquième dégré","year":"1824","author":"abel","key":"ref38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2928301"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2837638"},{"key":"ref31","first-page":"871","article-title":"Community detection in hypergraphs: Optimal statistical limit and efficient algorithms","author":"chien","year":"2018","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1453"},{"key":"ref37","article-title":"Stochastic block model for hypergraphs: Statistical limits and a semidefinite programming approach","author":"kim","year":"2018","journal-title":"arXiv preprint arXiv 1807 02884"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7446987"},{"key":"ref35","article-title":"Higher-order spectral clustering under superimposed stochastic block model","author":"paul","year":"2018","journal-title":"arXiv preprint arXiv 1812 08942"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501657"},{"key":"ref10","article-title":"Adaptive universal generalized pagerank graph neural network","author":"chien","year":"2021","journal-title":"International Conference on Learning Representations"},{"key":"ref11","article-title":"Netgan: Generating graphs via random walks","author":"bojchevski","year":"2018","journal-title":"arXiv preprint arXiv 1803 00816"},{"key":"ref12","article-title":"Multi-motifgan (mmgan): Motif-targeted graph generation and prediction","author":"gamage","year":"2019","journal-title":"arXiv preprint arXiv 1911 12945"},{"key":"ref13","first-page":"1751","article-title":"Hitting and commute times in large random neighborhood graphs","volume":"15","author":"von luxburg","year":"2014","journal-title":"The Journal of Machine Learning Research"},{"journal-title":"Reversible Markov Chains and Random Walks on Graphs","year":"1995","author":"aldous","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611275114"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0708838104"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.89"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1126\/science.aad9029"},{"key":"ref28","first-page":"2466","article-title":"HS2: Active learning over hypergraphs with pointwise and pairwise queries","author":"chien","year":"2019","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"ref27","first-page":"1062","article-title":"Quadratic decomposable submodular function minimization","author":"li","year":"2018","journal-title":"Advances in neural information processing systems"},{"journal-title":"Learning From Labeled and Unlabeled Data With Label Propagation","year":"2002","author":"zhu","key":"ref3"},{"key":"ref6","article-title":"Optimizing generalized pagerank methods for seed-expansion community detection","author":"li","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref29","first-page":"2559","article-title":"General tensor spectral coclustering for higher-order data","author":"wu","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339628"},{"key":"ref8","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","author":"klicpera","year":"2019","journal-title":"International Conference on Learning Representations"},{"key":"ref7","article-title":"Is pagerank all you need for scalable graph neural networks?","author":"bojchevski","year":"2019","journal-title":"KDD MLG Workshop"},{"journal-title":"The PageRank Citation Ranking Bringing Order to the Web","year":"1999","author":"page","key":"ref2"},{"key":"ref9","first-page":"13 333","article-title":"Diffusion improves graph learning","author":"klicpera","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref1","first-page":"1","article-title":"Random walks on graphs: A survey","volume":"2","author":"lov\u00e1sz","year":"1993","journal-title":"Combinatorics Paul Erdös is Eighty"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056956"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00081"},{"key":"ref21","first-page":"2308","article-title":"Inhomogeneous hypergraph clustering with applications","author":"li","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref24","first-page":"1172","article-title":"Random walks on hypergraphs with edge-dependent vertex weights","author":"chitra","year":"2019","journal-title":"International Conference on Machine Learning"},{"key":"ref23","first-page":"1601","article-title":"Learning with hypergraphs: Clustering, classification, and embedding","author":"zhou","year":"2007","journal-title":"Advances in neural information processing systems"},{"key":"ref26","first-page":"2427","article-title":"The total variation on hypergraphs-learning on hypergraphs revisited","author":"hein","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"}],"event":{"name":"2021 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,10,17]]},"location":"Kanazawa, Japan","end":{"date-parts":[[2021,10,21]]}},"container-title":["2021 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9611366\/9611357\/09611457.pdf?arnumber=9611457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T12:52:05Z","timestamp":1652187125000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9611457\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/itw48936.2021.9611457","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}