Volume 26 • Issue 4 • PP: 42-49 • 2025
A Neutrosophic Interpretation of Data Cube Sparsity for Improved Machine Learning Preprocessing
Open Access & Copyright
© 2025 The Author(s). Published by ASPG. This article is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
View PDF Abstract
Multidimensional data cubes are essential components in data warehouses, enabling rich, OLAP-based analysis across dimensions such as time, location, and product category. However, the complexity that supports such analytical flexibility often leads to extreme sparsity—where the majority of cube cells remain empty or only partially filled. This sparsity can hinder the performance of downstream machine learning models, especially when valuable but infrequent patterns are lost during preprocessing. This paper introduces a neutrosophic-based framework for evaluating and managing sparse regions within OLAP cubes. Instead of treating all sparsity as noise, we propose a typology that distinguishes between three forms: semantic sparsity (expected and justifiable absences), non-informative sparsity (regions with little analytical value), and informative sparsity (sparse areas that still carry meaningful insights). Each substructure is modeled using neutrosophic logic, which assigns degrees of truth, indeterminacy, and falsity to reflect its analytical potential. A dedicated Neutrosophic Evaluation Algorithm is developed to classify each region using metrics such as semantic confidence, entropy, and a context-aware informativeness score. These metrics allow for nuanced decisions: preserving informative sparsity, eliminating irrelevant regions, and flagging ambiguous areas for further review. This approach shows how neutrosophic logic can offer a novel and effective way to handle sparsity in OLAP cubes, improving the relevance and robustness of machine learning pipelines trained on multidimensional data.
Keywords
References
[1] H. Kang, S. Kim, and J. Lee, "A Study on Sparse OLAP Data and Its Query Processing," Journal of Database Management, vol. 14, no. 3, pp. 54-67, 2003.
[2] T. Niemi, J. Nummenmaa, and P. Thanisch, "Logical design of data warehouses and OLAP cubes," Information Systems, vol. 27, no. 5, pp. 283-303, 2002.
[3] T. Niemi, J. Nummenmaa, and P. Thanisch, "Schema design for data cubes and OLAP operations," Data & Knowledge Engineering, vol. 53, no. 3, pp. 263-294, 2005.
[4] K. Kaloyanova and I. Naydenova, "A novel Regular Sparsity Map approach to manage OLAP cube sparsity," Computer Science and Information Systems, vol. 8, no. 2, pp. 383–402, 2011.
[5] W. Abdelbaki and I. Zaiem, "Neural-Based Approach for Prediction over Sparse Data Cubes (NAP-SC)," International Journal of Data Science and Analytics, vol. 17, no. 2, pp. 120–138, 2023.
[6] C. Yang, Z. Lin, and H. Han, "Dimensional Data Prediction in Data Warehouses Using Hierarchical KNN Imputation," Information Systems, vol. 89, p. 101480, 2020.
[7] S. Bimonte, Y. Song, and Y. Wu, "Managing Missing Values in OLAP Cubes Using Aggregation and Linear Programming," Information Sciences, vol. 281, pp. 161–174, 2014.
[8] F. Smarandache, A Unifying Field in Logics: Neutrosophic Logic, American Research Press, 1999.
[9] A. Smith and B. Johnson, "Data Privacy in Cloud Computing: Challenges and Solutions," Journal of Computer Security, vol. 28, no. 1, pp. 15-30, 2021. doi: 10.3233/JCS-210123.
[10] M. T. Nguyen and R. Patel, "Machine Learning Techniques for Predictive Maintenance in Manufacturing: A Review," Journal of Manufacturing Systems, vol. 58, pp. 210-220, 2022. doi: 10.1016/j.jmsy.2022.02.005.
[11] L. Chen, K. Wang, and H. Liu, "Blockchain Technology in Supply Chain Management: A Review," International Journal of Production Research, vol. 60, no. 5, pp. 1465-1480, 2022. doi: 10.1080/00207543.2021.2002748.
Cite This Article
Choose your preferred format
Publisher's Note
The statements, opinions, and data presented in this article are solely those of the author(s) and do not necessarily represent those of ASPG, the journal, or its editors. ASPG and the editors disclaim responsibility for any harm arising from the use of any ideas, methods, instructions, or products described in this article, to the fullest extent permitted by applicable law.