Quantum Relief algorithm
From MaRDI portal
Publication:1994722
Abstract: Relief algorithm is a feature selection algorithm used in binary classification proposed by Kira and Rendell, and its computational complexity remarkable increases with both the scale of samples and the number of features. In order to reduce the complexity, a quantum feature selection algorithm based on Relief algorithm, also called quantum Relief algorithm, is proposed. In the algorithm, all features of each sample are superposed by a certain quantum state through the emph{CMP} and emph{rotation} operations, then the emph{swap test} and measurement are applied on this state to get the similarity between two samples. After that, emph{Near-hit} and emph{Near-miss} are obtained by calculating the maximal similarity, and further applied to update the feature weight vector to get that determine the relevant features with the threshold . In order to verify our algorithm, a simulation experiment based on IBM Q with a simple example is performed. Efficiency analysis shows the computational complexity of our proposed algorithm is emph{O(M)}, while the complexity of the original Relief algorithm is emph{O(NM)}, where is the number of features for each sample, and is the size of the sample set. Obviously, our quantum Relief algorithm has superior acceleration than the classical one.
Recommendations
- Quantum-based feature selection for multiclassification problem in complex systems with edge computing
- Quantum-enhanced feature selection with forward selection and backward elimination
- Quantum \(K\) nearest neighbor algorithm
- Quantum \(K\)-nearest neighbor classification algorithm based on Hamming distance
- Quantum algorithm for \(k\)-nearest neighbors classification based on the metric of Hamming distance
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 1196643 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Computational Methods of Feature Selection
- Equivalences and Separations Between Quantum and Classical Learnability
- Foundations of machine learning
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum adiabatic machine learning
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
Cited in
(11)- A relative uncertainty measure for fuzzy rough feature selection
- Continuous variable quantum steganography protocol based on quantum identity
- Effects of quantum noises on \(\chi\) state-based quantum steganography protocol
- Quantum algorithm for classical multidimensional scaling
- A unitary operator construction solution based on Pauli group for maximal dense coding with a class of symmetric states
- Quantum transport on large-scale sparse regular networks by using continuous-time quantum walk
- Synthesis of Deutsch-Jozsa circuits and verification by IBM Q
- Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms
- Quantum-based feature selection for multiclassification problem in complex systems with edge computing
- Quantum privacy-preserving price E-negotiation
- An efficient quantum private query protocol based on oracle and Grover iteration
This page was built for publication: Quantum Relief algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994722)
