//]]>

Average Time Complexity of Decision Trees (Record no. 11623)

000 -LEADER
fixed length control field 02748nam a22003975i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310143348.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 110809s2011 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642226618
978-3-642-22661-8
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 006.3
Edition number 23
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2011.
912 ## -
-- ZDB-2-ENG
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Chikalov, Igor.
Relator term author.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Average Time Complexity of Decision Trees
Medium [electronic resource] /
Statement of responsibility, etc by Igor Chikalov.
300 ## - PHYSICAL DESCRIPTION
Extent XII, 104 p.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Intelligent Systems Reference Library,
International Standard Serial Number 1868-4394 ;
Volume number/sequential designation 21
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 1 Introduction -- 2 Bounds on Average Time Complexity of Decision Trees -- 3 Representing Boolean Functions by Decision Trees -- 4 Algorithms for Decision Tree Construction -- 5 Problems Over Information Systems.
520 ## - SUMMARY, ETC.
Summary, etc Decision tree is a widely used form of representing algorithms and knowledge. Compact data models  and fast algorithms require optimization of tree complexity. This book is a research monograph on  average time complexity of decision trees. It generalizes several known results and considers a number of new problems.    The book contains exact and approximate algorithms for decision tree optimization, and bounds on minimum average time  complexity of decision trees. Methods of combinatorics, probability theory and complexity theory are used in the proofs as  well as concepts from various branches of discrete mathematics and computer science. The considered applications include the study of average depth of decision trees for Boolean functions from closed classes, the comparison of results of the performance  of greedy heuristics for average depth minimization with optimal decision trees constructed by dynamic programming algorithm, and optimization of decision trees for the corner point recognition problem from computer vision.   The book can be interesting for researchers working on time complexity of algorithms and specialists  in test theory, rough set theory, logical analysis of data and machine learning.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Engineering.
Topical term or geographic name as entry element Artificial intelligence.
Topical term or geographic name as entry element Engineering.
Topical term or geographic name as entry element Computational Intelligence.
Topical term or geographic name as entry element Artificial Intelligence (incl. Robotics).
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642226601
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-22661-8
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-04-01AUM Main Library2014-04-01 2014-04-01 E-Book   AUM Main Library006.3

Languages: 
English |
العربية