Affiliation:
1. Department of Electrical and Information Engineering Politecnico di Bari , Bari , Italy
Abstract
Abstract
The popularity of artificial intelligence applications is on the rise, and they are producing better outcomes in numerous fields of research. However, the effectiveness of these applications relies heavily on the quantity and quality of data used. While the volume of data available has increased significantly in recent years, this does not always lead to better results, as the information content of the data is also important. This study aims to evaluate a new data preprocessing technique called semi-pivoted QR (SPQR) approximation for machine learning. This technique is designed for approximating sparse matrices and acts as a feature selection algorithm. To the best of our knowledge, it has not been previously applied to data preprocessing in machine learning algorithms. The study aims to evaluate the impact of SPQR on the performance of an unsupervised clustering algorithm and compare its results to those obtained using principal component analysis (PCA) as the preprocessing algorithm. The evaluation is conducted on various publicly available datasets. The findings suggest that the SPQR algorithm can produce outcomes comparable to those achieved using PCA without altering the original dataset.
Reference34 articles.
1. G. Tufféry, “Factor analysis,” in Data mining and statistics for decision making, Wiley, 2011, pp. 175–180.
2. G. W. Stewart, “Four algorithms for the efficient computation of truncated pivoted QR approximations to a sparse matrix,” Numer. Math., vol. 83, pp. 313–323, 1999.
3. M. Popolizio, A. Amato, V. Piuri, and V. Di Lecce, “Improving Classification Performance Using The Semi-Pivoted QR approximation algorithm,” In 2nd FICR International Conference on Rising Threats in Expert Applications and Solutions. 7–8 January 2022.
4. D. Dua and C. Graff, UCI machine learning repository. Irvine, CA: University of California, School of Information and Computer Science, 2019. http://archive.ics.uci.edu/ml
5. C. Boutsidis, J. Sun, and N. Anerousis, “Clustered subset selection and its applications on it service metrics,” Proceedings of the 17th ACM conference on Information and knowledge management (CIKM ‘08). New York, NY, USA: Association for Computing Machinery, 2008, pp. 599–608. 10.1145/1458082.1458162.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献