标注科学文章的层次聚类

Irina Peganova, A. Rebrova, Y. Nedumov
{"title":"标注科学文章的层次聚类","authors":"Irina Peganova, A. Rebrova, Y. Nedumov","doi":"10.1109/IVMEM.2019.00010","DOIUrl":null,"url":null,"abstract":"Exploration of document collections is a complex task. One way to do this is to cluster the initial collection hierarchically and then label each cluster with a set of extracted terms. Good labelling should help exploration. We focus on the scientific domain and particularly on collections of abstracts of articles. Abstract is commonly a brief of a paper that outlines the research area, the challenge, the proposed solution and the results; so it could be used instead of a full article despite the difficulties related to its shortness. In this paper, we propose a new method HCBasic for labelling hierarchical clusters. It is particularly tuned for articles' abstracts and compared to three other methods: MTWL, hierMTWL and ComboBasic. To evaluate the quality of the labelling algorithms we did A/B testing in which eight volunteers searched for the articles that they were familiar with in the labelled cluster tree. We show that there is no single winner in terms of quality, and different methods are preferable in different cases.","PeriodicalId":166102,"journal":{"name":"2019 Ivannikov Memorial Workshop (IVMEM)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Labelling Hierarchical Clusters of Scientific Articles\",\"authors\":\"Irina Peganova, A. Rebrova, Y. Nedumov\",\"doi\":\"10.1109/IVMEM.2019.00010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Exploration of document collections is a complex task. One way to do this is to cluster the initial collection hierarchically and then label each cluster with a set of extracted terms. Good labelling should help exploration. We focus on the scientific domain and particularly on collections of abstracts of articles. Abstract is commonly a brief of a paper that outlines the research area, the challenge, the proposed solution and the results; so it could be used instead of a full article despite the difficulties related to its shortness. In this paper, we propose a new method HCBasic for labelling hierarchical clusters. It is particularly tuned for articles' abstracts and compared to three other methods: MTWL, hierMTWL and ComboBasic. To evaluate the quality of the labelling algorithms we did A/B testing in which eight volunteers searched for the articles that they were familiar with in the labelled cluster tree. We show that there is no single winner in terms of quality, and different methods are preferable in different cases.\",\"PeriodicalId\":166102,\"journal\":{\"name\":\"2019 Ivannikov Memorial Workshop (IVMEM)\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Ivannikov Memorial Workshop (IVMEM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IVMEM.2019.00010\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Ivannikov Memorial Workshop (IVMEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IVMEM.2019.00010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

探索文档集合是一项复杂的任务。一种方法是分层地对初始集合进行聚类,然后用一组提取的术语标记每个聚类。好的标签应该有助于探索。我们专注于科学领域,特别是文章摘要的收集。摘要通常是一篇论文的摘要,概述了研究领域、挑战、提出的解决方案和结果;所以它可以用来代替一篇完整的文章,尽管与它的短有关的困难。本文提出了一种新的层次聚类标记方法HCBasic。它特别针对文章摘要进行了优化,并与其他三种方法(MTWL、hierMTWL和ComboBasic)进行了比较。为了评估标记算法的质量,我们进行了A/B测试,其中8名志愿者在标记的聚类树中搜索他们熟悉的文章。我们表明,在质量方面没有单一的赢家,在不同的情况下,不同的方法是可取的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Labelling Hierarchical Clusters of Scientific Articles
Exploration of document collections is a complex task. One way to do this is to cluster the initial collection hierarchically and then label each cluster with a set of extracted terms. Good labelling should help exploration. We focus on the scientific domain and particularly on collections of abstracts of articles. Abstract is commonly a brief of a paper that outlines the research area, the challenge, the proposed solution and the results; so it could be used instead of a full article despite the difficulties related to its shortness. In this paper, we propose a new method HCBasic for labelling hierarchical clusters. It is particularly tuned for articles' abstracts and compared to three other methods: MTWL, hierMTWL and ComboBasic. To evaluate the quality of the labelling algorithms we did A/B testing in which eight volunteers searched for the articles that they were familiar with in the labelled cluster tree. We show that there is no single winner in terms of quality, and different methods are preferable in different cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信