Quantum Relief algorithm

• Published in: Quantum information processing Vol. 17; no. 10; pp. 1 - 15
• Main Authors: Liu, Wen-Jie, Gao, Pei-Pei, Yu, Wen-Bin, Qu, Zhi-Guo, Yang, Ching-Nung
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.10.2018; Springer Nature B.V
• Subjects: Algorithms; Complexity; Computer simulation; Computing time; Data Structures and Information Theory; Mathematical Physics; Physics; Physics and Astronomy; Quantum Computing; Quantum Information Technology; Quantum Physics; Similarity; Spintronics; Weight; Feature selection; Rotation operation; Quantum Relief algorithm; IBM Q; CMP operation; Swap test
• ISSN: 1570-0755; 1573-1332
• DOI: 10.1007/s11128-018-2048-x

Relief algorithm is a feature selection algorithm used in binary classification proposed by Kira and Rendell, and its computational complexity remarkably 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 CMP and rotation operations, then the swap test and measurement are applied on this state to get the similarity between two samples. After that, Near-hit and Near-miss are obtained by calculating the maximal similarity, and further applied to update the feature weight vector WT to get WT ¯ 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 O(M) , while the complexity of the original Relief algorithm is O(NM) , where N is the number of features for each sample, and M is the size of the sample set. Obviously, our quantum Relief algorithm has superior acceleration than the classical one.