Fr. 135.00

Ensembles in Machine Learning Applications

English · Hardback

Shipping usually within 6 to 7 weeks

Description

Read more

This book contains the extended papers presented at the 3rd Workshop on Supervised and Unsupervised Ensemble Methods
and their Applications (SUEMA) that was held in conjunction with the European Conference on Machine Learning and
Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD 2010, Barcelona, Catalonia, Spain).
As its two predecessors, its main theme was ensembles of supervised and unsupervised algorithms - advanced machine
learning and data mining technique. Unlike a single classification or clustering algorithm, an ensemble is a group
of algorithms, each of which first independently solves the task at hand by assigning a class or cluster label
(voting) to instances in a dataset and after that all votes are combined together to produce the final class or
cluster membership. As a result, ensembles often outperform best single algorithms in many real-world problems.

This book consists of 14 chapters, each of which can be read independently of the others. In addition to two
previous SUEMA editions, also published by Springer, many chapters in the current book include pseudo code and/or
programming code of the algorithms described in them. This was done in order to facilitate ensemble adoption in
practice and to help to both researchers and engineers developing ensemble applications.

List of contents

From the content: Facial Action Unit Recognition Using Filtered Local Binary Pattern Features with Bootstrapped and Weighted ECOC Classifiers.- On the Design of Low Redundancy Error-Correcting Output Codes.- Minimally-Sized Balanced Decomposition Schemes for Multi-ClassClassification.- Bias-Variance Analysis of ECOC and Bagging Using Neural Nets.- Fast-ensembles of Minimum Redundancy Feature Selection.

Summary

This book contains the extended papers presented at the 3rd Workshop on Supervised and Unsupervised Ensemble Methods


and their Applications (SUEMA) that was held in conjunction with the European Conference on Machine Learning and


Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD 2010, Barcelona, Catalonia, Spain).


As its two predecessors, its main theme was ensembles of supervised and unsupervised algorithms – advanced machine


learning and data mining technique. Unlike a single classification or clustering algorithm, an ensemble is a group


of algorithms, each of which first independently solves the task at hand by assigning a class or cluster label


(voting) to instances in a dataset and after that all votes are combined together to produce the final class or


cluster membership. As a result, ensembles often outperform best single algorithms in many real-world problems.


 


This book consists of 14 chapters, each of which can be read independently of the others. In addition to two


previous SUEMA editions, also published by Springer, many chapters in the current book include pseudo code and/or


programming code of the algorithms described in them. This was done in order to facilitate ensemble adoption in


practice and to help to both researchers and engineers developing ensemble applications.

Product details

Assisted by Oleg Okun (Editor), Matteo Re (Editor), Giorgi Valentini (Editor), Giorgio Valentini (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Hardback
Released 01.09.2011
 
EAN 9783642229091
ISBN 978-3-642-22909-1
No. of pages 252
Weight 592 g
Illustrations XX, 252 p.
Series Studies in Computational Intelligence
Studies in Computational Intelligence
Subjects Natural sciences, medicine, IT, technology > Technology > General, dictionaries

B, Artificial Intelligence, engineering, Computational Intelligence

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.