An Enhanced Quantum K-Nearest Neighbor Classification Algorithm Based on Polar Distance

The K-nearest neighbor (KNN) algorithm is one of the most extensively used classification algorithms, while its high time complexity limits its performance in the era of big data. The quantum K-nearest neighbor (QKNN) algorithm can handle the above problem with satisfactory efficiency; however, its...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Entropy (Basel, Switzerland) Ročník 25; číslo 1; s. 127
Hlavní autoři: Feng, Congcong, Zhao, Bo, Zhou, Xin, Ding, Xiaodong, Shan, Zheng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Switzerland MDPI AG 08.01.2023
MDPI
Témata:
Accuracy
Algorithms
Artificial intelligence
Big Data
Classification
Euclidean geometry
K-nearest neighbor algorithm
K-nearest neighbors algorithm
Machine learning
Polar coordinates
quantum computation
quantum K-nearest neighbor algorithm
quantum machine learning
Similarity
Similarity measures
quantum K-nearest neighbor algorithm
quantum machine learning
K-nearest neighbor algorithm
quantum computation
ISSN:1099-4300, 1099-4300
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The K-nearest neighbor (KNN) algorithm is one of the most extensively used classification algorithms, while its high time complexity limits its performance in the era of big data. The quantum K-nearest neighbor (QKNN) algorithm can handle the above problem with satisfactory efficiency; however, its accuracy is sacrificed when directly applying the traditional similarity measure based on Euclidean distance. Inspired by the Polar coordinate system and the quantum property, this work proposes a new similarity measure to replace the Euclidean distance, which is defined as Polar distance. Polar distance considers both angular and module length information, introducing a weight parameter adjusted to the specific application data. To validate the efficiency of Polar distance, we conducted various experiments using several typical datasets. For the conventional KNN algorithm, the accuracy performance is comparable when using Polar distance for similarity measurement, while for the QKNN algorithm, it significantly outperforms the Euclidean distance in terms of classification accuracy. Furthermore, the Polar distance shows scalability and robustness superior to the Euclidean distance, providing an opportunity for the large-scale application of QKNN in practice.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
These authors contributed equally to this work.
ISSN:1099-4300
1099-4300
DOI:10.3390/e25010127