TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover

Journal of Discrete Mathematical Sciences and Cryptography

(Since 1998)
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

CiteScore 2025: 2.7 (Q1)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Discrete Mathematical Sciences and Cryptography
Open Access Research Article

Quantum-aided feature selection model – A quantum machine learning approach

* ,

* Corresponding author · click or hover a name for details

pp. 641–655Vol. 26Issue 3April 2023DOI: 10.47974/JDMSC-1735 Crossmark XML
Published Online:
01 Apr 2023
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-1735
Pages:
641–655

Abstract

The accuracy of information retrieval systems is measured by the relevancy of retrieved results as per the user’s query. Relevant results are presented by performing various methods viz. indexing and crawling and the output of these processes is the retrieved results that have to pass through the ranking process which is the central goal of information retrieval systems. The ranking is carried out through the classification or clustering of processed results which can include redundant and noisy features. The accuracy of classification or clusters for the ranking process can be maximized by removing noisy and duplicate features through the feature selection method. Although feature selection is an expensive computational process, after many decades, quantum computation tools are in use for many algorithms to implement realistic problems, particularly in the standard of Quantum Annealing. This paper focuses to prospect the standard of quantum computing in order to increase the quality of information classes through the feature selection method. The persuasiveness of the quantum approach is comparable to the classical process that focused on the reliability of quantum methodology from different perspectives.

Keywords

Information retrievalQuantum computingFeature selectionQuantum annealing

Subject Classifications

81-08 : Primary 20G42Secondary: 62J05

References

