量子聚类算法中数据准备方法的比较研究

Oumayma Ouedrhiri, Oumayma Banouar, S. Raghay, S. E. Hadaj
{"title":"量子聚类算法中数据准备方法的比较研究","authors":"Oumayma Ouedrhiri, Oumayma Banouar, S. Raghay, S. E. Hadaj","doi":"10.1145/3454127.3456607","DOIUrl":null,"url":null,"abstract":"More powerful and better performing, quantum algorithms offer a noticeable speedup in comparison with classical algorithms. This is due to the superposition property of quantum information. It helps to obtain algorithms that are better in terms of speed and performance. Machine learning benefits from quantum computing advantages to help time consuming algorithms run faster in the best conditions (without having to lose information). In the clustering algorithms case, the distance calculation between data points is the most resource consuming step. Thus, the use of a quantum distance is very helpful. In this paper, we test a number of quantum clustering algorithms with different data preparation methods. Experiments were done for different datasets (Iris, Wine, Breast cancer) and the comparison is based on the Clustering quality and the accuracy score.","PeriodicalId":432206,"journal":{"name":"Proceedings of the 4th International Conference on Networking, Information Systems & Security","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comparative study of data preparation methods in quantum clustering algorithms\",\"authors\":\"Oumayma Ouedrhiri, Oumayma Banouar, S. Raghay, S. E. Hadaj\",\"doi\":\"10.1145/3454127.3456607\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"More powerful and better performing, quantum algorithms offer a noticeable speedup in comparison with classical algorithms. This is due to the superposition property of quantum information. It helps to obtain algorithms that are better in terms of speed and performance. Machine learning benefits from quantum computing advantages to help time consuming algorithms run faster in the best conditions (without having to lose information). In the clustering algorithms case, the distance calculation between data points is the most resource consuming step. Thus, the use of a quantum distance is very helpful. In this paper, we test a number of quantum clustering algorithms with different data preparation methods. Experiments were done for different datasets (Iris, Wine, Breast cancer) and the comparison is based on the Clustering quality and the accuracy score.\",\"PeriodicalId\":432206,\"journal\":{\"name\":\"Proceedings of the 4th International Conference on Networking, Information Systems & Security\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 4th International Conference on Networking, Information Systems & Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3454127.3456607\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th International Conference on Networking, Information Systems & Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3454127.3456607","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

与经典算法相比,量子算法更强大,性能更好,提供了明显的加速。这是由于量子信息的叠加特性。它有助于获得在速度和性能方面更好的算法。机器学习得益于量子计算的优势,可以帮助耗时的算法在最佳条件下更快地运行(而不必丢失信息)。在聚类算法中,数据点之间的距离计算是消耗资源最多的步骤。因此,使用量子距离是非常有用的。在本文中,我们用不同的数据准备方法测试了一些量子聚类算法。对不同的数据集(虹膜,葡萄酒,乳腺癌)进行实验,并根据聚类质量和准确率评分进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparative study of data preparation methods in quantum clustering algorithms
More powerful and better performing, quantum algorithms offer a noticeable speedup in comparison with classical algorithms. This is due to the superposition property of quantum information. It helps to obtain algorithms that are better in terms of speed and performance. Machine learning benefits from quantum computing advantages to help time consuming algorithms run faster in the best conditions (without having to lose information). In the clustering algorithms case, the distance calculation between data points is the most resource consuming step. Thus, the use of a quantum distance is very helpful. In this paper, we test a number of quantum clustering algorithms with different data preparation methods. Experiments were done for different datasets (Iris, Wine, Breast cancer) and the comparison is based on the Clustering quality and the accuracy score.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信