研究文章建议采用主题建模

V. Chaitanya, P. Singh
{"title":"研究文章建议采用主题建模","authors":"V. Chaitanya, P. Singh","doi":"10.1109/ISCMI.2017.8279622","DOIUrl":null,"url":null,"abstract":"Searching research articles effectively is significantly important to researchers. Currently, researchers use search engines like Google Scholar and search by keywords. The typical search result includes a lot of articles which match the keywords exactly; however, they are on many different topics. It is very time and effort consuming to go through the articles manually and select desirable ones. We propose a method to search articles by topics. Our method trains on a large set of articles and analyzes every article in it to generate its distribution over topics. The method recommends articles to the researcher by analyzing the input given by her/him and comparing with the topic distribution of all articles in the training set. The articles with most similar distributions are recommended to the researcher. In this way, articles are recommended by matching by topics rather than keywords. Our experimental results are analyzed using Mean average precision (MAP) and Normalized Discounted Cumulative Gain (NDCG). The obtained results demonstrate that our method successfully extracts the topics beneath the words of an article and recommend closely related ones.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Research articles suggestion using topic modelling\",\"authors\":\"V. Chaitanya, P. Singh\",\"doi\":\"10.1109/ISCMI.2017.8279622\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Searching research articles effectively is significantly important to researchers. Currently, researchers use search engines like Google Scholar and search by keywords. The typical search result includes a lot of articles which match the keywords exactly; however, they are on many different topics. It is very time and effort consuming to go through the articles manually and select desirable ones. We propose a method to search articles by topics. Our method trains on a large set of articles and analyzes every article in it to generate its distribution over topics. The method recommends articles to the researcher by analyzing the input given by her/him and comparing with the topic distribution of all articles in the training set. The articles with most similar distributions are recommended to the researcher. In this way, articles are recommended by matching by topics rather than keywords. Our experimental results are analyzed using Mean average precision (MAP) and Normalized Discounted Cumulative Gain (NDCG). The obtained results demonstrate that our method successfully extracts the topics beneath the words of an article and recommend closely related ones.\",\"PeriodicalId\":119111,\"journal\":{\"name\":\"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCMI.2017.8279622\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCMI.2017.8279622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

有效地检索研究论文对研究人员来说是非常重要的。目前,研究人员使用谷歌学术等搜索引擎,通过关键词进行搜索。典型的搜索结果包括大量与关键词完全匹配的文章;然而,他们讨论的是许多不同的话题。手动浏览文章并选择需要的文章是非常费时费力的。我们提出了一种按主题搜索文章的方法。我们的方法对大量文章进行训练,并分析其中的每篇文章,以生成其在主题上的分布。该方法通过分析研究者给出的输入,并与训练集中所有文章的主题分布进行比较,向研究者推荐文章。将分布最相似的文章推荐给研究人员。通过这种方式,文章是通过主题而不是关键词匹配来推荐的。我们的实验结果使用平均精度(MAP)和归一化贴现累积增益(NDCG)进行分析。结果表明,我们的方法成功地提取了文章词下的主题,并推荐了密切相关的主题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research articles suggestion using topic modelling
Searching research articles effectively is significantly important to researchers. Currently, researchers use search engines like Google Scholar and search by keywords. The typical search result includes a lot of articles which match the keywords exactly; however, they are on many different topics. It is very time and effort consuming to go through the articles manually and select desirable ones. We propose a method to search articles by topics. Our method trains on a large set of articles and analyzes every article in it to generate its distribution over topics. The method recommends articles to the researcher by analyzing the input given by her/him and comparing with the topic distribution of all articles in the training set. The articles with most similar distributions are recommended to the researcher. In this way, articles are recommended by matching by topics rather than keywords. Our experimental results are analyzed using Mean average precision (MAP) and Normalized Discounted Cumulative Gain (NDCG). The obtained results demonstrate that our method successfully extracts the topics beneath the words of an article and recommend closely related ones.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信