Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11779/2355
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Belkadi, Widad Hassina | - |
dc.contributor.author | Drias, Yassine | - |
dc.contributor.author | Drias, Habiba | - |
dc.date.accessioned | 2024-10-05T18:38:43Z | - |
dc.date.available | 2024-10-05T18:38:43Z | - |
dc.date.issued | 2024 | - |
dc.identifier.isbn | 9783031602740 | - |
dc.identifier.isbn | 9783031593185 | - |
dc.identifier.isbn | 9783031593178 | - |
dc.identifier.issn | 3004-958X | - |
dc.identifier.uri | https://doi.org/10.1007/978-3-031-59318-5_8 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11779/2355 | - |
dc.description.abstract | Quantum computing, based on quantum mechanics, promises revolutionary computational power by exploiting quantum states. It provides significant advantages over classical computing regarding time complexity, enabling faster and more efficient problem-solving. This paper explores the application of quantum computing in frequent itemset mining and association rules mining, a crucial task in data mining and pattern recognition. We propose a novel algorithm called Quantum FP-Growth (QFP-Growth) for mining frequent itemsets. The QFP-Growth algorithm follows the traditional FP-Growth approach, constructing a QF-list, then the QFP-tree, a quantum radix tree, to efficiently mine frequent itemsets from large datasets. We present a detailed analysis of each step in the QFP-Growth algorithm, providing insights into its time complexity and computational efficiency. Our algorithm outperforms classical FP-Growth with a quadratic improvement in error dependence, showcasing the power of quantum algorithms in data mining. To validate the effectiveness of our approach, we conducted experiments using the IBM QASM simulator, qiskit. The results demonstrate the efficiency and effectiveness of our QFP-Growth algorithm in mining frequent itemsets from a transactional database. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer international Publishing Ag | en_US |
dc.relation.ispartof | Symposium on Quantum Sciences, Applications and Challenges (QSAC) -- SEP 24-25, 2023 -- Alger Acad Sci & Tech, Algiers, ALGERIA | en_US |
dc.relation.ispartofseries | Information Systems Engineering and Management | - |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Quantum machine learning | en_US |
dc.subject | Frequent itemset mining | en_US |
dc.subject | Association rules mining | en_US |
dc.subject | Fp-growth | en_US |
dc.subject | Ibm qasm simulator | en_US |
dc.subject | Qiskit | en_US |
dc.title | Quantum Fp-Growth for Association Rules Mining | en_US |
dc.type | Conference Object | en_US |
dc.identifier.doi | 10.1007/978-3-031-59318-5_8 | - |
local.message.claim | 2024-10-23T16:40:49.194+0300 | * |
local.message.claim | |rp00139 | * |
local.message.claim | |submit_approve | * |
local.message.claim | |dc_contributor_author | * |
local.message.claim | |None | * |
dc.description.PublishedMonth | Haziran | en_US |
dc.description.woscitationindex | Conference Proceedings Citation Index - Science | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.endpage | 106 | en_US |
dc.identifier.startpage | 91 | en_US |
dc.identifier.volume | 2 | en_US |
dc.department | Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.identifier.wos | WOS:001298001300008 | en_US |
dc.institutionauthor | Drias, Yassine | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.languageiso639-1 | en | - |
item.openairetype | Conference Object | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.02. Department of Computer Engineering | - |
Appears in Collections: | WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.