[1] Chen, P.S., A faceted approach to information retrieval. Journal of Information Optimization Sciences, 29(4): p. 631-658 (2008).
[2] Gupta, A. and S.A. Begum, Efficient multi-cluster feature selection on text data. Journal of Information Optimization Sciences, 40(8): p. 1583-1598 (2019).
[3] Arora, I. and A. Saha, ELM and KELM based software defect prediction using feature selection techniques. Journal of Information Optimization Sciences, 40(5): p. 1025-1045 (2019).
[4] Tang, H.-C., T.-L. Chao, and K.-H. Hsieh, A weighted ranking function for ranking triangular fuzzy numbers. Journal of Information Optimization Sciences, 33(1): p. 149-158 (2012).
[5] Marchesin, S., A. Purpura, and G. Silvello, Focal elements of neural information retrieval models. An outlook through a reproducibility study. Information Processing Management, 57(6): p. 102109 (2020).
[6] Bender, E.M., T. Gebru, A. McMillan-Major, and S. Shmitchell. On the Dangers of Stochastic Parrots: Can Language Models Be Too Big? in Proceedings of the 2021 ACM conference on fairness, accountability, and transparency (2021).
[7] Jain, A. and V. Jain, Sentiment classification of twitter data belonging to renewable energy using machine learning. Journal of Information Optimization Sciences, 40(2): p. 521-533 (2019).
[8] Kotsiantis, S.B., D. Kanellopoulos, and P.E. Pintelas, Data preprocessing for supervised leaning. International Journal of Computer Science, 1(2): p. 111-117 (2006).
[9] Pearson, K., LIII. On lines and planes of closest fit to systems of points in space. The London, Edinburgh, Dublin philosophical magazine journal of science, 2(11): p. 559-572 (1901).
[10] Ng, A.Y., On feature selection: learning with exponentially many irreverent features as training examples, Massachusetts Institute of Technology (1998).
[11] Blum, A.L. and P. Langley, Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1-2): p. 245-271 (1997).
[12] Motoda, H. and H. Liu, Feature selection, extraction and construction. Communication of IICM, 5(67-72): p. 2 (2002).
[13] Peng, H., F. Long, and C. Ding, Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. IEEE Transactions on pattern analysis machine intelligence, 27(8): p. 1226-1238 (2005).
[14] Miah, M., S.J. Miah, and S. Venkatraman, Blockchain: At a glance idea for information science researchers. Journal of Information Optimization Sciences, 42(7): p. 1589-1624 (2021).
[15] Chandrashekar, G. and F. Sahin, A survey on feature selection methods. Computers Electrical Engineering, 40(1): p. 16-28 (2014).
[16] Jović, A., K. Brkić, and N. Bogunović. A review of feature selection methods with applications. in 2015 38th international convention on information and communication technology, electronics and microelectronics (MIPRO). Ieee (2015).
[17] Nguyen, X.V., J. Chan, S. Romano, and J. Bailey. Effective global approaches for mutual information based feature selection. in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining (2014).
[18] Kshirsagar, D. and P. Agrawal, A study of feature selection methods for android malware detection. Journal of Information Optimization Sciences, 43(8): p. 2111-2120 (2022).
[19] Alsahaf, A., N. Petkov, V. Shenoy, and G. Azzopardi, A framework for feature selection through boosting. Expert Systems with Applications, 187: p. 115895 (2022).
[20] Glover, F., G. Kochenberger, and Y. Du, Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models. 4OR, 17: p. 335-371 (2019).
[21] Lucas, A., Ising formulations of many NP problems. Frontiers in Physics, 2: p. 5 (2014).
[22] Bauckhage, C., N. Piatkowski, R. Sifa, D. Hecker, and S. Wrobel. A QUBO Formulation of the k-Medoids Problem. in LWDA (2019).
[23] Willsch, D., M. Willsch, H. De Raedt, and K. Michielsen, Support vector machines on the D-Wave quantum annealer. Computer Physics Communications, 248: p. 107006 (2020).
[24] Carugno, C., M. Ferrari Dacrema, and P. Cremonesi, Evaluating the job shop scheduling problem on a D-wave quantum annealer. Scientific Reports, 12(1): p. 6539 (2022).
[25] Reshef, D., Y. Reshef, M. Mitzenmacher, and P. Sabeti, Equitability analysis of the maximal information coefficient, with comparisons. arXiv preprint arXiv:, (2013).
[26] Nagy, M. and S.G. Akl, Quantum computing: Beyond the limits of conventional computation. The International Journal of Parallel, Emergent Distributed Systems, 22(2): p. 123-135 (2007).
[27] Matsumori, T., M. Taki, and T. Kadowaki, Application of QUBO solver using black-box optimization to structural design for resonance avoidance. Scientific Reports, 12(1): p. 12143 (2022).
[28] Monburinon, N., P. Chertchom, T. Kaewkiriya, S. Rungpheung, S. Buya, and P. Boonpou. Prediction of prices for used car by using regression models. in 2018 5th International Conference on Business and Industrial Research (ICBIR). IEEE (2018).
[29] Stamatopoulos, N., D.J. Egger, Y. Sun, C. Zoufal, R. Iten, N. Shen, and S. Woerner, Option pricing using quantum computers. Quantum, 4: p. 291 (2020).
[30] Rodriguez-Lujan, I., C. Elkan, C. Santa Cruz Fernández, and R. Huerta, Quadratic programming feature selection. Journal of Machine Learning Research, (2010).
[31] Anand, R., D. Aggarwal, and V. Kumar, A comparative analysis of optimization solvers. Journal of Statistics Management Systems, 20(4): p. 623-635 (2017).
[32] Milne, A., M. Rounds, and P. Goddard, Optimal feature selection in credit scoring and classification using a quantum annealer. White Paper 1Qbit, (2017).
[33] Sharma, K.K., Quantum Adiabatic Feature Selection. arXiv preprint arXiv:.08732, (2019).
[34] Yarkoni, S., E. Raponi, T. Bäck, and S. Schmitt, Quantum annealing for industry applications: Introduction and review. Reports on Progress in Physics, (2022).
[35] Abdulghani, F.A. and N.A. Abdullah, Hybrid deep learning model for Arabic text classification based on mutual information. Journal of Information Optimization Sciences, 43(8): p. 1901-1908 (2022).
[36] Poonia, R.C. and M. Kalra, Bridging approaches to reduce the gap between classical and quantum computing. Journal of Information Optimization Sciences, 37(2): p. 279-283 (2016).
[37] Glover, F., G. Kochenberger, R. Hennig, and Y. Du, Quantum bridge analytics I: a tutorial on formulating and using QUBO models. Annals of Operations Research, 314(1): p. 141-183 (2022).
[38] Lo, C.-Y. and W.-C. Lee, The application of linear programming technologies to the optimization of conflict problems. Journal of Information Optimization Sciences, 26(3): p. 693-713 (2005).
[39] Mohanty, B. and T. Sahoo, Mutual information based objective model for assessment of visual quality. Journal of Information Optimization Sciences, 43(5): p. 1151-1166 (2022).
[40] Ross, B.C., Mutual information between discrete and continuous data sets. PloS one, 9(2): p. e87357 (2014).
[41] Singh, H., N. Misra, V. Hnizdo, A. Fedorowicz, and E. Demchuk, Nearest neighbor estimates of entropy. American Journal of Mathematical Management Sciences, 23(3-4): p. 301-321 (2003).
[42] Luedtke, A. and L. Tran, The generalized mean information coefficient. arXiv preprint arXiv:, (2013).
[43] Stefanov, S.M., On the solution of quadratic programming problem with a feasible region defined as a Minkowski sum of a compact set and finitely generated convex closed cone. Journal of Information Optimization Sciences, 39(6): p. 1223-1230 (2018).
[44] Freedman, D.A., Statistical models: theory and practice (2009) : cambridge university press.
[45] Breiman, L., J.H. Friedman, R. Olshen, and C. Stone, Classification Regression trees. Wadsworth, p. 23-32 (1984).
[46] Guyon, I., J. Weston, S. Barnhill, and V. Vapnik, Gene selection for cancer classification using support vector machines. Machine learning, 46: p. 389-422 (2002).
[47] Kramer, O. and O. Kramer, Scikit-learn. Machine learning for evolution strategies, p. 45-53 (2016).
[48] Pedregosa, F., G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, and V. Dubourg, Scikit-learn: Machine learning in Python. the Journal of Machine Learning Research, 12: p. 2825-2830 (2011).
[49] McKinney, W. Data structures for statistical computing in python. in Proceedings of the 9th Python in Science Conference (2010). Austin, TX.

Views: 167Downloads: 12Citations: 0