Classifiability-Based Omnivariate Decision Trees  

Oleh:

Li, Yuanhong ; Dong, Ming ; Kothari, R.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 16 no. 6 (Nov. 2005), page 1547-1560.
Topik: DECISION TREES; classifiability - based; omnivariate; decision tree

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Top - down induction of decision trees is a simple and powerful method of pattern classification. In a decision tree, each node partitions the available patterns into two or more sets. New nodes are created to handle each of the resulting partitions and the process continues. A node is considered terminal if it satisfies some stopping criteria (for example, purity, i. e., all patterns at the node are from a single class). Decision trees may be univariate, linear multivariate, or nonlinear multivariate depending on whether a single attribute, a linear function of all the attributes, or a non linear function of all the attributes is used for the partitioning at each node of the decision tree. Though non linear multivariate decision trees are the most powerful, they are more susceptible to the risks of overfitting. In this paper, we propose to perform model selection at each decision node to build omnivariate decision trees. The model selection is done using a novel classifiability measure that captures the possible sources of misclassification with relative ease and is able to accurately reflect the complexity of the subproblem at each node. The proposed approach is fast and does not suffer from as high a computational burden as that incurred by typical model selection algorithms. Empirical results over 26 data sets indicate that our approach is faster and achieves better classification accuracy compared to statistical model select algorithms.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali