This Author published in this journals
All Journal Jurnal Gaussian
Muhammad Rosyid Abdurrahman
Unknown Affiliation

Published : 1 Documents
Articles

Found 1 Documents
Search

PEMBENTUKAN POHON KLASIFIKASI BINER DENGAN ALGORITMA QUEST (QUICK, UNBIASED, AND EFFICIENT STATISTICAL TREE) PADA DATA PASIEN LIVER Abdurrahman, Muhammad Rosyid; Ispriyanti, Dwi; Prahutama, Alan
Jurnal Gaussian Vol 3, No 4 (2014): Wisuda Periode Oktober 2014
Publisher : Jurusan Statistika UNDIP

Show Abstract | Original Source | Check in Google Scholar | Full PDF (327.994 KB)

Abstract

In this modern era of fast food commonly found that sometimes have chemical substances and the increasing number of motor vehicles that cause the uncontrolled circulation of air pollution that can affect the health of the human liver. To assist in analyzing the presence of liver disorders in humans can be used QUEST (Quick, Unbiased, and Efficient Statistical Tree) algorithm to classify the characteristics of the patients liver by liver function tests performed in clinical laboratories. QUEST construct rules to predict the class of an object from the values of predictor variables. The tree is constructed by partitioning the data by recuresively, where class and the values of the predictor variables of each observation in the data sample is known. Each partition is represented by a node in the tree. QUEST is one of the binary classification tree method. The results of the classification tree is formed, an important variable in classifying a person affected by liver disease or not, that is the variable Direct Bilirubin, Alkaline Phosphatase, Serum Glutamic Oxaloacetic Transaminase (SGOT), and age of the patient. Accuracy of the QUEST algorithm classifying liver patient data by 73,4 %. Keywords: binary classification trees, QUEST algorithm, liver patient data.