使用基准数据集的相似度量和文本文档分类准确性

K. VinayKumar, Srinivasan Rajavelu, R. E. Blessing
{"title":"使用基准数据集的相似度量和文本文档分类准确性","authors":"K. VinayKumar, Srinivasan Rajavelu, R. E. Blessing","doi":"10.1109/ICOEI48184.2020.9142892","DOIUrl":null,"url":null,"abstract":"The total amount of text data information available on the web has been remarkably increasing the data accumulating and augmenting each day. Data and information that are available in high volume are not represented in a structured form that remains suitable for text processing. Text data mining is a subfield of data mining which aims at exploring the useful information from the recorded resources. Text data mining has the following key challenges namely high dimensionality, distance measures between data, achieving quality and classifier accuracies. The research work has attempted to addresses the key text data mining challenges by proposing high-dimensionality reduction novel techniques based on feature similarity functions. In the proposed design, the feature similarity measures are used to group features into clusters. From these feature clusters, an optimal transformation matrix is obtained using which the high dimension text corpus is projected to its equivalent low dimension. This low dimensionality text corpus can be used to implement text clustering and text classification efficiently.","PeriodicalId":267795,"journal":{"name":"2020 4th International Conference on Trends in Electronics and Informatics (ICOEI)(48184)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Similarity Measures and Text Documents Classfication Accuracies Using Benchmark Datasets\",\"authors\":\"K. VinayKumar, Srinivasan Rajavelu, R. E. Blessing\",\"doi\":\"10.1109/ICOEI48184.2020.9142892\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The total amount of text data information available on the web has been remarkably increasing the data accumulating and augmenting each day. Data and information that are available in high volume are not represented in a structured form that remains suitable for text processing. Text data mining is a subfield of data mining which aims at exploring the useful information from the recorded resources. Text data mining has the following key challenges namely high dimensionality, distance measures between data, achieving quality and classifier accuracies. The research work has attempted to addresses the key text data mining challenges by proposing high-dimensionality reduction novel techniques based on feature similarity functions. In the proposed design, the feature similarity measures are used to group features into clusters. From these feature clusters, an optimal transformation matrix is obtained using which the high dimension text corpus is projected to its equivalent low dimension. This low dimensionality text corpus can be used to implement text clustering and text classification efficiently.\",\"PeriodicalId\":267795,\"journal\":{\"name\":\"2020 4th International Conference on Trends in Electronics and Informatics (ICOEI)(48184)\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 4th International Conference on Trends in Electronics and Informatics (ICOEI)(48184)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOEI48184.2020.9142892\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 4th International Conference on Trends in Electronics and Informatics (ICOEI)(48184)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOEI48184.2020.9142892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

网络上可用的文本数据信息的总量以每天积累和增加的速度显著增加。大量可用的数据和信息没有以仍然适合文本处理的结构化形式表示。文本数据挖掘是数据挖掘的一个分支,旨在从记录资源中挖掘有用信息。文本数据挖掘具有以下关键挑战:高维度、数据之间的距离度量、实现质量和分类器精度。研究工作试图通过提出基于特征相似函数的高维降维新技术来解决关键的文本数据挖掘挑战。在提出的设计中,使用特征相似度度量将特征分组到聚类中。从这些特征聚类中得到一个最优变换矩阵,利用该变换矩阵将高维文本语料库投影到相应的低维文本语料库。这种低维文本语料库可以有效地实现文本聚类和文本分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Similarity Measures and Text Documents Classfication Accuracies Using Benchmark Datasets
The total amount of text data information available on the web has been remarkably increasing the data accumulating and augmenting each day. Data and information that are available in high volume are not represented in a structured form that remains suitable for text processing. Text data mining is a subfield of data mining which aims at exploring the useful information from the recorded resources. Text data mining has the following key challenges namely high dimensionality, distance measures between data, achieving quality and classifier accuracies. The research work has attempted to addresses the key text data mining challenges by proposing high-dimensionality reduction novel techniques based on feature similarity functions. In the proposed design, the feature similarity measures are used to group features into clusters. From these feature clusters, an optimal transformation matrix is obtained using which the high dimension text corpus is projected to its equivalent low dimension. This low dimensionality text corpus can be used to implement text clustering and text classification efficiently.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信