{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:57:36Z","timestamp":1743119856193,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031434174"},{"type":"electronic","value":"9783031434181"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43418-1_2","type":"book-chapter","created":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T09:02:26Z","timestamp":1694854946000},"page":"19-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Representations for\u00a0Bipartite Graphs Using Multi-task Self-supervised Learning"],"prefix":"10.1007","author":[{"given":"Akshay","family":"Sethi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonia","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aakarsh","family":"Malhotra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siddhartha","family":"Asthana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,17]]},"reference":[{"key":"2_CR1","unstructured":"Berg, R.V.D., Kipf, T.N., Welling, M.: Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 (2017)"},{"key":"2_CR2","unstructured":"Bommasani, R., et al.: On the opportunities and risks of foundation models. arXiv preprint arXiv:2108.07258 (2021)"},{"issue":"9","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai, H., Zheng, V.W., Chang, K.C.C.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616\u20131637 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Cao, J., Lin, X., Guo, S., Liu, L., Liu, T., Wang, B.: Bipartite graph embedding via mutual information maximization. In: ACM International Conference on Web Search and Data Mining, pp. 635\u2013643 (2021)","DOI":"10.1145\/3437963.3441783"},{"key":"2_CR5","unstructured":"Chen, Z., Badrinarayanan, V., Lee, C.Y., Rabinovich, A.: Gradnorm: gradient normalization for adaptive loss balancing in deep multitask networks. In: International Conference on Machine Learning, pp. 794\u2013803 (2018)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Doersch, C., Zisserman, A.: Multi-task self-supervised visual learning. In: IEEE International Conference on Computer Vision, pp. 2051\u20132060 (2017)","DOI":"10.1109\/ICCV.2017.226"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Dong, Y., Chawla, N.V., Swami, A.: metapath2vec: scalable representation learning for heterogeneous networks. In: ACM International Conference on Knowledge Discovery and Data Mining, pp. 135\u2013144 (2017)","DOI":"10.1145\/3097983.3098036"},{"key":"2_CR8","first-page":"27503","volume":"34","author":"C Fifty","year":"2021","unstructured":"Fifty, C., Amid, E., Zhao, Z., Yu, T., Anil, R., Finn, C.: Efficiently identifying task groupings for multi-task learning. Adv. Neural. Inf. Process. Syst. 34, 27503\u201327516 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Gao, M., Chen, L., He, X., Zhou, A.: Bine: bipartite network embedding. In: ACM Conference on Research & Development in Information Retrieval, pp. 715\u2013724 (2018)","DOI":"10.1145\/3209978.3209987"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: ACM International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Guo, M., Haque, A., Huang, D.A., Yeung, S., Fei-Fei, L.: Dynamic task prioritization for multitask learning. In: European Conference on Computer Vision, pp. 270\u2013287 (2018)","DOI":"10.1007\/978-3-030-01270-0_17"},{"key":"2_CR12","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"2_CR13","unstructured":"Hamilton, W.L., Ying, R., Leskovec, J.: Representation learning on graphs: methods and applications. arXiv preprint arXiv:1709.05584 (2017)"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2827872","volume":"5","author":"FM Harper","year":"2015","unstructured":"Harper, F.M., Konstan, J.A.: The movielens datasets: history and context. ACM Trans. Interact. Intell. Syst. 5(4), 1\u201319 (2015)","journal-title":"ACM Trans. Interact. Intell. Syst."},{"key":"2_CR15","unstructured":"He, C., et al.: Cascade-BGNN: toward efficient self-supervised representation learning on large-scale bipartite graphs. arXiv preprint arXiv:1906.11994 (2019)"},{"key":"2_CR16","unstructured":"Hjelm, R.D., et al.: Learning deep representations by mutual information estimation and maximization. arXiv preprint arXiv:1808.06670 (2018)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Hou, Z., Liu, X., Dong, Y., Wang, C., Tang, J., et al.: Graphmae: self-supervised masked graph autoencoders. arXiv preprint arXiv:2205.10803 (2022)","DOI":"10.1145\/3534678.3539321"},{"key":"2_CR18","unstructured":"Hu, W., et al.: Strategies for pre-training graph neural networks. arXiv preprint arXiv:1905.12265 (2019)"},{"key":"2_CR19","unstructured":"Jean, S., Firat, O., Johnson, M.: Adaptive scheduling for multi-task learning. arXiv preprint arXiv:1909.06434 (2019)"},{"key":"2_CR20","unstructured":"Jin, W., Liu, X., Zhao, X., Ma, Y., Shah, N., Tang, J.: Automated self-supervised learning for graphs. arXiv preprint arXiv:2106.05470 (2021)"},{"key":"2_CR21","unstructured":"Jing, B., Yan, Y., Zhu, Y., Tong, H.: Coin: co-cluster infomax for bipartite graphs. arXiv preprint arXiv:2206.00006 (2022)"},{"key":"2_CR22","unstructured":"Ju, M., et al.: Multi-task self-supervised graph neural networks enable stronger task generalization. arXiv preprint arXiv:2210.02016 (2022)"},{"key":"2_CR23","unstructured":"Liebel, L., K\u00f6rner, M.: Auxiliary tasks in multi-task learning. arXiv preprint arXiv:1805.06334 (2018)"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Liu, S., Liang, Y., Gitter, A.: Loss-balanced task weighting to reduce negative transfer in multi-task learning. In: AAAI Conference on Artificial Intelligence, vol. 33, no. 01, pp. 9977\u20139978 (2019)","DOI":"10.1609\/aaai.v33i01.33019977"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Lu, Y., Kumar, A., Zhai, S., Cheng, Y., Javidi, T., Feris, R.: Fully-adaptive feature sharing in multi-task networks with applications in person attribute classification. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 5334\u20135343 (2017)","DOI":"10.1109\/CVPR.2017.126"},{"key":"2_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108243","volume":"122","author":"A Malhotra","year":"2022","unstructured":"Malhotra, A., et al.: Multi-task driven explainable diagnosis of COVID-19 using chest X-ray images. Pattern Recogn. 122, 108243 (2022)","journal-title":"Pattern Recogn."},{"key":"2_CR27","unstructured":"Malhotra, A., Vatsa, M., Singh, R.: Dropped scheduled task: mitigating negative transfer in multi-task learning using dynamic task dropping. Trans. Mach. Learn. Res. (2022)"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Mavromatis, C., Karypis, G.: Graph infoclust: maximizing coarse-grain mutual information in graphs. In: Advances in Knowledge Discovery and Data Mining, pp. 541\u2013553 (2021)","DOI":"10.1007\/978-3-030-75762-5_43"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Ni, M., et al.: M3P: learning universal representations via multitask multilingual multimodal pre-training. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 3977\u20133986 (2021)","DOI":"10.1109\/CVPR46437.2021.00397"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Park, C., Kim, D., Han, J., Yu, H.: Unsupervised attributed multiplex network embedding. In: AAAI Conference on Artificial Intelligence, vol. 34, no. 04, pp. 5371\u20135378 (2020)","DOI":"10.1609\/aaai.v34i04.5985"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Peng, Z., et al.: Graph representation learning via graphical mutual information maximization. In: The Web Conference, pp. 259\u2013270 (2020)","DOI":"10.1145\/3366423.3380112"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: ACM International Conference on Knowledge Discovery and Data Mining, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"issue":"8","key":"2_CR33","first-page":"9","volume":"1","author":"A Radford","year":"2019","unstructured":"Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I., et al.: Language models are unsupervised multitask learners. OpenAI Blog 1(8), 9 (2019)","journal-title":"OpenAI Blog"},{"key":"2_CR34","unstructured":"Sanh, V., et al.: Multitask prompted training enables zero-shot task generalization. arXiv preprint arXiv:2110.08207 (2021)"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Stratigi, M., Li, X., Stefanidis, K., Zhang, Z.: Ratings vs. reviews in recommender systems: a case study on the amazon movies dataset. In: New Trends in Databases and Information Systems, pp. 68\u201376 (2019)","DOI":"10.1007\/978-3-030-30278-8_9"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Sun, J., Cheng, Z., Zuberi, S., P\u00e9rez, F., Volkovs, M.: HGCF: hyperbolic graph convolution networks for collaborative filtering. In: The Web Conference, pp. 593\u2013601 (2021)","DOI":"10.1145\/3442381.3450101"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: International Conference on World Wide Web, pp. 1067\u20131077 (2015)","DOI":"10.1145\/2736277.2741093"},{"key":"2_CR38","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"2_CR39","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"issue":"1","key":"2_CR40","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1162\/dint_a_00006","volume":"1","author":"H Wan","year":"2019","unstructured":"Wan, H., Zhang, Y., Zhang, J., Tang, J.: Aminer: search and mining of academic social networks. Data Intell. 1(1), 58\u201376 (2019)","journal-title":"Data Intell."},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Wang, X., He, X., Wang, M., Feng, F., Chua, T.S.: Neural graph collaborative filtering. In: ACM International Conference on Research and Development in Information Retrieval, pp. 165\u2013174 (2019)","DOI":"10.1145\/3331184.3331267"},{"issue":"12","key":"2_CR42","doi-asserted-by":"publisher","first-page":"i246","DOI":"10.1093\/bioinformatics\/btq176","volume":"26","author":"Y Yamanishi","year":"2010","unstructured":"Yamanishi, Y., Kotera, M., Kanehisa, M., Goto, S.: Drug-target interaction prediction from chemical, genomic and pharmacological data in an integrated framework. Bioinformatics 26(12), i246\u2013i254 (2010)","journal-title":"Bioinformatics"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Ying, R., He, R., Chen, K., Eksombatchai, P., Hamilton, W.L., Leskovec, J.: Graph convolutional neural networks for web-scale recommender systems. In: ACM International Conference on Knowledge Discovery & Data Mining, pp. 974\u2013983 (2018)","DOI":"10.1145\/3219819.3219890"},{"key":"2_CR44","first-page":"5812","volume":"33","author":"Y You","year":"2020","unstructured":"You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., Shen, Y.: Graph contrastive learning with augmentations. Adv. Neural. Inf. Process. Syst. 33, 5812\u20135823 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Zamir, A.R., et al.: Robust learning through cross-task consistency. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 11197\u201311206 (2020)","DOI":"10.1109\/CVPR42600.2020.01121"},{"key":"2_CR46","unstructured":"Zhang, M., Chen, Y.: Inductive matrix completion based on graph neural networks. arXiv preprint arXiv:1904.12058 (2019)"},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Xiong, Y., Kong, X., Zhu, Y.: Learning node embeddings in interaction graphs. In: ACM Conference on Information and Knowledge Management, pp. 397\u2013406 (2017)","DOI":"10.1145\/3132847.3132918"},{"issue":"3","key":"2_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2538028","volume":"8","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Yeung, D.Y.: A regularization approach to learning task relationships in multitask learning. ACM Trans. Knowl. Discov. Data (TKDD) 8(3), 1\u201331 (2014)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"2_CR49","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Wang, D., Zhang, Y.: Neural IR meets graph embedding: a ranking model for product search. In: The World Wide Web Conference, pp. 2390\u20132400 (2019)","DOI":"10.1145\/3308558.3313468"},{"key":"2_CR50","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Cui, P., Wang, X., Pei, J., Yao, X., Zhu, W.: Arbitrary-order proximity preserved network embedding. In: ACM International Conference on Knowledge Discovery & Data Mining, pp. 2778\u20132786 (2018)","DOI":"10.1145\/3219819.3219969"},{"key":"2_CR51","unstructured":"Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., Wang, L.: Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131 (2020)"},{"key":"2_CR52","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., Wang, L.: Graph contrastive learning with adaptive augmentation. In: The Web Conference, pp. 2069\u20132080 (2021)","DOI":"10.1145\/3442381.3449802"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases: Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43418-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T13:03:21Z","timestamp":1719407001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43418-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434174","9783031434181"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43418-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Our proposed algorithm does not raise any ethical concerns, however, it is important to note that ethical applications of graphs can potentially benefit from the improved task generalization and performance provided by our work. To ensure positive and socially beneficial outcomes of machine learning algorithms, it is crucial to exercise caution and responsibility.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Statement"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"829","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":"196","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":"24% - 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.63","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":"4.5","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)"}},{"value":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}