Authors : R. Kalai Selvi; G. Malathy

Volume/Issue : Volume 10 - 2025, Issue 1 - January

Google Scholar : https://tinyurl.com/yu5nzvn4

Scribd : https://tinyurl.com/r4a5u57z

DOI : https://doi.org/10.5281/zenodo.14890846

Abstract : With the increasing complexity and size of data in machine learning (ML) and artificial intelligence (AI) applications, efficient data structures have become critical for enhancing performance, scalability, and memory management. Traditional data structures often fail to meet the specific requirements of modern ML and AI algorithms, particularly in terms of speed, flexibility, and storage efficiency. This paper explores recent innovations in data structures tailored for ML and AI tasks, including dynamic data structures, compressed storage techniques, and specialized graph- based structures. We present a detailed review of advanced data structures such as KD-trees, hash maps, Bloom filters, sparse matrices, and priority queues, and how they contribute to the performance improvements in common AI applications like deep learning, reinforcement learning, and large-scale data analysis. Furthermore, we propose a new hybrid data structure that combines the strengths of multiple existing structures to address challenges related to real-time processing, memory constraints, and high-dimensional data.

Keywords : Data Structures, Machine Learning, Artificial Intelligence, Performance Optimization, Hybrid Data Structures, Graph- Based Structures, Real-Time Processing, Memory Management.

References :

1. Chou, J. & Geng, J. (2019). "Efficient sparse matrix factorization in machine learning applications." IEEE Transactions on Neural Networks and Learning Systems, 30(12), 3817-3826.
2. Aho, A.V., & Corasick, M. (1975). "Efficient string matching: An aid to bibliographic search." ACM SIGCOMM Computer Communication Review, 6(2), 71–72.
3. Broder, A.Z., & Mitzenmacher, M. (2004). "Network Applications of Bloom Filters: A Survey." Internet Mathematics, 1(4), 485-509.
4. Gagie, T., & Ibarra, O. (2007). "Efficient Range Queries in Dynamic Data Structures." IEEE Transactions on Computers, 56(3), 417–424
5. Kipf, T.N., & Welling, M. (2017). "Semi-supervised classification with graph convolutional networks." Proceedings of the International Conference on Learning Representations (ICLR).
6. Weinberger, K.Q., Blitzer, J., & Saul, L.K. (2009). "Feature Hashing for Large-Scale Multitask Learning." Proceedings of the 26th Annual International Conference on Machine Learning (ICML), 1113-1120.
7. Pugh, W. (1990). "Skip lists: A probabilistic alternative to balanced trees." Communications of the ACM, 33(6), 668-676.
8. Koller, D., & Friedman, N. (2009). Probabilistic Graphical Models: Principles and Techniques. MIT Press.
9. Zhang, J., & Khoshgoftaar, T.M. (2019). "A survey of data structures and algorithms for scalable machine learning." IEEE Access, 7, 15379-15398.
10. Cormen, T.H., Leiserson, C.E., Rivest, R.L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press.