東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Constructive and destructive optimiz...

Zhang, Yi.

FindBook

Google Book

Amazon

博客來

Constructive and destructive optimization methods for predictive ensemble learning.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Constructive and destructive optimization methods for predictive ensemble learning./
作者:	Zhang, Yi.
面頁冊數:	119 p.
附註:	Adviser: Nick Street.
Contained By:	Dissertation Abstracts International67-08A.
標題:	Artificial Intelligence. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3229717
ISBN:	9780542833946

Constructive and destructive optimization methods for predictive ensemble learning.
Zhang, Yi.

Constructive and destructive optimization methods for predictive ensemble learning. - 119 p.

Adviser: Nick Street.

Thesis (Ph.D.)--The University of Iowa, 2006.

An ensemble is a group of classifiers that jointly solve a classification problem. Both theoretical and empirical findings support that an ensemble will often outperform a single classifier. In addition, the ensemble learning framework provides tools to tackle complicated or large problems that were once infeasible for traditional algorithms. The key issue of ensemble learning is how to create a relatively small-sized ensemble with a good bias and variance trade-off. Currently, there are two general approaches to achieve that goal: constructive building, e.g. bagging and boosting, and destructive pruning, e.g. Kappa pruning. Two new ensemble algorithms, bagging with adaptive cost (bacing) and semi-definite-programming (SDP)-based pruning, are proposed in this dissertation. By iteratively changing the weights of the training points, bacing is able to focus on the boundary points that the current ensemble barely predicts right or wrong so that the margins on these "difficult" points can be maximized. SDP-based pruning, on the other hand, attempts to pick a subset of classifiers from an existing ensemble to improve the effectiveness and the efficiency of the ensemble. Along with standard computational experiments that compare these two algorithms with other peer algorithms on a variety of datasets, several new problems are used to demonstrate the capabilities of the new algorithms. Specifically, bacing is applied to point-wise lift curve optimization. SDP-based pruning is evaluated in the classifier sharing scenario, where classifiers from different but related problem domains are pooled, and a subset of them are selected for each domain. The effect of classifier sharing under the condition of data scarcity is also studied. Our results indicate that bacing outperforms bagging and boosting, and a variation of bacing is able to marginally improve targeted points on a lift curve. SDP-based pruning is also ahead of its peer algorithms in terms of accuracy. Its application in the classifier sharing scenario substantially improves the effectiveness and robustness of the selected ensembles.

ISBN: 9780542833946Subjects--Topical Terms:

769149
Artificial Intelligence.

Constructive and destructive optimization methods for predictive ensemble learning.
LDR:03017nam 2200289 a 45 001 967980
005 20110915
008 110915s2006 eng d
020 $a 9780542833946
035 $a (UMI)AAI3229717
035 $a AAI3229717
040 $a UMI $c UMI
100 1 $a Zhang, Yi. $3 1029786
245 1 0 $a Constructive and destructive optimization methods for predictive ensemble learning.
300 $a 119 p.
500 $a Adviser: Nick Street.
500 $a Source: Dissertation Abstracts International, Volume: 67-08, Section: A, page: 3073.
502 $a Thesis (Ph.D.)--The University of Iowa, 2006.
520 $a An ensemble is a group of classifiers that jointly solve a classification problem. Both theoretical and empirical findings support that an ensemble will often outperform a single classifier. In addition, the ensemble learning framework provides tools to tackle complicated or large problems that were once infeasible for traditional algorithms. The key issue of ensemble learning is how to create a relatively small-sized ensemble with a good bias and variance trade-off. Currently, there are two general approaches to achieve that goal: constructive building, e.g. bagging and boosting, and destructive pruning, e.g. Kappa pruning. Two new ensemble algorithms, bagging with adaptive cost (bacing) and semi-definite-programming (SDP)-based pruning, are proposed in this dissertation. By iteratively changing the weights of the training points, bacing is able to focus on the boundary points that the current ensemble barely predicts right or wrong so that the margins on these "difficult" points can be maximized. SDP-based pruning, on the other hand, attempts to pick a subset of classifiers from an existing ensemble to improve the effectiveness and the efficiency of the ensemble. Along with standard computational experiments that compare these two algorithms with other peer algorithms on a variety of datasets, several new problems are used to demonstrate the capabilities of the new algorithms. Specifically, bacing is applied to point-wise lift curve optimization. SDP-based pruning is evaluated in the classifier sharing scenario, where classifiers from different but related problem domains are pooled, and a subset of them are selected for each domain. The effect of classifier sharing under the condition of data scarcity is also studied. Our results indicate that bacing outperforms bagging and boosting, and a variation of bacing is able to marginally improve targeted points on a lift curve. SDP-based pruning is also ahead of its peer algorithms in terms of accuracy. Its application in the classifier sharing scenario substantially improves the effectiveness and robustness of the selected ensembles.
590 $a School code: 0096.
650 4 $a Artificial Intelligence. $3 769149
650 4 $a Business Administration, Management. $3 626628
650 4 $a Information Science. $3 1017528
690 $a 0454
690 $a 0723
690 $a 0800
710 2 0 $a The University of Iowa. $3 1017439
773 0 $t Dissertation Abstracts International $g 67-08A.
790 $a 0096
790 1 0 $a Street, Nick, $e advisor
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3229717