東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Structured gradient boosting.

Parker, Charles.

FindBook

Google Book

Amazon

博客來

Structured gradient boosting.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Structured gradient boosting./
作者:	Parker, Charles.
面頁冊數:	156 p.
附註:	Source: Dissertation Abstracts International, Volume: 68-09, Section: B, page: 6056.
Contained By:	Dissertation Abstracts International68-09B.
標題:	Artificial Intelligence. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3282386
ISBN:	9780549244882

Structured gradient boosting.
Parker, Charles.

Structured gradient boosting. - 156 p.

Source: Dissertation Abstracts International, Volume: 68-09, Section: B, page: 6056.

Thesis (Ph.D.)--Oregon State University, 2007.

The goal of many machine learning problems can be formalized as the creation of a function that can properly classify an input vector, given a set of examples of that function. While this formalism has produced a number of success stories, there are notable situations in which it fails. One such situation arises when the class labels are composed of multiple variables, each of which may be correlated with all or part of the input or output vectors. Such problems, known as structured prediction problems, are common in the fields of information retrieval, computational linguistics, and computer vision, among others. In this dissertation, I will discuss structured prediction problems and some of the previous approaches to solving them. I will then present a new algorithm, structured gradient boosting, that combines strong points of previous approaches while retaining their generality. More specifically, the algorithm will combine some of the notions of margin maximization present in support vector methods with the speed and flexibility of the structured perceptron algorithm. Finally, I will show a number of novel ways in which this algorithm can be applied effectively, highlighting applications in learning by demonstration and music information retrieval.

ISBN: 9780549244882Subjects--Topical Terms:

769149
Artificial Intelligence.

Structured gradient boosting.
LDR:02021nam 2200253 a 45 001 958944
005 20110704
008 110704s2007 ||||||||||||||||| ||eng d
020 $a 9780549244882
035 $a (UMI)AAI3282386
035 $a AAI3282386
040 $a UMI $c UMI
100 1 $a Parker, Charles. $3 1282411
245 1 0 $a Structured gradient boosting.
300 $a 156 p.
500 $a Source: Dissertation Abstracts International, Volume: 68-09, Section: B, page: 6056.
502 $a Thesis (Ph.D.)--Oregon State University, 2007.
520 $a The goal of many machine learning problems can be formalized as the creation of a function that can properly classify an input vector, given a set of examples of that function. While this formalism has produced a number of success stories, there are notable situations in which it fails. One such situation arises when the class labels are composed of multiple variables, each of which may be correlated with all or part of the input or output vectors. Such problems, known as structured prediction problems, are common in the fields of information retrieval, computational linguistics, and computer vision, among others. In this dissertation, I will discuss structured prediction problems and some of the previous approaches to solving them. I will then present a new algorithm, structured gradient boosting, that combines strong points of previous approaches while retaining their generality. More specifically, the algorithm will combine some of the notions of margin maximization present in support vector methods with the speed and flexibility of the structured perceptron algorithm. Finally, I will show a number of novel ways in which this algorithm can be applied effectively, highlighting applications in learning by demonstration and music information retrieval.
590 $a School code: 0172.
650 4 $a Artificial Intelligence. $3 769149
650 4 $a Computer Science. $3 626642
690 $a 0800
690 $a 0984
710 2 $a Oregon State University. $3 625720
773 0 $t Dissertation Abstracts International $g 68-09B.
790 $a 0172
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3282386