基于类概率分布的最大熵模型的稀疏实例数据集分类

IF 1.2 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Computer Science and Information Systems Pub Date : 2023-01-01 DOI:10.2298/csis211030001s
Arumugam Saravanan, Damotharan Anandhi, Marudhachalam Srividya
{"title":"基于类概率分布的最大熵模型的稀疏实例数据集分类","authors":"Arumugam Saravanan, Damotharan Anandhi, Marudhachalam Srividya","doi":"10.2298/csis211030001s","DOIUrl":null,"url":null,"abstract":"Due to the digital revolution, the amount of data to be processed is growing every day. One of the more common functions used to process these data is classification. However, the results obtained by most existing classifiers are not satisfactory, as they often depend on the number and type of attributes within the datasets. In this paper, a maximum entropy model based on class probability distribution is proposed for classifying data in sparse datasets with fewer attributes and instances. Moreover, a new idea of using Lagrange multipliers is suggested for estimating class probabilities in the process of class label prediction. Experimental analysis indicates that the proposed model has an average accuracy of 89.9% and 86.93% with 17 and 36 datasets. Besides, statistical analysis of the results indicates that the proposed model offers greater classification accuracy for over 50% of datasets with fewer attributes and instances than other competitors.","PeriodicalId":50636,"journal":{"name":"Computer Science and Information Systems","volume":"130 1","pages":"949-976"},"PeriodicalIF":1.2000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Class probability distribution based maximum entropy model for classification of datasets with sparse instances\",\"authors\":\"Arumugam Saravanan, Damotharan Anandhi, Marudhachalam Srividya\",\"doi\":\"10.2298/csis211030001s\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the digital revolution, the amount of data to be processed is growing every day. One of the more common functions used to process these data is classification. However, the results obtained by most existing classifiers are not satisfactory, as they often depend on the number and type of attributes within the datasets. In this paper, a maximum entropy model based on class probability distribution is proposed for classifying data in sparse datasets with fewer attributes and instances. Moreover, a new idea of using Lagrange multipliers is suggested for estimating class probabilities in the process of class label prediction. Experimental analysis indicates that the proposed model has an average accuracy of 89.9% and 86.93% with 17 and 36 datasets. Besides, statistical analysis of the results indicates that the proposed model offers greater classification accuracy for over 50% of datasets with fewer attributes and instances than other competitors.\",\"PeriodicalId\":50636,\"journal\":{\"name\":\"Computer Science and Information Systems\",\"volume\":\"130 1\",\"pages\":\"949-976\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science and Information Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.2298/csis211030001s\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science and Information Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.2298/csis211030001s","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

由于数字革命,每天要处理的数据量都在增长。用于处理这些数据的更常用的功能之一是分类。然而,大多数现有分类器获得的结果并不令人满意,因为它们通常依赖于数据集中属性的数量和类型。本文提出了一种基于类概率分布的最大熵模型,用于属性和实例较少的稀疏数据集中的数据分类。此外,在类标记预测过程中,提出了利用拉格朗日乘子估计类概率的新思路。实验分析表明,该模型在17组和36组数据集上的平均准确率分别为89.9%和86.93%。此外,对结果的统计分析表明,与其他竞争对手相比,该模型在属性和实例较少的情况下,对超过50%的数据集具有更高的分类精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Class probability distribution based maximum entropy model for classification of datasets with sparse instances
Due to the digital revolution, the amount of data to be processed is growing every day. One of the more common functions used to process these data is classification. However, the results obtained by most existing classifiers are not satisfactory, as they often depend on the number and type of attributes within the datasets. In this paper, a maximum entropy model based on class probability distribution is proposed for classifying data in sparse datasets with fewer attributes and instances. Moreover, a new idea of using Lagrange multipliers is suggested for estimating class probabilities in the process of class label prediction. Experimental analysis indicates that the proposed model has an average accuracy of 89.9% and 86.93% with 17 and 36 datasets. Besides, statistical analysis of the results indicates that the proposed model offers greater classification accuracy for over 50% of datasets with fewer attributes and instances than other competitors.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Science and Information Systems
Computer Science and Information Systems COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
2.30
自引率
21.40%
发文量
76
审稿时长
7.5 months
期刊介绍: About the journal Home page Contact information Aims and scope Indexing information Editorial policies ComSIS consortium Journal boards Managing board For authors Information for contributors Paper submission Article submission through OJS Copyright transfer form Download section For readers Forthcoming articles Current issue Archive Subscription For reviewers View and review submissions News Journal''s Facebook page Call for special issue New issue notification Aims and scope Computer Science and Information Systems (ComSIS) is an international refereed journal, published in Serbia. The objective of ComSIS is to communicate important research and development results in the areas of computer science, software engineering, and information systems.
期刊最新文献
Reviewer Acknowledgements for Computer and Information Science, Vol. 16, No. 3 Drawbacks of Traditional Environmental Monitoring Systems Improving the Classification Ability of Delegating Classifiers Using Different Supervised Machine Learning Algorithms Reinforcement learning - based adaptation and scheduling methods for multi-source DASH On the Convergence of Hypergeometric to Binomial Distributions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1