國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁 到查詢結果 [ subject:"Ant algorithms." ]

切換: 標籤 | MARC模式 | ISBD

Decision tree and ensemble learning ...

Kozak, Jan.

Decision tree and ensemble learning based on ant colony optimization

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Decision tree and ensemble learning based on ant colony optimizationby Jan Kozak.
作者:	Kozak, Jan.
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	xi, 159 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Ant algorithms.
電子資源:	http://dx.doi.org/10.1007/978-3-319-93752-6
ISBN:	9783319937526$q(electronic bk.)

Decision tree and ensemble learning based on ant colony optimization
Kozak, Jan.

Decision tree and ensemble learning based on ant colony optimization[electronic resource] /by Jan Kozak. - Cham :Springer International Publishing :2019. - xi, 159 p. :ill., digital ;24 cm. - Studies in computational intelligence,v.7811860-949X ;. - Studies in computational intelligence ;v. 216..

Theoretical Framework -- Evolutionary Computing Techniques in Data Mining -- Ant Colony Decision Tree Approach -- Adaptive Goal Function of the ACDT Algorithm -- Examples of Practical Application.

This book not only discusses the important topics in the area of machine learning and combinatorial optimization, it also combines them into one. This was decisive for choosing the material to be included in the book and determining its order of presentation. Decision trees are a popular method of classification as well as of knowledge representation. At the same time, they are easy to implement as the building blocks of an ensemble of classifiers. Admittedly, however, the task of constructing a near-optimal decision tree is a very complex process. The good results typically achieved by the ant colony optimization algorithms when dealing with combinatorial optimization problems suggest the possibility of also using that approach for effectively constructing decision trees. The underlying rationale is that both problem classes can be presented as graphs. This fact leads to option of considering a larger spectrum of solutions than those based on the heuristic. Moreover, ant colony optimization algorithms can be used to advantage when building ensembles of classifiers. This book is a combination of a research monograph and a textbook. It can be used in graduate courses, but is also of interest to researchers, both specialists in machine learning and those applying machine learning methods to cope with problems from any field of R&D.

ISBN: 9783319937526$q(electronic bk.)

Standard No.: 10.1007/978-3-319-93752-6doiSubjects--Topical Terms:

490544
Ant algorithms.

LC Class. No.: QA402.5 / .K693 2019

Dewey Class. No.: 519.6

Decision tree and ensemble learning based on ant colony optimization
LDR:02560nmm a2200325 a 4500 001 550342
003 DE-He213
005 20180620172925.0
006 m d
007 cr nn 008maaau
008 191004s2019 gw s 0 eng d
020 $a 9783319937526$q(electronic bk.)
020 $a 9783319937519$q(paper)
024 7 $a 10.1007/978-3-319-93752-6 $2 doi
035 $a 978-3-319-93752-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5 $b .K693 2019
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
082 0 4 $a 519.6 $2 23
090 $a QA402.5 $b .K88 2019
100 1 $a Kozak, Jan. $3 456674
245 1 0 $a Decision tree and ensemble learning based on ant colony optimization $h [electronic resource] / $c by Jan Kozak.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xi, 159 p. : $b ill., digital ; $c 24 cm.
490 1 $a Studies in computational intelligence, $x 1860-949X ; $v v.781
505 0 $a Theoretical Framework -- Evolutionary Computing Techniques in Data Mining -- Ant Colony Decision Tree Approach -- Adaptive Goal Function of the ACDT Algorithm -- Examples of Practical Application.
520 $a This book not only discusses the important topics in the area of machine learning and combinatorial optimization, it also combines them into one. This was decisive for choosing the material to be included in the book and determining its order of presentation. Decision trees are a popular method of classification as well as of knowledge representation. At the same time, they are easy to implement as the building blocks of an ensemble of classifiers. Admittedly, however, the task of constructing a near-optimal decision tree is a very complex process. The good results typically achieved by the ant colony optimization algorithms when dealing with combinatorial optimization problems suggest the possibility of also using that approach for effectively constructing decision trees. The underlying rationale is that both problem classes can be presented as graphs. This fact leads to option of considering a larger spectrum of solutions than those based on the heuristic. Moreover, ant colony optimization algorithms can be used to advantage when building ensembles of classifiers. This book is a combination of a research monograph and a textbook. It can be used in graduate courses, but is also of interest to researchers, both specialists in machine learning and those applying machine learning methods to cope with problems from any field of R&D.
650 0 $a Ant algorithms. $3 490544
650 0 $a Decision trees. $3 280975
650 1 4 $a Engineering. $3 210888
650 2 4 $a Computational Intelligence. $3 338479
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 252959
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Studies in computational intelligence ; $v v. 216. $3 380871
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-93752-6
950 $a Engineering (Springer-11647)