{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:54:11Z","timestamp":1725990851452},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"5","funder":[{"name":"Ministry of Electronics and Information Technology Government of India","award":["MEITY-PHD-2517"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2022,10,31]]},"abstract":"Name ambiguity is a prevalent problem in scholarly publications due to the unprecedented growth of digital libraries and number of researchers. An author is identified by their name in the absence of a unique identifier. The documents of an author are mistakenly assigned due to underlying ambiguity, which may lead to an improper assessment of the author. Various efforts have been made in the literature to solve the name disambiguation problem with supervised and unsupervised approaches. The unsupervised approaches for author name disambiguation are preferred due to the availability of a large amount of unlabeled data. Bibliographic data contain heterogeneous features, thus recently, representation learning-based techniques have been used in literature to embed heterogeneous features in common space. Documents of a scholar are connected by multiple relations. Recently, research has shifted from a single homogeneous relation to multi-dimensional (heterogeneous) relations for the latent representation of document. Connections in graphs are sparse, and higher order links between documents give an additional clue. Therefore, we have used multiple neighborhoods in different relation types in heterogeneous graph for representation of documents. However, different order neighborhood in each relation type has different importance which we have empirically validated also. Therefore, to properly utilize the different neighborhoods in relation type and importance of each relation type in the heterogeneous graph, we propose attention-based multi-dimensional multi-hop neighborhood-based graph convolution network for embedding that uses the two levels of an attention, namely, (i) relation level and (ii) neighborhood level, in each relation. A significant improvement over existing state-of-the-art methods in terms of various evaluation matrices has been obtained by the proposed approach.<\/jats:p>","DOI":"10.1145\/3502730","type":"journal-article","created":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T14:03:20Z","timestamp":1646921000000},"page":"1-23","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Exploiting Higher Order Multi-dimensional Relationships with Self-attention for Author Name Disambiguation"],"prefix":"10.1145","volume":"16","author":[{"given":"Km","family":"Pooja","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Patna, Patna, India"}]},{"given":"Samrat","family":"Mondal","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Patna, Patna, India"}]},{"given":"Joydeep","family":"Chandra","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Patna, Patna, India"}]}],"member":"320","published-online":{"date-parts":[[2022,3,9]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-014-1381-9"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060813"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/WACV48630.2021.00278"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484157"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.5555\/1855210.1855218"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2972372"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098036"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2019.00150"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1891879.1891883"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.22992"},{"key":"e_1_3_2_13_2","first-page":"98","article-title":"A semi-supervised algorithm to manage communities of interests","author":"Francq Pascal","year":"2010","unstructured":"Pascal Francq. 2010. A semi-supervised algorithm to manage communities of interests. Collaborative Search and Communities of Interest: Trends in Knowledge Sharing and Assessment: Trends in Knowledge Sharing and Assessment 35, 4 (2010), 98.","journal-title":"Collaborative Search and Communities of Interest: Trends in Knowledge Sharing and Assessment: Trends in Knowledge Sharing and Assessment"},{"key":"e_1_3_2_14_2","unstructured":"C. Lee Giles Hongyuan Zha and Hui Han. 2005. Name disambiguation in author citations using a k-way spectral clustering method. In Proceedings of the 5th ACM\/IEEE-CS Joint Conference on Digital libraries . IEEE 334\u2013343."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.5555\/645804.669820"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0226-4"},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Hui Han Lee Giles Hongyuan Zha Cheng Li and Kostas Tsioutsiouliklis. 2004. Two supervised learning approaches for name disambiguation in author citations. In Proceedings of the 2004 Joint ACM\/IEEE Conference on Digital Libraries . IEEE 296\u2013305.","DOI":"10.1145\/996350.996419"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/2756406.2756915"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-019-03143-7"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358153"},{"key":"e_1_3_2_21_2","unstructured":"Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. In 5th International Conference on Learning Representations ICLR 2017 Toulon France April 24-26 2017 ."},{"key":"e_1_3_2_22_2","volume-title":"Self-organizing-maps with BIC for speaker clustering","author":"Lapidot Itshak","year":"2002","unstructured":"Itshak Lapidot. 2002. Self-organizing-maps with BIC for speaker clustering. Technical Report. IDIAP."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3444685.3446255"},{"key":"e_1_3_2_24_2","first-page":"569","article-title":"Author name disambiguation using a new categorical distribution similarity","author":"Li Shaohua","year":"2012","unstructured":"Shaohua Li, Gao Cong, and Chunyan Miao. 2012. Author name disambiguation using a new categorical distribution similarity. In Proceedings of the 2012th European Conference on Machine Learning and Knowledge Discovery in Databases (2012), 569\u2013584.","journal-title":"Proceedings of the 2012th European Conference on Machine Learning and Knowledge Discovery in Databases"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.23183"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45880-9_21"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30952-7_15"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67008-9_24"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.02.121"},{"key":"e_1_3_2_30_2","article-title":"A graph combination with edge pruning-based approach for author name disambiguation","author":"Pooja KM","year":"2019","unstructured":"KM Pooja, Samrat Mondal, and Joydeep Chandra. 2019. A graph combination with edge pruning-based approach for author name disambiguation. Journal of the Association for Information Science and Technology 75, 1 (2019), 69\u201383.","journal-title":"Journal of the Association for Information Science and Technology"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9005458"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00799-015-0158-y"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742839"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.13"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05476-6_13"},{"key":"e_1_3_2_38_2","article-title":"Information retrieval. dept. of computer science, university of glasgow","volume":"14","author":"Rijsbergen C. J. Van","year":"1979","unstructured":"C. J. Van Rijsbergen. 1979. Information retrieval. dept. of computer science, university of glasgow. Retrieved from https:\/\/Citeseer.ist.psu.edu\/vanrijsbergen79information.html 14.","journal-title":"https:\/\/Citeseer.ist.psu.edu\/vanrijsbergen79information.html"},{"key":"e_1_3_2_39_2","first-page":"5998","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Proceedings of the Advances in Neural Information Processing Systems. 5998\u20136008."},{"key":"e_1_3_2_40_2","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2017. Graph attention networks. In International Conference on Learning Representations ."},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-012-0681-1"},{"key":"e_1_3_2_42_2","doi-asserted-by":"crossref","unstructured":"Xuezhi Wang Jie Tang Hong Cheng and S. Yu Philip. 2011. Adana: Active name disambiguation. In Proceedings of the 2011 IEEE 11th International Conference on Data Mining . IEEE 794\u2013803.","DOI":"10.1109\/ICDM.2011.19"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-014-1283-x"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-tutorials.3"},{"key":"e_1_3_2_45_2","article-title":"Graph neural networks for natural language processing: A survey","author":"Wu Lingfei","year":"2021","unstructured":"Lingfei Wu, Yu Chen, Kai Shen, Xiaojie Guo, Hanning Gao, Shucheng Li, Jian Pei, and Bo Long. 2021. Graph neural networks for natural language processing: A survey. arXiv:2106.06090. Retrieved from https:\/\/arxiv.org\/abs\/2106.06090.","journal-title":"arXiv:2106.06090. Retrieved from https:\/\/arxiv.org\/abs\/2106.06090."},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3269272"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34223-4_34"},{"key":"e_1_3_2_48_2","first-page":"538","volume-title":"Proceedings of the International Conference on Web Information Systems Engineering","author":"Yan Hao","year":"2020","unstructured":"Hao Yan, Hao Peng, Chen Li, Jianxin Li, and Lihong Wang. 2020. Bibliographic name disambiguation with graph convolutional network. In Proceedings of the International Conference on Web Information Systems Engineering. Springer, 538\u2013551."},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132873"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/CSCWD.2019.8791898"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219859"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3502730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T18:40:54Z","timestamp":1672598454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3502730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,9]]},"references-count":50,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10,31]]}},"alternative-id":["10.1145\/3502730"],"URL":"https:\/\/doi.org\/10.1145\/3502730","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,9]]},"assertion":[{"value":"2020-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}