Computational Complexity and Analysis of Supervised Machine Learning Algorithms

被引:8
作者
Singh, Jarnail [1 ]
机构
[1] Chandigarh Univ, Univ Inst Comp, Mohali, Punjab, India
来源
NEXT GENERATION OF INTERNET OF THINGS | 2023年 / 445卷
关键词
Time and space complexity; Linear regression; Logistic regression; SVM; Decision tree; KNN;
D O I
10.1007/978-981-19-1412-6_16
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Data is generated at a much faster pace, and it is increasing exponentially day by day. Machine learning methods are being used to extract patterns and trends from data to streamline different business activities for more profit with fewer resources. Machine learning models need to be trained with lots of data before being deployed for predictive analysis (Lecture notes in Computer Science, 2012 [1]). Training time depends upon the complexity of an algorithm. We are analyzing the space and time complexity of various machine learning algorithms so that it becomes easier to select and deploy the most efficient and appropriate model for a particular dataset. This research work primarily focuses on data analytics for supervised machine learning algorithms in industrial research domains.
引用
收藏
页码:195 / 206
页数:12
相关论文
共 16 条
  • [1] analytica.com/, US
  • [2] [Anonymous], 2004, Logistic Regression for Data Mining and HighDimensional Classification
  • [3] [Anonymous], 2012, Big O Notation
  • [4] [Anonymous], 2012, Lecture Notes in Computer Science, V2nd
  • [5] [Anonymous], BIG NOTATION INTERVI
  • [6] Big O notation, 2015, WIKIPEDIA FREE E
  • [7] Goodfellow I, 2016, ADAPT COMPUT MACH LE, P1
  • [8] Reducing the dimensionality of data with neural networks
    Hinton, G. E.
    Salakhutdinov, R. R.
    [J]. SCIENCE, 2006, 313 (5786) : 504 - 507
  • [9] kdnuggets.com, US
  • [10] Ke GL, 2017, ADV NEUR IN, V30