Comparison of machine learning algorithms for classification of Big Data sets

IF 0.9 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Theoretical Computer Science Pub Date : 2024-10-28 DOI:10.1016/j.tcs.2024.114938
Barkha Singh, Sreedevi Indu, Sudipta Majumdar
{"title":"Comparison of machine learning algorithms for classification of Big Data sets","authors":"Barkha Singh,&nbsp;Sreedevi Indu,&nbsp;Sudipta Majumdar","doi":"10.1016/j.tcs.2024.114938","DOIUrl":null,"url":null,"abstract":"<div><div>This article analyzes and compares various Quantum machine learning algorithms on big data. The main contribution of this article is to provide a new machine-learning approach using Quantum computing for big data analysis with features of robust, novel, and effective Quantum computing. This work proposes a global Quantum feature extraction technique for large-scale image classification based on Schmidt decomposition for the first time. Additionally, a new version of the Quantum learning algorithm is presented, which uses the features of Hamming distance to classify images. With the help of algorithm analysis and experimental findings from the benchmark database Caltech 101, a successful method for large-scale image classification is developed and put forth in the context of big data. The proposed model yields an average accuracy of 98% with the proposed enhanced Quantum classifier, QeSVM classifier, swarm particle optimizer with Twin wave SVM, QPSO-TWSVM, and other Q-CNN models on different Big Data sets.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1024 ","pages":"Article 114938"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005553","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

This article analyzes and compares various Quantum machine learning algorithms on big data. The main contribution of this article is to provide a new machine-learning approach using Quantum computing for big data analysis with features of robust, novel, and effective Quantum computing. This work proposes a global Quantum feature extraction technique for large-scale image classification based on Schmidt decomposition for the first time. Additionally, a new version of the Quantum learning algorithm is presented, which uses the features of Hamming distance to classify images. With the help of algorithm analysis and experimental findings from the benchmark database Caltech 101, a successful method for large-scale image classification is developed and put forth in the context of big data. The proposed model yields an average accuracy of 98% with the proposed enhanced Quantum classifier, QeSVM classifier, swarm particle optimizer with Twin wave SVM, QPSO-TWSVM, and other Q-CNN models on different Big Data sets.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于大数据集分类的机器学习算法比较
本文分析和比较了大数据中的各种量子机器学习算法。本文的主要贡献在于利用量子计算为大数据分析提供了一种新的机器学习方法,具有鲁棒、新颖、有效的量子计算特点。这项工作首次提出了基于施密特分解的大规模图像分类全局量子特征提取技术。此外,还提出了新版量子学习算法,该算法利用汉明距离特征对图像进行分类。借助算法分析和基准数据库 Caltech 101 的实验结果,在大数据背景下开发并提出了一种成功的大规模图像分类方法。所提出的模型与所提出的增强型量子分类器、QeSVM 分类器、群粒子优化器与双波 SVM、QPSO-TWSVM 以及其他 Q-CNN 模型在不同的大数据集上的平均准确率达到 98%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.
期刊最新文献
Editorial Board Editorial Board Editorial Board Towards strong regret minimization sets: Balancing freshness and diversity in data selection Adding direction constraints to the 1-2-3 Conjecture
×
引用
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