{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T02:33:58Z","timestamp":1761791638738,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T00:00:00Z","timestamp":1662681600000},"content-version":"vor","delay-in-days":251,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61977025"],"award-info":[{"award-number":["61977025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1016\/j.procs.2022.09.042","type":"journal-article","created":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T23:44:35Z","timestamp":1666136675000},"page":"100-109","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Empower Keywords Generation for Short Texts with Graph-to-Sequence Learning"],"prefix":"10.1016","volume":"207","author":[{"given":"Ying","family":"Yang","sequence":"first","affiliation":[]},{"given":"Yaru","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Dawei","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Guang","family":"Mei","sequence":"additional","affiliation":[]},{"given":"Zhihong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2022.09.042_bib0001","series-title":"Proc. the 24th International Conference on World Wide Web (WWW)","first-page":"13","article-title":"A Comparison of Supervised Keyphrase Extraction Models","author":"Bulgarov","year":"2015"},{"key":"10.1016\/j.procs.2022.09.042_bib0002","series-title":"Proc. the 33rd Annual ACM Symposium on Applied Computing (SAC)","first-page":"728","article-title":"Automatic Keyphrase Extraction Using Graph-based Methods","author":"Mothe","year":"2018"},{"issue":"006","key":"10.1016\/j.procs.2022.09.042_bib0003","first-page":"664","article-title":"Keyword extraction algorithm based on graph and LDA topic model","volume":"35","author":"Liu","year":"2016","journal-title":"Journal of The China Society for Scientific and Technical Information"},{"key":"10.1016\/j.procs.2022.09.042_bib0004","series-title":"Proc. the Sixth International Joint Conference on Natural Language Processing (IJCNLP)","first-page":"834","article-title":"A Comparison of Centrality Measures for Graph-based Keyphrase Extraction","author":"Boudin","year":"2013"},{"key":"10.1016\/j.procs.2022.09.042_bib0005","series-title":"Proc. the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT)","first-page":"667","article-title":"Unsupervised Keyphrase Extraction with Multipartite Graphs","author":"Boudin","year":"2018"},{"key":"10.1016\/j.procs.2022.09.042_bib0006","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.eswa.2017.12.025","article-title":"A Graph based Keyword Extraction Model using Collective Node Weight","volume":"97","author":"Saroj","year":"2018","journal-title":"Expert Systems with Application"},{"key":"10.1016\/j.procs.2022.09.042_bib0007","series-title":"Proc. the International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technology (IAT)","first-page":"372","article-title":"A Novel Graph-based Key Phrase Extraction in Twitter","author":"Bellaachia","year":"2012"},{"key":"10.1016\/j.procs.2022.09.042_bib0008","series-title":"Proc. Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems (NIPS)","first-page":"5998","article-title":"Attention is all you need","author":"Vaswani","year":"2017"},{"key":"10.1016\/j.procs.2022.09.042_bib0009","first-page":"1692","article-title":"Entity relation extraction method based on improved attention mechanism","volume":"47","author":"Feng","year":"2019","journal-title":"Acta Electronica Sinica"},{"key":"10.1016\/j.procs.2022.09.042_bib0010","series-title":"Proc. the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT)","first-page":"2227","article-title":"Deep Contextualized Word Representations","author":"Matthew","year":"2018"},{"key":"10.1016\/j.procs.2022.09.042_bib0011","unstructured":"Sun S., Xiong C., Liu Z., et al. Joint Keyphrase Chunking and Salience Ranking with BERT[Online]. arXiv preprint arXiv:2004.13639.2020."},{"key":"10.1016\/j.procs.2022.09.042_bib0012","series-title":"Proc. the 2018 Conference on Empirical Methods in Natural Language Processing (EMNLP)","first-page":"931","article-title":"SQL-to-Text Generation with Graph-to-Sequence Model","author":"Xu","year":"2018"},{"key":"10.1016\/j.procs.2022.09.042_bib0013","series-title":"Proc. the 56th Annual Meeting of the Association for Computational Linguistics (ACL)","first-page":"273","article-title":"Graph-to-Sequence Learning using Gated Graph Neural Networks","author":"Beck","year":"2018"},{"issue":"15","key":"10.1016\/j.procs.2022.09.042_bib0014","doi-asserted-by":"crossref","first-page":"8875","DOI":"10.1007\/s11042-014-2303-9","article-title":"Topical key concept extraction from folksonomy through graph-based ranking","volume":"75","author":"Xue","year":"2016","journal-title":"Multim. Tools Appl. Vol."},{"issue":"10","key":"10.1016\/j.procs.2022.09.042_bib0015","first-page":"25","article-title":"Keyword Extraction Using Graph Based Approach","volume":"6","author":"Nagarajan","year":"2016","journal-title":"International Journal Advanced Research in Computer Science and Software Engineering"},{"issue":"1","key":"10.1016\/j.procs.2022.09.042_bib0016","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10844-015-0391-2","article-title":"A just-in-time keyword extraction from meeting transcripts using temporal and participant information","volume":"48","author":"Song","year":"2017","journal-title":"Journal of Intelligent Information Systems"},{"key":"10.1016\/j.procs.2022.09.042_bib0017","series-title":"Proc. the 54th Annual Meeting of the Association for Computational Linguistics (ACL)","first-page":"582","article-title":"Deep Keyphrase Generation","author":"Meng","year":"2017"},{"key":"10.1016\/j.procs.2022.09.042_bib0018","series-title":"Proc. the 2009 Conference on Empirical Methods in Natural Language Processing (EMNLP)","first-page":"1318","article-title":"Human-competitive tagging using automatic keyphrase extraction","author":"Medelyan","year":"2009"},{"key":"10.1016\/j.procs.2022.09.042_bib0019","doi-asserted-by":"crossref","first-page":"46047","DOI":"10.1109\/ACCESS.2018.2865589","article-title":"Keyphrase Generation Based on Deep Seq2seq Model","volume":"6","author":"Zhang","year":"2018","journal-title":"IEEE Access"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050922009152?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050922009152?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T02:29:56Z","timestamp":1761791396000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050922009152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":19,"alternative-id":["S1877050922009152"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2022.09.042","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Empower Keywords Generation for Short Texts with Graph-to-Sequence Learning","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2022.09.042","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}