{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T17:51:16Z","timestamp":1780509076344,"version":"3.54.1"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2018YFB1402800"],"award-info":[{"award-number":["2018YFB1402800"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Zhejiang Lab","award":["2020 AA 3AB05"],"award-info":[{"award-number":["2020 AA 3AB05"]}]},{"name":"Fundamental Research Funds for the Provincial Universities of Zhejiang","award":["RF-A2020007"],"award-info":[{"award-number":["RF-A2020007"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2021,6,23]]},"abstract":"<jats:p>\n            Automatically summarizing a group of short texts that mainly share one topic is a fundamental task in many applications, e.g., summarizing the main symptoms for a disease based on a group of medical texts that are usually short, i.e., tens of words. Conventional unsupervised short text summarization techniques tend to find the most representative short text document. However, they may cause privacy issues, e.g., personal information in the medical texts may be exposed. Moreover, compared with the complete short text where some unimportant words may exist, a summary consisting of only a few keywords is more preferable by the user due to its clear and concise form. Due to the above reasons, in this article, we aim to solve the problem of unsupervised derivation of keyword summary for short texts. Existing keyword extraction methods such as Latent Dirichlet Allocation cannot be applied to solve this problem, since (1)\u00a0the ordering relations among the extracted keywords are ignored, which causes troubles for people to capture the main idea of the event, and (2)\u00a0short texts contain limited context, which makes it hard to find the optimal words for semantic coverage. Hence, we propose a simple but yet effective method named\n            <jats:italic>Frequent Closed Wordsets Ranking (FCWRank)<\/jats:italic>\n            to derive the keyword summary from a short text cluster. FCWRank is an unsupervised method that builds on the idea of frequent closed itemset mining in transaction database. FCWRank first mines all frequent closed wordsets from a cluster of short texts and then selects the most important wordset based on an importance model where the similarity between closed wordsets and the relation between the closed wordset and the short text document are considered simultaneously. To make the keywords within the wordset more understandable, FCWRank further unfolds the semantics behind them by sorting them. Experiments on real-world short text collections show that FCWRank outperforms the state-of-the-art baselines in terms of Recall-Oriented Understudy for Gisting Evaluation-Longest common subsequence F1, precision and recall scores.\n          <\/jats:p>","DOI":"10.1145\/3397162","type":"journal-article","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T12:39:34Z","timestamp":1594125574000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Unsupervised Derivation of Keyword Summary for Short Texts"],"prefix":"10.1145","volume":"21","author":[{"given":"Bin","family":"Cao","sequence":"first","affiliation":[{"name":"College of Computer Science, Zhejiang University of Technology, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiawei","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University of Technology, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sichao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computing and Information, University of Pittsburgh, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Honghao","family":"Gao","sequence":"additional","affiliation":[{"name":"Computing Center, Shanghai University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Fan","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University of Technology, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuiguang","family":"Deng","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianwei","family":"Yin","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7966-4488","authenticated-orcid":false,"given":"Xuan","family":"Liu","sequence":"additional","affiliation":[{"name":"Future Network Research Center, Southeast University, China and School of Information Engineering, Yangzhou University, Yangzhou, Jiangsu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,2]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"19","article-title":"Applying genetic algorithms to information retrieval using vector space model","volume":"5","author":"Abualigah Laith Mohammad","year":"2015","unstructured":"Laith Mohammad Abualigah and Essam Said Hanandeh . 2015 . Applying genetic algorithms to information retrieval using vector space model . Int. J. Comput. Sci. Eng. Appl. 5 , 1 (2015), 19 \u2013 28 . Laith Mohammad Abualigah and Essam Said Hanandeh. 2015. Applying genetic algorithms to information retrieval using vector space model. Int. J. Comput. Sci. Eng. Appl. 5, 1 (2015), 19\u201328.","journal-title":"Int. J. Comput. Sci. Eng. Appl."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-2046-2"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.07.018"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.05.003"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3288064.3288097"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.06.059"},{"key":"e_1_2_1_7_1","volume-title":"Feature Selection and Enhanced Krill Herd Algorithm\u00a0for Text Document Clustering","author":"Qasim Abualigah Laith Mohammad","unstructured":"Laith Mohammad Qasim Abualigah . 2019. Feature Selection and Enhanced Krill Herd Algorithm\u00a0for Text Document Clustering . Springer . Laith Mohammad Qasim Abualigah. 2019. Feature Selection and Enhanced Krill Herd Algorithm\u00a0for Text Document Clustering. Springer."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645480.655281"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2018.06.005"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.06.046"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh061"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2313872"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.3115\/1220175.1220214"},{"key":"e_1_2_1_15_1","first-page":"391","article-title":"Indexing by latent semantic analysis","volume":"41","author":"Deerwester Scott","year":"1990","unstructured":"Scott Deerwester , Susan T. Dumais , George W. Furnas , Thomas K. Landauer , and Richard Harshman . 1990 . Indexing by latent semantic analysis . J. Assoc. Inf. Sci. Technol. 41 , 6 (1990), 391 \u2013 407 . Scott Deerwester, Susan T. Dumais, George W. Furnas, Thomas K. Landauer, and Richard Harshman. 1990. Indexing by latent semantic analysis. J. Assoc. Inf. Sci. Technol. 41, 6 (1990), 391\u2013407.","journal-title":"J. Assoc. Inf. Sci. Technol."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijmedinf.2019.05.019"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/5.1.10"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2073796.2073829"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1964858.1964870"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656379"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063689"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765751.1765753"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.77"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911499"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1058150.1058158"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832415.2832426"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017884"},{"key":"e_1_2_1_29_1","volume-title":"Rouge: A package for automatic evaluation of summaries","author":"Lin Chin-Yew","year":"2004","unstructured":"Chin-Yew Lin . 2004 . Rouge: A package for automatic evaluation of summaries . In Text Summarization Branches OutAssociation for Computational Linguistics, Barcelona , Spain , 74\u201381. Chin-Yew Lin. 2004. Rouge: A package for automatic evaluation of summaries. In Text Summarization Branches OutAssociation for Computational Linguistics, Barcelona, Spain, 74\u201381."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1613172.1613178"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P14-5010"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900370"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1597538.1597662"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP\u201904)","author":"Mihalcea Rada","year":"2004","unstructured":"Rada Mihalcea and Paul Tarau . 2004 . Textrank: Bringing order into text . In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP\u201904) . Rada Mihalcea and Paul Tarau. 2004. Textrank: Bringing order into text. In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP\u201904)."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cmpb.2017.05.011"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artmed.2017.11.004"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2166966.2166999"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656256"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367510"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artmed.2011.06.005"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141277.1141317"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.06.002"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.46"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/3044805.3044828"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143967"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL\u201916)","author":"Wang Zhongyuan","year":"2016","unstructured":"Zhongyuan Wang and Haixun Wang . 2016 . Understanding short texts . In Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL\u201916) (Tutorial). Zhongyuan Wang and Haixun Wang. 2016. Understanding short texts. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL\u201916) (Tutorial)."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/3171837.3171867"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1361684.1361686"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/2002472.2002521"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/1996889.1996934"},{"key":"e_1_2_1_52_1","volume-title":"Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology","author":"Zipf George Kingsley","unstructured":"George Kingsley Zipf . 2016. Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology . Ravenio Books . George Kingsley Zipf. 2016. Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology. Ravenio Books."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0882-z"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397162","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:25Z","timestamp":1750200085000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,2]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6,23]]}},"alternative-id":["10.1145\/3397162"],"URL":"https:\/\/doi.org\/10.1145\/3397162","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,2]]},"assertion":[{"value":"2020-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}