Empirical Analysis of Nature-Inspired Algorithms for Autism Spectrum Disorder Detection Using 3D Video Dataset

• URL: http://arxiv.org/abs/2501.01202v1
• Date: Thu, 02 Jan 2025 11:24:06 GMT
• Title: Empirical Analysis of Nature-Inspired Algorithms for Autism Spectrum Disorder Detection Using 3D Video Dataset
• Authors: Aneesh Panchal, Kainat Khan, Rahul Katarya,
• Abstract summary: Autism Spectrum Disorder (ASD) is a chronic neurodevelopmental disorder symptoms of which includes repetitive behaviour and lack of social and communication skills.<n>In this paper, we worked on a methodology for the detection of ASD from a 3-dimensional walking video dataset.<n>We deployed various combinationsalgorithms of classification algorithm and nature-inspired algorithms resulting in an outstanding classification accuracy of $100%$.
• Score: 5.5711773076846365
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Autism Spectrum Disorder (ASD) is a chronic neurodevelopmental disorder symptoms of which includes repetitive behaviour and lack of social and communication skills. Even though these symptoms can be seen very clearly in social but a large number of individuals with ASD remain undiagnosed. In this paper, we worked on a methodology for the detection of ASD from a 3-dimensional walking video dataset, utilizing supervised machine learning (ML) classification algorithms and nature-inspired optimization algorithms for feature extraction from the dataset. The proposed methodology involves the classification of ASD using a supervised ML classification algorithm and extracting important and relevant features from the dataset using nature-inspired optimization algorithms. We also included the ranking coefficients to find the initial leading particle. This selection of particle significantly reduces the computation time and hence, improves the total efficiency and accuracy for ASD detection. To evaluate the efficiency of the proposed methodology, we deployed various combinationsalgorithms of classification algorithm and nature-inspired algorithms resulting in an outstanding classification accuracy of $100\%$ using the random forest classification algorithm and gravitational search algorithm for feature selection. The application of the proposed methodology with different datasets would enhance the robustness and generalizability of the proposed methodology. Due to high accuracy and less total computation time, the proposed methodology will offer a significant contribution to the medical and academic fields, providing a foundation for future research and advancements in ASD diagnosis.

Related papers

• Survey on Algorithms for multi-index models [45.143425167349314]
  We review the literature on algorithms for estimating the index space in a multi-index model. The primary focus is on computationally efficient (polynomial-time) algorithms in Gaussian space, the assumptions under which consistency is guaranteed by these methods, and their sample complexity.
  arXiv  Detail & Related papers  (2025-04-07T18:50:11Z)
• Flip Learning: Weakly Supervised Erase to Segment Nodules in Breast Ultrasound [43.27869631032662]
  We introduce a novel learning-based WSS framework called Flip Learning, which relies solely on 2D/3D boxes for accurate segmentation. Multiple agents are employed to erase the target from the box to facilitate classification tag flipping, with the erased region serving as the predicted segmentation mask. Our method outperforms state-of-the-art WSS methods and foundation models, and achieves comparable performance as fully-supervised learning algorithms.
  arXiv  Detail & Related papers  (2025-03-26T16:20:02Z)
• Impact of Data Patterns on Biotype identification Using Machine Learning [38.321248253111776]
  This study investigates the contribution of data patterns on algorithm performance by leveraging synthetic brain morphometry data as an exemplar. SuStaIn failed to process datasets with more than 17 variables, highlighting computational inefficiencies. SmileGAN and SurrealGAN outperformed other algorithms in identifying variable-based disease patterns, but these patterns were not able to provide individual-level classification.
  arXiv  Detail & Related papers  (2025-03-15T09:44:00Z)
• Tighten The Lasso: A Convex Hull Volume-based Anomaly Detection Method [0.6144680854063939]
  We propose a novel anomaly detection algorithm based on the convex hull property of a dataset. Our algorithm computes the CH's volume as an increasing number of data points are removed from the dataset. We show that with a computationally cheap and simple check, one can detect datasets that are well-suited for the proposed algorithm.
  arXiv  Detail & Related papers  (2025-02-25T19:39:20Z)
• Utilizing Data Fingerprints for Privacy-Preserving Algorithm Selection in Time Series Classification: Performance and Uncertainty Estimation on Unseen Datasets [4.2193475197905705]
  We introduce a novel data fingerprint that describes any time series classification dataset in a privacy-preserving manner. By decomposing the multi-target regression problem, only our data fingerprints are used to estimate algorithm performance and uncertainty. Our approach is evaluated on the 112 University of California riverside benchmark datasets.
  arXiv  Detail & Related papers  (2024-09-13T08:43:42Z)
