Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/70626
題名: | A Dynamic Discretization Approach for Constructing Decision Trees with a Continuous Label | 作者: | 唐揆 Tang, Kwei |
貢獻者: | 企管系 | 關鍵詞: | Decision trees; data mining; classification | 日期: | 2009 | 上傳時間: | 16-Oct-2014 | 摘要: | In traditional decision (classification) tree algorithms, the label is assumed to be a categorical (class) variable. When the label is a continuous variable in the data, two possible approaches based on existing decision tree algorithms can be used to handle the situations. The first uses a data discretization method in the preprocessing stage to convert the continuous label into a class label defined by a finite set of nonoverlapping intervals and then applies a decision tree algorithm. The second simply applies a regression tree algorithm, using the continuous label directly. These approaches have their own drawbacks. We propose an algorithm that dynamically discretizes the continuous label at each node during the tree induction process. Extensive experiments show that the proposed method outperforms the preprocessing approach, the regression tree approach, and several nontree-based algorithms. | 關聯: | IEEE Transactions on Knowledge and Data Engineering, 21(11), 1505-1514 | 資料類型: | article | DOI: | http://dx.doi.org/10.1109/TKDE.2009.24 |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
15051514.pdf | 2.81 MB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.