<電子ブック>
Algorithmic Learning Theory : 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993. Proceedings / edited by Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomori
(Lecture Notes in Artificial Intelligence. ISSN:29459141 ; 744)
版 | 1st ed. 1993. |
---|---|
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 1993 |
本文言語 | 英語 |
大きさ | XI, 428 p : online resource |
著者標目 | Jantke, Klaus P editor Kobayashi, Shigenobu editor Tomita, Etsuji editor Yokomori, Takashi editor SpringerLink (Online service) |
件 名 | LCSH:Artificial intelligence LCSH:Mathematics LCSH:Computer science FREE:Artificial Intelligence FREE:Mathematics FREE:Theory of Computation |
一般注記 | Identifying and using patterns in sequential data -- Learning theory toward Genome Informatics -- Optimal layered learning: A PAC approach to incremental sampling -- Reformulation of explanation by linear logic toward logic for explanation -- Towards efficient inductive synthesis of expressions from input/output examples -- A typed ?-calculus for proving-by-example and bottom-up generalization procedure -- Case-based representation and learning of pattern languages -- Inductive resolution -- Generalized unification as background knowledge in learning logic programs -- Inductive inference machines that can refute hypothesis spaces -- On the duality between mechanistic learners and what it is they learn -- On aggregating teams of learning machines -- Learning with growing quality -- Use of reduction arguments in determining Popperian FIN-type learning capabilities -- Properties of language classes with finite elasticity -- Uniform characterizations of various kinds of language learning -- How to invent characterizable inference methods for regular languages -- Neural Discriminant Analysis -- A new algorithm for automatic configuration of Hidden Markov Models -- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions -- On the sample complexity of consistent learning with one-sided error -- Complexity of computing Vapnik-Chervonenkis dimension -- ?-approximations of k-label spaces -- Exact learning of linear combinations of monotone terms from function value queries -- Thue systems and DNA — A learning algorithm for a subclass -- The VC-dimensions of finite automata with n states -- Unifying learning methods by colored digraphs -- A perceptual criterion for visually controlling learning -- Learning strategies using decision lists -- A decomposition based induction model for discovering concept clusters from databases -- Algebraic structure of some learning systems -- Induction of probabilistic rules based on rough set theory This volume contains all the papers that were presented at the Fourth Workshop on Algorithmic Learning Theory, held in Tokyo in November 1993. In addition to 3 invited papers, 29 papers were selected from 47 submitted extended abstracts. The workshop was the fourth in a series of ALT workshops, whose focus is on theories of machine learning and the application of such theories to real-world learning problems. The ALT workshops have been held annually since 1990, sponsored by the Japanese Society for Artificial Intelligence. The volume is organized into parts on inductive logic and inference, inductive inference, approximate learning, query learning, explanation-based learning, and new learning paradigms HTTP:URL=https://doi.org/10.1007/3-540-57370-4 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783540480969 |
|
電子リソース |
|
EB00225428 |