{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T15:04:51Z","timestamp":1747062291296,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030757618"},{"type":"electronic","value":"9783030757625"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75762-5_36","type":"book-chapter","created":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T09:07:43Z","timestamp":1620464863000},"page":"447-458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Graph Neural Networks for Soft Semi-Supervised Learning on Hypergraphs"],"prefix":"10.1007","author":[{"given":"Naganand","family":"Yadati","sequence":"first","affiliation":[]},{"given":"Tingran","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Shahab","family":"Asoodeh","sequence":"additional","affiliation":[]},{"given":"Partha","family":"Talukdar","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Louis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,9]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"107637","DOI":"10.1016\/j.patcog.2020.107637","volume":"110","author":"S Bai","year":"2021","unstructured":"Bai, S., Zhang, F., Torr, P.H.S.: Hypergraph convolution and hypergraph attention. Pattern Recogn. 110, 107637 (2021)","journal-title":"Pattern Recogn."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Chan, T.H., Liang, Z.: Generalizing the hypergraph laplacian via a diffusion process with mediators. In: COCOON (2018)","DOI":"10.1007\/978-3-319-94776-1_37"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-319-46466-4_27","volume-title":"Computer Vision \u2013 ECCV 2016","author":"Y Chen","year":"2016","unstructured":"Chen, Y., Ye, J., Li, J.: A distance for HMMs based on aggregated wasserstein metric and state registration. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9910, pp. 451\u2013466. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46466-4_27"},{"key":"36_CR4","unstructured":"Corduneanu, A., Jaakkola, T.S.: Distributed information regularization on graphs. In: NIPS, pp. 297\u2013304. MIT Press (2005)"},{"key":"36_CR5","unstructured":"Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: NIPS. Curran Associates, Inc. (2013)"},{"key":"36_CR6","unstructured":"Dong, Y., Sawin, W., Bengio, Y.: HNHN: hypergraph networks with hyperedge neurons. arXiv preprint arXiv:2006.12278 (2020)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Feng, Y., You, H., Zhang, Z., Ji, R., Gao, Y.: Hypergraph neural networks. In: AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"36_CR8","unstructured":"Frogner, C., Mirzazadeh, F., Solomon, J.: Learning entropic wasserstein embeddings. In: ICLR (2019)"},{"issue":"2\u20133","key":"36_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G Gallo","year":"1993","unstructured":"Gallo, G., Longo, G., Pallottino, S., Nguyen, S.: Directed hypergraphs and applications. Discrete Appl. Math. 42(2\u20133), 177\u2013201 (1993)","journal-title":"Discrete Appl. Math."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Gao, T., Asoodeh, S., Huang, Y., Evans, J.: Wasserstein soft label propagation on hypergraphs: algorithm and generalization error bounds. In: AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33013630"},{"key":"36_CR11","unstructured":"Gilmer, J., Schoenholz, S.S., Riley, P.F., Vinyals, O., Dahl, G.E.: Neural message passing for quantum chemistry. In: ICML (2017)"},{"key":"36_CR12","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NIPS. Curran Associates, Inc. (2017)"},{"issue":"3","key":"36_CR13","first-page":"1","volume":"14","author":"WL Hamilton","year":"2020","unstructured":"Hamilton, W.L.: Graph representation learning. Synth. Lect. Artif. Intell. Mach. Learn. 14(3), 1\u2013159 (2020)","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Han, J., Cheng, B., Wang, X.: Two-phase hypergraph based reasoning with dynamic relations for multi-hop KBQA. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI), pp. 3615\u20133621 (2020)","DOI":"10.24963\/ijcai.2020\/500"},{"key":"36_CR15","unstructured":"Hein, M., Setzer, S., Jost, L., Rangapuram, S.S.: The total variation on hypergraphs - learning on hypergraphs revisited. In: NIPS. Curran Associates, Inc. (2013)"},{"key":"36_CR16","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR (2017)"},{"key":"36_CR17","unstructured":"Liao, R., Zhao, Z., Urtasun, R., Zemel, R.S.: Lanczosnet: multi-scale deep graph convolutional networks. In: ICLR (2019)"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Ma, Y., Tang, J.: Deep learning on graphs. Cambridge University Press (2020)","DOI":"10.1017\/9781108924184"},{"key":"36_CR19","unstructured":"Muzellec, B., Cuturi, M.: Generalizing point embeddings using the wasserstein space of elliptical distributions. In: NeurIPS. Curran Associates, Inc. (2018)"},{"key":"36_CR20","unstructured":"Solomon, J., Rustamov, R., Guibas, L., Butscher, A.: Wasserstein propagation for semi-supervised learning. In: ICML (2014)"},{"key":"36_CR21","first-page":"3311","volume":"12","author":"A Subramanya","year":"2011","unstructured":"Subramanya, A., Bilmes, J.: Semi-supervised learning with measure propagation. J. Mach. Learn. Res. 12, 3311\u20133370 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"36_CR22","first-page":"1","volume":"8","author":"A Subramanya","year":"2014","unstructured":"Subramanya, A., Talukdar, P.P.: Graph-based semi-supervised learning. Synth. Lect. Artif. Intell. Mach. Learn. 8(4), 1\u2013125 (2014)","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Tsuda, K.: Propagating distributions on a hypergraph by dual information regularization. In: ICML (2005)","DOI":"10.1145\/1102351.1102467"},{"key":"36_CR24","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. In: ICLR (2018)"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Verma, S., Zhang, Z.L.: Stability and generalization of graph convolutional neural networks. In: KDD (2019)","DOI":"10.1145\/3292500.3330956"},{"key":"36_CR26","doi-asserted-by":"crossref","unstructured":"Villani, C.: Topics in Optimal Transportation Theory (2003)","DOI":"10.1090\/gsm\/058"},{"key":"36_CR27","unstructured":"Villani, C.: Optimal Transport - Old and New. vol. 338. Springer-Verlag (2008)"},{"key":"36_CR28","unstructured":"Wu, F., Souza, A., Zhang, T., Fifty, C., Yu, T., Weinberger, K.: Simplifying graph convolutional networks. In: ICML (2019)"},{"key":"36_CR29","unstructured":"Yadati, N., Nimishakavi, M., Yadav, P., Nitin, V., Louis, A., Talukdar, P.: HyperGCN: a new method of training graph convolutional networks on hypergraphs. In: NeurIPS. Curran Associates, Inc. (2019)"},{"key":"36_CR30","unstructured":"Zhang, C., Hu, S., Tang, Z.G., Chan, T.H.H.: Re-revisiting learning on hypergraphs: confidence interval and subgradient method. In: ICML (2017)"},{"key":"36_CR31","unstructured":"Zhang, R., Zou, Y., Ma, J.: Hyper-sagnn: a self-attention based graph neural network for hypergraphs. In: International Conference on Learning Representations (ICLR) (2020)"},{"key":"36_CR32","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. In: Sch\u00f6lkopf, B., Platt, J.C., Hoffman, T. (eds.) NIPS. MIT Press (2007)","DOI":"10.7551\/mitpress\/7503.003.0205"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75762-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:18:59Z","timestamp":1710350339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75762-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757618","9783030757625"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75762-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"673","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}