Algorithmic learning theory. 14th international conference, ALT 2003, Sapporo, Japan, October 17--19, 2003. Proceedings. (Q2483562)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic learning theory. 14th international conference, ALT 2003, Sapporo, Japan, October 17--19, 2003. Proceedings. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic learning theory. 14th international conference, ALT 2003, Sapporo, Japan, October 17--19, 2003. Proceedings. |
scientific article |
Statements
Algorithmic learning theory. 14th international conference, ALT 2003, Sapporo, Japan, October 17--19, 2003. Proceedings. (English)
0 references
20 July 2005
0 references
The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1012.00045). Indexed articles: \textit{Kitagawa, Genshiro}, Signal extraction and knowledge discovery based on statistical modeling, 3-14 [Zbl 1263.68135] \textit{Zeugmann, Thomas}, Can learning in the limit be done efficiently?, 17-38 [Zbl 1263.68062] \textit{Zilles, Sandra}, Intrinsic complexity of uniform learning, 39-53 [Zbl 1263.68063] \textit{Martin, Eric; Sharma, Arun; Stephan, Frank}, On ordinal VC-dimension and some notions of complexity, 54-68 [Zbl 1263.68058] \textit{Uemura, Jin; Sato, Masako}, Learning of erasing primitive formal systems from positive examples, 69-83 [Zbl 1263.68061] \textit{Balbach, Frank}, Changing the inference type -- keeping the hypothesis space, 84-98 [Zbl 1263.68054] \textit{Arpe, Jan; Reischuk, Rüdiger}, Robust inference of relevant attributes, 99-113 [Zbl 1263.68125] \textit{Suzuki, Yusuke; Shoudai, Takayoshi; Matsumoto, Satoshi; Uchida, Tomoyuki; Miyahara, Tetsuhiro}, Efficient learning of ordered and unordered tree patterns with contractible variables, 114-128 [Zbl 1263.68060] \textit{Lange, Steffen; Zilles, Sandra}, On the learnability of erasing pattern languages in the query model, 129-143 [Zbl 1263.68057] \textit{Matsumoto, Satoshi; Suzuki, Yusuke; Shoudai, Takayoshi; Miyahara, Tetsuhiro; Uchida, Tomoyuki}, Learning of finite unions of tree patterns with repeated internal structured variables from queries, 144-158 [Zbl 1263.68138] \textit{Wang, Jingdong; Lee, Jianguo; Zhang, Changshui}, Kernel trick embedded Gaussian mixture model, 159-174 [Zbl 1263.68147] \textit{De Bie, Tijl; Momma, Michinari; Cristianini, Nello}, Efficiently learning the metric with side-information, 175-189 [Zbl 1263.68128] \textit{Wang, Shaojun; Schuurmans, Dale}, Learning continuous latent variable models with Bregman divergences, 190-204 [Zbl 1263.68148] \textit{Ratsaby, Joel}, A stochastic gradient descent algorithm for structural risk minimisation, 205-220 [Zbl 1263.68143] \textit{Šíma, Jií}, On the complexity of training a single perceptron with programmable synaptic delays, 221-233 [Zbl 1263.68123] \textit{Case, John; Jain, Sanjay; Reischuk, Rüdiger; Stephan, Frank; Zeugmann, Thomas}, Learning a subclass of regular patterns in polynomial time, 234-246 [Zbl 1263.68055] \textit{de la Higuera, Colin; Oncina, Jose}, Identification with probability one of stochastic deterministic linear languages, 247-258 [Zbl 1263.68064] \textit{Nouretdinov, Ilia; Vovk, Vladimir}, Criterion of calibration for transductive confidence machine with limited feedback, 259-267 [Zbl 1263.68140] \textit{Vovk, Vladimir}, Well-calibrated predictions from online compression models, 268-282 [Zbl 1263.68146] \textit{Nouretdinov, Ilia; V'yugin, Vladimir; Gammerman, Alex}, Transductive confidence machine is universal, 283-297 [Zbl 1263.68141] \textit{Hutter, Marcus}, On the existence and convergence of computable universal priors, 298-312 [Zbl 1263.68056]
0 references