|
| volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 1 van 8 gevonden artikelen
| Titel: |
Comparative Analysis of Serial Decision Tree Classification Algorithms |
| Auteur: |
Matthew Nwokejizie Anyanwu Sajjan Shiva |
| Verschenen in: |
International journal of computer science and security |
| Paginering: | Jaargang 3 (2009) nr. 3 pagina's 230-240 |
| Jaar: |
2009 |
| Inhoud: |
Classification of data objects based on a predefined knowledge of the objects is a data mining and knowledge management technique used in grouping similar data objects together. It can be defined as supervised learning algorithms as it assigns class labels to data objects based on the relationship between the data items with a pre-defined class label. Classification algorithms have a wide range of applications like churn prediction, fraud detection, artificial intelligence, and credit card rating etc. Also there are many classification algorithms available in literature but decision trees is the most commonly used because of its ease of implementation and easier to understand compared to other classification algorithms. Decision Tree classification algorithm can be implemented in a serial or parallel fashion based on the volume of data, memory space available on the computer resource and scalability of the algorithm. In this paper we will review the serial implementations of the decision tree algorithms, identify those that are commonly used. We will also use experimental analysis based on sample data records (Statlog data sets) to evaluate the performance of the commonly used serial decision tree algorithms |
| Uitgever: |
Computer Science Journals (provided by DOAJ) |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 1 van 8 gevonden artikelen
| volgende >> |
Toegankelijkheidsverklaring