logo
logo
x
바코드검색
바코드검색

인기 검색어

실시간 검색어

검색가능 서점

도서목록 제공

Algorithmic Learning Theory: 13th International Conference, Alt 2002, L?eck, Germany, November 24-26, 2002, Proceedings

Algorithmic Learning Theory: 13th International Conference, Alt 2002, L?eck, Germany, November 24-26, 2002, Proceedings (Paperback, 2002)

Nicolo Cesa-Bianchi, Masayuki Numao (엮은이)
Springer-Verlag New York Inc
100,960원

일반도서

검색중
서점 할인가 할인률 배송비 혜택/추가 실질최저가 구매하기
82,780원 -18% 0원
4,140원
78,640원 >
yes24 로딩중
교보문고 로딩중
notice_icon 검색 결과 내에 다른 책이 포함되어 있을 수 있습니다.

중고도서

검색중
서점 유형 등록개수 최저가 구매하기
로딩중

eBook

검색중
서점 정가 할인가 마일리지 실질최저가 구매하기
로딩중

책 이미지

Algorithmic Learning Theory: 13th International Conference, Alt 2002, L?eck, Germany, November 24-26, 2002, Proceedings
eBook 미리보기

책 정보

· 제목 : Algorithmic Learning Theory: 13th International Conference, Alt 2002, L?eck, Germany, November 24-26, 2002, Proceedings (Paperback, 2002) 
· 분류 : 외국도서 > 컴퓨터 > 프로그래밍 > 알고리즘
· ISBN : 9783540001706
· 쪽수 : 420쪽
· 출판일 : 2002-11-13

목차

Editors' Introduction.- Editors' Introduction.- Invited Papers.- Mathematics Based on Learning.- Data Mining with Graphical Models.- On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum.- In Search of the Horowitz Factor: Interim Report on a Musical Discovery Project.- Learning Structure from Sequences, with Applications in a Digital Library.- Regular Contributions.- On Learning Monotone Boolean Functions under the Uniform Distribution.- On Learning Embedded Midbit Functions.- Maximizing Agreements and CoAgnostic Learning.- Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning.- Large Margin Classification for Moving Targets.- On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution.- A General Dimension for Approximately Learning Boolean Functions.- The Complexity of Learning Concept Classes with Polynomial General Dimension.- On the Absence of Predictive Complexity for Some Games.- Consistency Queries in Information Extraction.- Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data.- Reflective Inductive Inference of Recursive Functions.- Classes with Easily Learnable Subclasses.- On the Learnability of Vector Spaces.- Learning, Logic, and Topology in a Common Framework.- A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning.- Minimised Residue Hypotheses in Relevant Logic.- Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages.- A Negative Result on Inductive Inference of Extended Pattern Languages.- RBF Neural Networks and Descartes' Rule of Signs.- Asymptotic Optimality of Transductive Confidence Machine.- An Efficient PAC Algorithm for Reconstructing a Mixture of Lines.- Constraint Classification: A New Approach to Multiclass Classification.- How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution.- Classification with Intersecting Rules.- Feedforward Neural Networks in Reinforcement Learning Applied to High-Dimensional Motor Control.

저자소개

Nicolo Cesa-Bianchi (엮은이)    정보 더보기
펼치기
도서 정보 제공 : Yes24(www.yes24.com), 알라딘(www.aladin.co.kr)

이 포스팅은 쿠팡파트너스 및 제휴마케팅이 포함된 광고로 이에 따른 일정액의 수수료를 제공받습니다.
최근 본 책