Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Masters Theses
  5. Online Machine Learning Algorithms Review and Comparison in Healthcare
Details

Online Machine Learning Algorithms Review and Comparison in Healthcare

Date Issued
December 15, 2018
Author(s)
Jagirdar, Nikhil Mukund
Advisor(s)
Xueping Li
Additional Advisor(s)
Jamie Coble
John Kobza
Permanent URI
https://trace.tennessee.edu/handle/20.500.14382/41630
Abstract

Currently, the healthcare industry uses Big Data for essential patient care information. Electronic Health Records (EHR) store massive data and are continuously updated with information such as laboratory results, medication, and clinical events. There are various methods by which healthcare data is generated and collected, including databases, healthcare websites, mobile applications, wearable technologies, and sensors. The continuous flow of data will improve healthcare service, medical diagnostic research and, ultimately, patient care. Thus, it is important to implement advanced data analysis techniques to obtain more precise prediction results.Machine Learning (ML) has acquired an important place in Big Healthcare Data (BHD). ML has the capability to run predictive analysis, detect patterns or red flags, and connect dots to enhance personalized treatment plans. Because predictive models have dependent and independent variables, ML algorithms perform mathematical calculations to find the best suitable mathematical equations to predict dependent variables using a given set of independent variables. These model performances depend on datasets and response, or dependent, variable types such as binary or multi-class, supervised or unsupervised.The current research analyzed incremental, or streaming or online, algorithm performance with offline or batch learning (these terms are used interchangeably) using performance measures such as accuracy, model complexity, and time consumption. Batch learning algorithms are provided with the specific dataset, which always constrains the size of the dataset depending on memory consumption. In the case of incremental algorithms, data arrive sequentially, which is determined by hyperparameter optimization such as chunk size, tree split, or hoeffding bond. The model complexity of an incremental learning algorithm is based on a number of parameters, which in turn determine memory consumption.

Subjects

online machine learni...

predictive model

big healthcare data

incremental learning

online random forest

Learn++

Adaptive boosting

incremental random fo...

Hoeffding tree

batch learning

Degree
Master of Science
Major
Industrial Engineering
File(s)
Thumbnail Image
Name

utkirtd_11120.pdf

Size

1.02 MB

Format

Adobe PDF

Checksum (MD5)

8b03f4a799af2882fb1046ed0b993057

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
  • Contact
  • Libraries at University of Tennessee, Knoxville
Repository logo COAR Notify