Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Other literature type . 2025
License: CC BY
Data sources: ZENODO
ZENODO
Other literature type . 2025
License: CC BY
Data sources: Datacite
ZENODO
Other literature type . 2025
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

Computational Trade-offs Between Traditional Algorithms and Machine Learning Models: A Time Complexity Perspective

Authors: S. Sivagurunathan, Sudhaman Parthasarathy;

Computational Trade-offs Between Traditional Algorithms and Machine Learning Models: A Time Complexity Perspective

Abstract

Abstract: A fundamental distinction exists between the time complexity of traditional algorithms and machine learning (ML) algorithms. Traditional algorithms are used to solve specific problems by following a set of instructions. Machine learning algorithms are created to extract knowledge from data and apply what they have learned to new, unobserved data. In this research work, we find that there are dissimilar time complexity features between traditional algorithms and machine learning algorithms and therefore we suggest that their evaluation criteria should differ from each other while we perform an efficiency analysis of traditional algorithms and machine learning algorithms. We distinguish this research work from prior related research works by examining the relative performance of machine learning models and traditional algorithms in terms of training and inference time. Keywords: Time complexity, machine learning, algorithms, efficiency analysis.

Keywords

Time complexity, machine learning, algorithms, efficiency analysis.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green