Decision Trees in Large Data Sets
[ X ]
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Data mining is the process of obtaining information, which is used to identify and define the relationships between data of different qualities. One of the important problems encountered in this process is the classification process in large data sets. Extensive research has been done to find solutions to this classification problem and different solution methods have been introduced. Some decision tree algorithms are among the structures that can be used effectively in this field. In this article, various decision tree structures and algorithms used for classification process in large data sets are discussed. Along with the definitions of the algorithms, the similarities and existing differences between them were determined, their advantages and disadvantages were investigated. Key Words
Açıklama
Anahtar Kelimeler
Bilgisayar Bilimleri, Yazılım Mühendisliği, Matematik, İstatistik ve Olasılık
Kaynak
Uluslararası Mühendislik Araştırma ve Geliştirme Dergisi
WoS Q Değeri
Scopus Q Değeri
Cilt
13
Sayı
1
