|
|
|
|
| LEADER |
08010cam a22010092 4500 |
| 001 |
0-165022978X |
| 003 |
DE-627 |
| 005 |
20240122105254.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
101005s2010 gw |||||o 00| ||eng c |
| 020 |
|
|
|a 9783642161087
|9 978-3-642-16108-7
|
| 024 |
7 |
|
|a 10.1007/978-3-642-16108-7
|2 doi
|
| 035 |
|
|
|a (DE-627)165022978X
|
| 035 |
|
|
|a (DE-576)330930443
|
| 035 |
|
|
|a (DE-599)BSZ330930443
|
| 035 |
|
|
|a (OCoLC)682059742
|
| 035 |
|
|
|a (ZBM)1196.68009
|
| 035 |
|
|
|a (DE-He213)978-3-642-16108-7
|
| 035 |
|
|
|a (EBP)040526127
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 044 |
|
|
|c XA-DE
|
| 050 |
|
0 |
|a Q334-342
|a TJ210.2-211.495
|
| 072 |
|
7 |
|a TJFM1
|2 bicssc
|
| 072 |
|
7 |
|a UYQ
|2 bicssc
|
| 072 |
|
7 |
|a COM004000
|2 bisacsh
|
| 084 |
|
|
|a SS 4800
|2 rvk
|0 (DE-625)rvk/143528:
|
| 084 |
|
|
|a *68-06
|2 msc
|
| 084 |
|
|
|a 68Q32
|2 msc
|
| 084 |
|
|
|a 68T05
|2 msc
|
| 084 |
|
|
|a 00B25
|2 msc
|
| 084 |
|
|
|a 54.72
|2 bkl
|
| 100 |
1 |
|
|a Hutter, Marcus
|0 (DE-627)124643718X
|0 (DE-576)176437185
|4 aut
|
| 245 |
1 |
0 |
|a Algorithmic Learning Theory
|b 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings
|c edited by Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann
|
| 264 |
|
1 |
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2010
|
| 300 |
|
|
|a Online-Ressource (XIII, 421p. 45 illus, digital)
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a Computermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a Online-Ressource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science
|v 6331
|
| 490 |
0 |
|
|a SpringerLink
|a Bücher
|
| 520 |
|
|
|a Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- Towards General Algorithms for Grammatical Inference -- The Blessing and the Curse of the Multiplicative Updates -- Discovery of Abstract Concepts by a Robot -- Contrast Pattern Mining and Its Application for Building Robust Classifiers -- Optimal Online Prediction in Adversarial Environments -- Regular Contributions -- An Algorithm for Iterative Selection of Blocks of Features -- Bayesian Active Learning Using Arbitrary Binary Valued Queries -- Approximation Stability and Boosting -- A Spectral Approach for Probabilistic Grammatical Inference on Trees -- PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation -- Inferring Social Networks from Outbreaks -- Distribution-Dependent PAC-Bayes Priors -- PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar -- A PAC-Bayes Bound for Tailored Density Estimation -- Compressed Learning with Regular Concept -- A Lower Bound for Learning Distributions Generated by Probabilistic Automata -- Lower Bounds on Learning Random Structures with Statistical Queries -- Recursive Teaching Dimension, Learning Complexity, and Maximum Classes -- Toward a Classification of Finite Partial-Monitoring Games -- Switching Investments -- Prediction with Expert Advice under Discounted Loss -- A Regularization Approach to Metrical Task Systems -- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations -- Learning without Coding -- Learning Figures with the Hausdorff Metric by Fractals -- Inductive Inference of Languages from Samplings -- Optimality Issues of Universal Greedy Agents with Static Priors -- Consistency of Feature Markov Processes -- Algorithms for Adversarial Bandit Problems with Multiple Plays -- Online Multiple Kernel Learning: Algorithms and Mistake Bounds -- An Identity for Kernel Ridge Regression.
|
| 520 |
|
|
|a This volume contains the papers presented at the 21st International Conf- ence on Algorithmic Learning Theory (ALT 2010), which was held in Canberra, Australia, October 6–8, 2010. The conference was co-located with the 13th - ternational Conference on Discovery Science (DS 2010) and with the Machine Learning Summer School, which was held just before ALT 2010. The tech- cal program of ALT 2010, contained 26 papers selected from 44 submissions and ?ve invited talks. The invited talks were presented in joint sessions of both conferences. ALT 2010 was dedicated to the theoretical foundations of machine learning and took place on the campus of the Australian National University, Canberra, Australia. ALT provides a forum for high-quality talks with a strong theore- cal background and scienti?c interchange in areas such as inductive inference, universal prediction, teaching models, grammatical inference, formal languages, inductive logic programming, query learning, complexity of learning, on-line learning and relative loss bounds, semi-supervised and unsupervised learning, clustering,activelearning,statisticallearning,supportvectormachines,Vapnik- Chervonenkisdimension,probablyapproximatelycorrectlearning,Bayesianand causal networks, boosting and bagging, information-based methods, minimum descriptionlength,Kolmogorovcomplexity,kernels,graphlearning,decisiontree methods, Markov decision processes, reinforcement learning, and real-world - plications of algorithmic learning theory. DS 2010 was the 13th International Conference on Discovery Science and focused on the development and analysis of methods for intelligent data an- ysis, knowledge discovery and machine learning, as well as their application to scienti?c knowledge discovery. As is the tradition, it was co-located and held in parallel with Algorithmic Learning Theory.
|
| 650 |
|
0 |
|a Computer software
|
| 650 |
|
0 |
|a Logic design
|
| 650 |
|
0 |
|a Education
|
| 650 |
|
0 |
|a Computer Science
|
| 650 |
|
0 |
|a Computer science
|
| 650 |
|
0 |
|a Artificial intelligence
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer programming.
|
| 655 |
|
7 |
|a Konferenzschrift
|y 2010
|z Canberra
|0 (DE-588)1071861417
|0 (DE-627)826484824
|0 (DE-576)433375485
|2 gnd-content
|
| 689 |
0 |
0 |
|D s
|0 (DE-588)4701014-9
|0 (DE-627)354500538
|0 (DE-576)215264282
|a Algorithmische Lerntheorie
|2 gnd
|
| 689 |
0 |
|
|5 DE-101
|
| 700 |
1 |
|
|a Stephan, Frank
|0 (DE-588)1125914025
|0 (DE-627)880490810
|0 (DE-576)483630047
|4 oth
|
| 700 |
1 |
|
|a Vovk, Vladimir
|4 oth
|
| 700 |
1 |
|
|a Zeugmann, Thomas
|4 oth
|
| 776 |
1 |
|
|z 9783642161070
|
| 776 |
0 |
8 |
|i Buchausg. u.d.T.
|t Algorithmic learning theory
|d Berlin : Springer, 2010
|h XIII, 419 S.
|w (DE-627)634767887
|w (DE-576)332192512
|z 3642161073
|z 9783642161070
|
| 830 |
|
0 |
|a Lecture notes in computer science
|v 6331
|9 6331
|w (DE-627)316228877
|w (DE-576)093890923
|w (DE-600)2018930-8
|x 1611-3349
|7 ns
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-16108-7
|m X:SPRINGER
|x Verlag
|z lizenzpflichtig
|3 Volltext
|
| 856 |
4 |
2 |
|u https://zbmath.org/?q=an:1196.68009
|m B:ZBM
|v 2021-04-12
|x Verlag
|y Zentralblatt MATH
|3 Inhaltstext
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|b 2010
|
| 912 |
|
|
|a ZDB-2-SEB
|
| 912 |
|
|
|a ZDB-2-SCS
|b 2010
|
| 912 |
|
|
|a ZDB-2-SXCS
|b 2010
|
| 912 |
|
|
|a ZDB-2-SEB
|b 2010
|
| 936 |
r |
v |
|a SS 4800
|b Lecture notes in computer science
|k Informatik
|k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen
|k Schriftenreihen (indiv. Sign.)
|k Lecture notes in computer science
|0 (DE-627)1271461242
|0 (DE-625)rvk/143528:
|0 (DE-576)201461242
|
| 936 |
b |
k |
|a 54.72
|j Künstliche Intelligenz
|q SEPA
|0 (DE-627)10641240X
|
| 951 |
|
|
|a BO
|
| 900 |
|
|
|a Hutter, M.
|
| 900 |
|
|
|a Stephan, Frank Christian
|
| 900 |
|
|
|a Stephan, Frank C.
|
| 950 |
|
|
|a Computational Learning Theory
|
| 950 |
|
|
|a Lerntheorie
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-16108-7
|9 DE-14
|
| 852 |
|
|
|a DE-14
|z 2011-07-20T14:58:04Z
|x epn:3336209544
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-16108-7
|9 DE-15
|
| 852 |
|
|
|a DE-15
|z 2011-05-16T16:33:06Z
|x epn:3336209625
|
| 976 |
|
|
|h Elektronischer Volltext - Campuslizenz
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-16108-7
|z Zum Online-Dokument
|9 DE-Zi4
|
| 852 |
|
|
|a DE-Zi4
|z 2011-01-26T14:23:59Z
|x epn:3336209749
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-16108-7
|9 DE-520
|
| 852 |
|
|
|a DE-520
|z 2010-10-05T14:43:34Z
|x epn:333620979X
|
| 980 |
|
|
|a 165022978X
|b 0
|k 165022978X
|o 330930443
|
SOLR
| _version_ |
1789365183951405056 |
| access_facet |
Electronic Resources |
| author |
Hutter, Marcus |
| author2 |
Stephan, Frank, Vovk, Vladimir, Zeugmann, Thomas |
| author2_role |
oth, oth, oth |
| author2_variant |
f s fs, v v vv, t z tz |
| author_facet |
Hutter, Marcus, Stephan, Frank, Vovk, Vladimir, Zeugmann, Thomas |
| author_role |
aut |
| author_sort |
Hutter, Marcus |
| author_variant |
m h mh |
| callnumber-first |
Q - Science |
| callnumber-label |
Q334-342 |
| callnumber-raw |
Q334-342 TJ210.2-211.495 |
| callnumber-search |
Q334-342 TJ210.2-211.495 |
| callnumber-sort |
Q 3334 3342 T J210 12 3211.495 |
| callnumber-subject |
Q - General Science |
| collection |
ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS |
| contents |
Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- Towards General Algorithms for Grammatical Inference -- The Blessing and the Curse of the Multiplicative Updates -- Discovery of Abstract Concepts by a Robot -- Contrast Pattern Mining and Its Application for Building Robust Classifiers -- Optimal Online Prediction in Adversarial Environments -- Regular Contributions -- An Algorithm for Iterative Selection of Blocks of Features -- Bayesian Active Learning Using Arbitrary Binary Valued Queries -- Approximation Stability and Boosting -- A Spectral Approach for Probabilistic Grammatical Inference on Trees -- PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation -- Inferring Social Networks from Outbreaks -- Distribution-Dependent PAC-Bayes Priors -- PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar -- A PAC-Bayes Bound for Tailored Density Estimation -- Compressed Learning with Regular Concept -- A Lower Bound for Learning Distributions Generated by Probabilistic Automata -- Lower Bounds on Learning Random Structures with Statistical Queries -- Recursive Teaching Dimension, Learning Complexity, and Maximum Classes -- Toward a Classification of Finite Partial-Monitoring Games -- Switching Investments -- Prediction with Expert Advice under Discounted Loss -- A Regularization Approach to Metrical Task Systems -- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations -- Learning without Coding -- Learning Figures with the Hausdorff Metric by Fractals -- Inductive Inference of Languages from Samplings -- Optimality Issues of Universal Greedy Agents with Static Priors -- Consistency of Feature Markov Processes -- Algorithms for Adversarial Bandit Problems with Multiple Plays -- Online Multiple Kernel Learning: Algorithms and Mistake Bounds -- An Identity for Kernel Ridge Regression., This volume contains the papers presented at the 21st International Conf- ence on Algorithmic Learning Theory (ALT 2010), which was held in Canberra, Australia, October 6–8, 2010. The conference was co-located with the 13th - ternational Conference on Discovery Science (DS 2010) and with the Machine Learning Summer School, which was held just before ALT 2010. The tech- cal program of ALT 2010, contained 26 papers selected from 44 submissions and ?ve invited talks. The invited talks were presented in joint sessions of both conferences. ALT 2010 was dedicated to the theoretical foundations of machine learning and took place on the campus of the Australian National University, Canberra, Australia. ALT provides a forum for high-quality talks with a strong theore- cal background and scienti?c interchange in areas such as inductive inference, universal prediction, teaching models, grammatical inference, formal languages, inductive logic programming, query learning, complexity of learning, on-line learning and relative loss bounds, semi-supervised and unsupervised learning, clustering,activelearning,statisticallearning,supportvectormachines,Vapnik- Chervonenkisdimension,probablyapproximatelycorrectlearning,Bayesianand causal networks, boosting and bagging, information-based methods, minimum descriptionlength,Kolmogorovcomplexity,kernels,graphlearning,decisiontree methods, Markov decision processes, reinforcement learning, and real-world - plications of algorithmic learning theory. DS 2010 was the 13th International Conference on Discovery Science and focused on the development and analysis of methods for intelligent data an- ysis, knowledge discovery and machine learning, as well as their application to scienti?c knowledge discovery. As is the tradition, it was co-located and held in parallel with Algorithmic Learning Theory. |
| ctrlnum |
(DE-627)165022978X, (DE-576)330930443, (DE-599)BSZ330930443, (OCoLC)682059742, (ZBM)1196.68009, (DE-He213)978-3-642-16108-7, (EBP)040526127 |
| de15_date |
2011-05-16T16:33:06Z |
| doi_str_mv |
10.1007/978-3-642-16108-7 |
| era_facet |
2010 |
| facet_912a |
ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS |
| facet_avail |
Online |
| facet_local_del330 |
Algorithmische Lerntheorie |
| finc_class_facet |
Informatik, Allgemeine Naturwissenschaft, Technik |
| finc_id_str |
0001402115 |
| fincclass_txtF_mv |
science-computerscience |
| format |
eBook, ConferenceProceedings |
| format_access_txtF_mv |
Book, E-Book |
| format_de105 |
Ebook |
| format_de14 |
Book, E-Book |
| format_de15 |
Book, E-Book |
| format_del152 |
Buch |
| format_detail_txtF_mv |
text-online-monograph-independent-conference |
| format_dezi4 |
e-Book |
| format_finc |
Book, E-Book |
| format_legacy |
ElectronicBook |
| format_legacy_nrw |
Book, E-Book |
| format_nrw |
Book, E-Book |
| format_strict_txtF_mv |
E-Book |
| genre |
Konferenzschrift 2010 Canberra (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content |
| genre_facet |
Konferenzschrift |
| geogr_code |
not assigned |
| geogr_code_person |
not assigned |
| geographic_facet |
Canberra |
| hierarchy_parent_id |
0-316228877 |
| hierarchy_parent_title |
Lecture notes in computer science |
| hierarchy_sequence |
6331 |
| hierarchy_top_id |
0-316228877 |
| hierarchy_top_title |
Lecture notes in computer science |
| id |
0-165022978X |
| illustrated |
Not Illustrated |
| imprint |
Berlin, Heidelberg, Springer Berlin Heidelberg, 2010 |
| imprint_str_mv |
Berlin, Heidelberg: Springer Berlin Heidelberg, 2010 |
| institution |
DE-14, DE-Zi4, DE-520, DE-15 |
| is_hierarchy_id |
0-165022978X |
| is_hierarchy_title |
Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings |
| isbn |
9783642161087 |
| isbn_isn_mv |
9783642161070, 3642161073 |
| issn_isn_mv |
1611-3349 |
| kxp_id_str |
165022978X |
| language |
English |
| last_indexed |
2024-01-28T19:53:37.57Z |
| local_heading_facet_dezwi2 |
Computer software, Logic design, Education, Computer Science, Computer science, Artificial intelligence, Machine theory., Algorithms., Computer programming., Algorithmische Lerntheorie |
| marc024a_ct_mv |
10.1007/978-3-642-16108-7 |
| match_str |
hutter2010algorithmiclearningtheory21stinternationalconferencealt2010canberraaustraliaoctober682010proceedings |
| mega_collection |
Verbunddaten SWB |
| multipart_link |
093890923 |
| multipart_part |
(093890923)6331 |
| names_id_str_mv |
(DE-627)124643718X, (DE-576)176437185, (DE-588)1125914025, (DE-627)880490810, (DE-576)483630047 |
| oclc_num |
682059742 |
| physical |
Online-Ressource (XIII, 421p. 45 illus, digital) |
| publishDate |
2010 |
| publishDateSort |
2010 |
| publishPlace |
Berlin, Heidelberg |
| publisher |
Springer Berlin Heidelberg |
| record_format |
marcfinc |
| record_id |
330930443 |
| recordtype |
marcfinc |
| rsn_id_str_mv |
(DE-15)2462093 |
| rvk_facet |
SS 4800 |
| rvk_label |
Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science |
| rvk_path |
SS, SQ - SU, SS 4000 - SS 5999, SS 4800 |
| rvk_path_str_mv |
SS, SQ - SU, SS 4000 - SS 5999, SS 4800 |
| series |
Lecture notes in computer science, 6331 |
| series2 |
Lecture Notes in Computer Science ; 6331, SpringerLink ; Bücher |
| source_id |
0 |
| spelling |
Hutter, Marcus (DE-627)124643718X (DE-576)176437185 aut, Algorithmic Learning Theory 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings edited by Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann, Berlin, Heidelberg Springer Berlin Heidelberg 2010, Online-Ressource (XIII, 421p. 45 illus, digital), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 6331, SpringerLink Bücher, Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- Towards General Algorithms for Grammatical Inference -- The Blessing and the Curse of the Multiplicative Updates -- Discovery of Abstract Concepts by a Robot -- Contrast Pattern Mining and Its Application for Building Robust Classifiers -- Optimal Online Prediction in Adversarial Environments -- Regular Contributions -- An Algorithm for Iterative Selection of Blocks of Features -- Bayesian Active Learning Using Arbitrary Binary Valued Queries -- Approximation Stability and Boosting -- A Spectral Approach for Probabilistic Grammatical Inference on Trees -- PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation -- Inferring Social Networks from Outbreaks -- Distribution-Dependent PAC-Bayes Priors -- PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar -- A PAC-Bayes Bound for Tailored Density Estimation -- Compressed Learning with Regular Concept -- A Lower Bound for Learning Distributions Generated by Probabilistic Automata -- Lower Bounds on Learning Random Structures with Statistical Queries -- Recursive Teaching Dimension, Learning Complexity, and Maximum Classes -- Toward a Classification of Finite Partial-Monitoring Games -- Switching Investments -- Prediction with Expert Advice under Discounted Loss -- A Regularization Approach to Metrical Task Systems -- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations -- Learning without Coding -- Learning Figures with the Hausdorff Metric by Fractals -- Inductive Inference of Languages from Samplings -- Optimality Issues of Universal Greedy Agents with Static Priors -- Consistency of Feature Markov Processes -- Algorithms for Adversarial Bandit Problems with Multiple Plays -- Online Multiple Kernel Learning: Algorithms and Mistake Bounds -- An Identity for Kernel Ridge Regression., This volume contains the papers presented at the 21st International Conf- ence on Algorithmic Learning Theory (ALT 2010), which was held in Canberra, Australia, October 6–8, 2010. The conference was co-located with the 13th - ternational Conference on Discovery Science (DS 2010) and with the Machine Learning Summer School, which was held just before ALT 2010. The tech- cal program of ALT 2010, contained 26 papers selected from 44 submissions and ?ve invited talks. The invited talks were presented in joint sessions of both conferences. ALT 2010 was dedicated to the theoretical foundations of machine learning and took place on the campus of the Australian National University, Canberra, Australia. ALT provides a forum for high-quality talks with a strong theore- cal background and scienti?c interchange in areas such as inductive inference, universal prediction, teaching models, grammatical inference, formal languages, inductive logic programming, query learning, complexity of learning, on-line learning and relative loss bounds, semi-supervised and unsupervised learning, clustering,activelearning,statisticallearning,supportvectormachines,Vapnik- Chervonenkisdimension,probablyapproximatelycorrectlearning,Bayesianand causal networks, boosting and bagging, information-based methods, minimum descriptionlength,Kolmogorovcomplexity,kernels,graphlearning,decisiontree methods, Markov decision processes, reinforcement learning, and real-world - plications of algorithmic learning theory. DS 2010 was the 13th International Conference on Discovery Science and focused on the development and analysis of methods for intelligent data an- ysis, knowledge discovery and machine learning, as well as their application to scienti?c knowledge discovery. As is the tradition, it was co-located and held in parallel with Algorithmic Learning Theory., Computer software, Logic design, Education, Computer Science, Computer science, Artificial intelligence, Machine theory., Algorithms., Computer programming., Konferenzschrift 2010 Canberra (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4701014-9 (DE-627)354500538 (DE-576)215264282 Algorithmische Lerntheorie gnd, DE-101, Stephan, Frank (DE-588)1125914025 (DE-627)880490810 (DE-576)483630047 oth, Vovk, Vladimir oth, Zeugmann, Thomas oth, 9783642161070, Buchausg. u.d.T. Algorithmic learning theory Berlin : Springer, 2010 XIII, 419 S. (DE-627)634767887 (DE-576)332192512 3642161073 9783642161070, Lecture notes in computer science 6331 6331 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-16108-7 X:SPRINGER Verlag lizenzpflichtig Volltext, https://zbmath.org/?q=an:1196.68009 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, http://dx.doi.org/10.1007/978-3-642-16108-7 DE-14, DE-14 2011-07-20T14:58:04Z epn:3336209544, http://dx.doi.org/10.1007/978-3-642-16108-7 DE-15, DE-15 2011-05-16T16:33:06Z epn:3336209625, http://dx.doi.org/10.1007/978-3-642-16108-7 Zum Online-Dokument DE-Zi4, DE-Zi4 2011-01-26T14:23:59Z epn:3336209749, http://dx.doi.org/10.1007/978-3-642-16108-7 DE-520, DE-520 2010-10-05T14:43:34Z epn:333620979X |
| spellingShingle |
Hutter, Marcus, Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings, Lecture notes in computer science, 6331, Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- Towards General Algorithms for Grammatical Inference -- The Blessing and the Curse of the Multiplicative Updates -- Discovery of Abstract Concepts by a Robot -- Contrast Pattern Mining and Its Application for Building Robust Classifiers -- Optimal Online Prediction in Adversarial Environments -- Regular Contributions -- An Algorithm for Iterative Selection of Blocks of Features -- Bayesian Active Learning Using Arbitrary Binary Valued Queries -- Approximation Stability and Boosting -- A Spectral Approach for Probabilistic Grammatical Inference on Trees -- PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation -- Inferring Social Networks from Outbreaks -- Distribution-Dependent PAC-Bayes Priors -- PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar -- A PAC-Bayes Bound for Tailored Density Estimation -- Compressed Learning with Regular Concept -- A Lower Bound for Learning Distributions Generated by Probabilistic Automata -- Lower Bounds on Learning Random Structures with Statistical Queries -- Recursive Teaching Dimension, Learning Complexity, and Maximum Classes -- Toward a Classification of Finite Partial-Monitoring Games -- Switching Investments -- Prediction with Expert Advice under Discounted Loss -- A Regularization Approach to Metrical Task Systems -- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations -- Learning without Coding -- Learning Figures with the Hausdorff Metric by Fractals -- Inductive Inference of Languages from Samplings -- Optimality Issues of Universal Greedy Agents with Static Priors -- Consistency of Feature Markov Processes -- Algorithms for Adversarial Bandit Problems with Multiple Plays -- Online Multiple Kernel Learning: Algorithms and Mistake Bounds -- An Identity for Kernel Ridge Regression., This volume contains the papers presented at the 21st International Conf- ence on Algorithmic Learning Theory (ALT 2010), which was held in Canberra, Australia, October 6–8, 2010. The conference was co-located with the 13th - ternational Conference on Discovery Science (DS 2010) and with the Machine Learning Summer School, which was held just before ALT 2010. The tech- cal program of ALT 2010, contained 26 papers selected from 44 submissions and ?ve invited talks. The invited talks were presented in joint sessions of both conferences. ALT 2010 was dedicated to the theoretical foundations of machine learning and took place on the campus of the Australian National University, Canberra, Australia. ALT provides a forum for high-quality talks with a strong theore- cal background and scienti?c interchange in areas such as inductive inference, universal prediction, teaching models, grammatical inference, formal languages, inductive logic programming, query learning, complexity of learning, on-line learning and relative loss bounds, semi-supervised and unsupervised learning, clustering,activelearning,statisticallearning,supportvectormachines,Vapnik- Chervonenkisdimension,probablyapproximatelycorrectlearning,Bayesianand causal networks, boosting and bagging, information-based methods, minimum descriptionlength,Kolmogorovcomplexity,kernels,graphlearning,decisiontree methods, Markov decision processes, reinforcement learning, and real-world - plications of algorithmic learning theory. DS 2010 was the 13th International Conference on Discovery Science and focused on the development and analysis of methods for intelligent data an- ysis, knowledge discovery and machine learning, as well as their application to scienti?c knowledge discovery. As is the tradition, it was co-located and held in parallel with Algorithmic Learning Theory., Computer software, Logic design, Education, Computer Science, Computer science, Artificial intelligence, Machine theory., Algorithms., Computer programming., Konferenzschrift 2010 Canberra, Algorithmische Lerntheorie |
| swb_id_str |
330930443 |
| title |
Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings |
| title_auth |
Algorithmic Learning Theory 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings |
| title_full |
Algorithmic Learning Theory 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings edited by Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann |
| title_fullStr |
Algorithmic Learning Theory 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings edited by Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann |
| title_full_unstemmed |
Algorithmic Learning Theory 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings edited by Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann |
| title_in_hierarchy |
6331. Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings (2010) |
| title_short |
Algorithmic Learning Theory |
| title_sort |
algorithmic learning theory 21st international conference alt 2010 canberra australia october 6 8 2010 proceedings |
| title_sub |
21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings |
| title_unstemmed |
Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings |
| topic |
Computer software, Logic design, Education, Computer Science, Computer science, Artificial intelligence, Machine theory., Algorithms., Computer programming., Konferenzschrift 2010 Canberra, Algorithmische Lerntheorie |
| topic_facet |
Computer software, Logic design, Education, Computer Science, Computer science, Artificial intelligence, Machine theory., Algorithms., Computer programming., Konferenzschrift, Algorithmische Lerntheorie |
| url |
https://doi.org/10.1007/978-3-642-16108-7, https://zbmath.org/?q=an:1196.68009, http://dx.doi.org/10.1007/978-3-642-16108-7 |