• Self-Supervised Time-Series Anomaly Detection Using Learnable Data Augmentation [37.72735288760648]
  We propose a learnable data augmentation-based time-series anomaly detection (LATAD) technique that is trained in a self-supervised manner. LATAD extracts discriminative features from time-series data through contrastive learning. As per the results, LATAD exhibited comparable or improved performance to the state-of-the-art anomaly detection assessments.
  arXiv  Detail & Related papers  (2024-06-18T04:25:56Z)
• Large Language Model-Enhanced Algorithm Selection: Towards Comprehensive Algorithm Representation [27.378185644892984]
  This paper introduces Large Language Models (LLMs) into algorithm selection for the first time. LLMs not only captures the structural and semantic aspects of the algorithm, but also demonstrates contextual awareness and library function understanding. The selected algorithm is determined by the matching degree between a given problem and different algorithms.
  arXiv  Detail & Related papers  (2023-11-22T06:23:18Z)
• Gauge-optimal approximate learning for small data classification problems [0.0]
  Small data learning problems are characterized by a discrepancy between the limited amount of response variable observations and the large feature space dimension. We propose the Gauge- Optimal Approximate Learning (GOAL) algorithm, which provides an analytically tractable joint solution to the reduction dimension, feature segmentation and classification problems. GOAL has been compared to other state-of-the-art machine learning (ML) tools on both synthetic data and challenging real-world applications from climate science and bioinformatics.
  arXiv  Detail & Related papers  (2023-10-29T16:46:05Z)
• Kernel-Based Distributed Q-Learning: A Scalable Reinforcement Learning Approach for Dynamic Treatment Regimes [37.06048335758881]
  We present a novel approach, a distributed Q-learning algorithm, for generating dynamic treatment regimes. We show that our algorithm outperforms both traditional linear Q-learning and commonly used deep Q-learning in terms of both prediction accuracy and computation cost.
  arXiv  Detail & Related papers  (2023-02-21T04:15:34Z)
• Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data [64.96984404868411]
  We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm. The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources. It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
  arXiv  Detail & Related papers  (2022-12-06T12:42:11Z)
• Deep Learning for Size and Microscope Feature Extraction and Classification in Oral Cancer: Enhanced Convolution Neural Network [30.343802446139186]
  Overfitting issue has been the reason behind deep learning technology not being successfully implemented in oral cancer images classification. The proposed system consists of Enhanced Convolutional Neural Network that uses an autoencoder technique to increase the efficiency of the feature extraction process.
  arXiv  Detail & Related papers  (2022-08-06T08:26:45Z)
• Correntropy-Based Logistic Regression with Automatic Relevance Determination for Robust Sparse Brain Activity Decoding [18.327196310636864]
  We introduce the correntropy learning framework into the automatic relevance determination based sparse classification model. We evaluate it on a synthetic dataset, an electroencephalogram (EEG) dataset, and a functional magnetic resonance imaging (fMRI) dataset.
  arXiv  Detail & Related papers  (2022-07-20T06:49:23Z)
• Interpolation-based Contrastive Learning for Few-Label Semi-Supervised Learning [43.51182049644767]
  Semi-supervised learning (SSL) has long been proved to be an effective technique to construct powerful models with limited labels. Regularization-based methods which force the perturbed samples to have similar predictions with the original ones have attracted much attention. We propose a novel contrastive loss to guide the embedding of the learned network to change linearly between samples.
  arXiv  Detail & Related papers  (2022-02-24T06:00:05Z)
• Performance Analysis of Fractional Learning Algorithms [32.21539962359158]
  It is unclear whether the proclaimed superiority over conventional algorithms is well-grounded or is a myth as their performance has never been extensively analyzed. In this article, a rigorous analysis of fractional variants of the least mean squares and steepest descent algorithms is performed. Their origins and consequences on the performance of the learning algorithms are discussed and swift ready-witted remedies are proposed.
  arXiv  Detail & Related papers  (2021-10-11T12:06:44Z)
• IVFS: Simple and Efficient Feature Selection for High Dimensional Topology Preservation [33.424663018395684]
  We propose a simple and effective feature selection algorithm to enhance sample similarity preservation. The proposed algorithm is able to well preserve the pairwise distances, as well as topological patterns, of the full data.
  arXiv  Detail & Related papers  (2020-04-02T23:05:00Z)
• Surrogate-assisted performance prediction for data-driven knowledge discovery algorithms: application to evolutionary modeling of clinical pathways [0.0]
  The paper proposes and investigates an approach for surrogate-assisted performance prediction of data-driven knowledge discovery algorithms. The approach is based on the identification of surrogate models for prediction of the target algorithm's quality and performance.
  arXiv  Detail & Related papers  (2020-04-02T16:49:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.