A Quantum-inspired Version of the Classification Problem

被引:20
|
作者
Sergioli, Giuseppe [1 ]
Bosyk, Gustavo Martin [2 ]
Santucci, Enrica [1 ]
Giuntini, Roberto [1 ]
机构
[1] Univ Cagliari, Via Is Mirrionis 1, I-09123 Cagliari, Italy
[2] Consejo Nacl Invest Cient & Tecn, Inst Fis La Plata, Fac Ciencias Exactas, UNLP, RA-1900 La Plata, Buenos Aires, Argentina
关键词
Nearest mean classifier; Density operators; Rescaling invariance;
D O I
10.1007/s10773-017-3371-1
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We address the problem of binary classification by using a quantum version of the Nearest Mean Classifier (NMC). Our proposal is indeed an advanced version of previous one (see Sergioli et al. 2017 that i) is able to be naturally generalized to arbitrary number of features and ii) exhibits better performances with respect to the classical NMC for several datasets. Further, we show that the quantum version of NMC is not invariant under rescaling. This allows us to introduce a free parameter, i.e. the rescaling factor, that could be useful to get a further improvement of the classification performance.
引用
收藏
页码:3880 / 3888
页数:9
相关论文
共 50 条
  • [41] WAVELET SVM ENSEMBLE FOR PATTERN CLASSIFICATION WITH QUANTUM-INSPIRED EVOLUTIONARY ALGORITHM
    Luo, Zhi-Yong
    Zhang, Wen-Feng
    Ye, Bin-Yuan
    Cai, Lin-Qin
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON WAVELET ANALYSIS AND PATTERN RECOGNITION, VOLS 1 AND 2, 2008, : 485 - +
  • [42] Introduction to quantum-inspired intelligence
    Zak, Michail
    PHYSICS ESSAYS, 2010, 23 (01) : 14 - 27
  • [43] Quantum-inspired algorithms in practice
    Arrazola, Juan Miguel
    Delgado, Alain
    Bardhan, Bhaskar Roy
    Lloyd, Seth
    QUANTUM, 2020, 4
  • [44] A Hybrid Quantum-Inspired Evolutionary Algorithm for Open Vehicle Routing Problem
    Zhang, Jingling
    Zhao, Yanwei
    Peng, Dianjun
    Wang, Wanliang
    2009 IEEE/ASME INTERNATIONAL CONFERENCE ON ADVANCED INTELLIGENT MECHATRONICS, VOLS 1-3, 2009, : 839 - +
  • [45] A Quantum-Inspired Evolutionary Algorithm Based on P systems for Knapsack Problem
    Zhang, Ge-Xiang
    Gheorghe, Marian
    Wu, Chao-Zhong
    FUNDAMENTA INFORMATICAE, 2008, 87 (01) : 93 - 116
  • [46] A new quantum-inspired genetic algorithm for solving the travelling salesman problem
    Talbi, H
    Draa, A
    Batouche, M
    2004 IEEE International Conference on Industrial Technology (ICIT), Vols. 1- 3, 2004, : 1192 - 1197
  • [47] Quantum-inspired evolutionary algorithm for resources constrainted project scheduling problem
    Huang, Zhi-Yu
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2009, 15 (09): : 1779 - 1787
  • [48] Improved quantum-inspired evolutionary algorithm for lot size scheduling problem
    Sun, Di-Hua
    Xie, Jia
    Zhao, Min
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2010, 16 (08): : 1702 - 1707
  • [49] Quantum-Inspired Differential Evolution with Particle Swarm Optimization for Knapsack Problem
    Zouache, Djaafar
    Moussaoui, Abdelouahab
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2015, 31 (05) : 1757 - 1773
  • [50] Quantum-Inspired Estimation Of Distribution Algorithm To Solve The Travelling Salesman Problem
    Soloviev, Vicente P.
    Bielza, Concha
    Larranaga, Pedro
    2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 416 - 425