Emerging Trends in Data Structures for Modern Machine Learning Applications

[{“box”:0,”content”:”[if 992 equals=”Open Access”]

n

Open Access

n

[/if 992]n

n

Year : | Volume : | [if 424 equals=”Regular Issue”]Issue[/if 424][if 424 equals=”Special Issue”]Special Issue[/if 424] [if 424 equals=”Conference”][/if 424] : | Page : –

n

n

n

n

n

n

By

n

    n t

    [foreach 286]n

    n

    Ikvinderpal Singh, Sapandeep Kaur Dhillon

  1. [/foreach]

    n

n

n[if 2099 not_equal=”Yes”]n

    [foreach 286] [if 1175 not_equal=””]n t

  1. Assistant Professor, Assistant Professor, Department of Computer Science & Applications, TSGGS Khalsa College, Amritsar., Department of Computer Science, Guru Nanak Dev University, Amritsar., Punjab, Punjab, India, India
  2. n[/if 1175][/foreach]

[/if 2099][if 2099 equals=”Yes”][/if 2099]nn

n

Abstract

nIn the realm of machine learning, data structures play a pivotal role in facilitating efficient data manipulation, storage, and retrieval, thereby significantly impacting the performance and scalability of machine learning algorithms. In recent years, the field of machine learning has witnessed the emergence of novel data structures tailored to address scalability and efficiency challenges inherent in handling large-scale and high-dimensional data. This paper provides a look at the data preprocessing, data cleaning and feature extraction in machine learning using data structures. This paper explores three key emerging trends: tensor representations, sparse data structures, and graph-based neural networks, highlighting their potential to revolutionize modern machine learning applications. Furthermore, we discusseda case study of the Leveraging Emerging Data Structures in Healthcare Analytics.

n

n

n

Keywords: Machine Learning, Data Structures, Tensor Representations, Sparse Data Structures, Graph-Based Neural Networks

n[if 424 equals=”Regular Issue”][This article belongs to International Journal of Data Structure Studies(ijdss)]

n

[/if 424][if 424 equals=”Special Issue”][This article belongs to Special Issue under section in International Journal of Data Structure Studies(ijdss)][/if 424][if 424 equals=”Conference”]This article belongs to Conference [/if 424]

n

n

n

How to cite this article: Ikvinderpal Singh, Sapandeep Kaur Dhillon Emerging Trends in Data Structures for Modern Machine Learning Applications ijdss ; :-

n

How to cite this URL: Ikvinderpal Singh, Sapandeep Kaur Dhillon Emerging Trends in Data Structures for Modern Machine Learning Applications ijdss {cited };:-. Available from: https://journals.stmjournals.com/ijdss/article=/view=0

nn


nn[if 992 equals=”Open Access”] Full Text PDF Download[else] nvar fieldValue = “[user_role]”;nif (fieldValue == ‘indexingbodies’) {n document.write(‘Full Text PDF‘);n }nelse if (fieldValue == ‘administrator’) { document.write(‘Full Text PDF‘); }nelse if (fieldValue == ‘ijdss’) { document.write(‘Full Text PDF‘); }n else { document.write(‘ ‘); }n [/if 992] [if 379 not_equal=””]n

Browse Figures

n

n

[foreach 379]n

n[/foreach]n

nn

n

n[/if 379]n

n

References

n[if 1104 equals=””]n

[1] Datasets | Research | Canadian Institute for Cybersecurity | UNB . Www.unb.ca. 2023. Available from: https://www.unb.ca/cic/datasets/index.html ‌

[2] DDoS 2019 | Datasets | Research | Canadian Institute for Cybersecurity | UNB . Www.unb.ca. 2019. Available from: https://www.unb.ca/cic/datasets/ddos-2019.html ‌

[3] Ardabili SF, Mosavi A, Ghamisi P, Ferdinand F, Varkonyi-Koczy AR, Reuter U, Rabczuk T, Atkinson PM. Covid-19 outbreak prediction with machine learning. Algorithms. 2020 Oct 1;13(10):249.

[4] Boukerche A, Wang J. Machine learning-based traffic prediction models for intelligent transportation systems. Computer Networks. 2020 Nov 9;181:107530.

[5] Chollet F. Xception: Deep learning with depthwise separable convolutions. InProceedings of the IEEE conference on computer vision and pattern recognition 2017 (pp. 1251-1258).

[6] DATA STRUCTURES FOR MACHINE LEARNING. Engpaper.com. 2022 . Available from: https://www.engpaper.com/data-structures-for-machine-learning.htm ‌

[7]Harris CR, Millman KJ, Van Der Walt SJ, Gommers R, Virtanen P, Cournapeau D, Wieser E, Taylor J, Berg S, Smith NJ, Kern R. Array programming with NumPy. Nature. 2020 Sep 17;585(7825):357-62.

[8] Niemeyer J, Rottensteiner F, Soergel U. Contextual classification of lidar data and building object detection in urban areas. ISPRS journal of photogrammetry and remote sensing. 2014 Jan 1;87:152-65. [9] Kuang L, Hao F, Yang LT, Lin M, Luo C, Min G. A tensor-based approach for big data representation and dimensionality reduction. IEEE transactions on emerging topics in computing. 2014 Jun 12;2(3):280-91.

[10]Sadeghi M, Babaie-Zadeh M, Jutten C. Dictionary learning for sparse representation: A novel approach. IEEE Signal Processing Letters. 2013 Oct 9;20(12):1195-8.

[11] Allamanis M, Brockschmidt M, Khademi M. Learning to represent programs with graphs. arXiv preprint arXiv:1711.00740. 2017 Nov 1.

[12] Dettmers T, Minervini P, Stenetorp P, Riedel S. Convolutional 2d knowledge graph embeddings. InProceedings of the AAAI conference on artificial intelligence 2018 Apr 25 (Vol. 32, No. 1).

[13] Koniusz P, Wang L, Cherian A. Tensor representations for action recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2021 Aug 24;44(2):648-65.

[14] Hua C, Rabusseau G, Tang J. High-order pooling for graph neural networks with tensor decomposition. Advances in Neural Information Processing Systems. 2022 Dec 6;35:6021-33.

nn[/if 1104][if 1104 not_equal=””]n

    [foreach 1102]n t

  1. [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
  2. n[/foreach]

n[/if 1104]

nn


nn[if 1114 equals=”Yes”]n

n[/if 1114]

n

n

Subscription Review Article

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

Volume
[if 424 equals=”Regular Issue”]Issue[/if 424][if 424 equals=”Special Issue”]Special Issue[/if 424] [if 424 equals=”Conference”][/if 424]
Received February 16, 2024
Accepted February 19, 2024
Published

n

n

n

n

n

nn function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;n }n else { x.style.display = “Block”; }n }n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);n });n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);n });n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));n }n function currentSlide(n) {n showSlides((slideIndex = n));n }n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) { slideIndex = 1; }n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n”}]