Algorithmic learning theory

Algorithmic learning theory

by ALT 2003 (2003 Sapporo-shi

Part of Lecture notes in computer science -- 2842. Lecture notes in artificial intelligence

2003

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
This volume contains the papers presented at the 14th Annual Conference on Algorithmic Learning Theory (ALT 2003), which was held in Sapporo (Japan) duringOctober17–19,2003. Themainobjectiveoftheconferencewastoprovide an interdisciplinary forum for discussing the theoretical foundations of machine learning as well as their relevance to practical applications. The conference was co-locatedwiththe6thInternationalConferenceonDiscoveryScience(DS2003). The volume includes 19 technical contributions that were selected by the program committee from 37 submissions. It also contains the ALT 2003 invited talks presented by Naftali Tishby (Hebrew University, Israel) on “E?cient Data Representations that Preserve Information,” by Thomas Zeugmann (University of Lub ¨ eck, Germany) on “Can Learning in the Limit be Done E?ciently?”, and by Genshiro Kitagawa (Institute of Statistical Mathematics, Japan) on “S- nal Extraction and Knowledge Discovery Based on Statistical Modeling” (joint invited talk with DS 2003). Furthermore, this volume includes abstracts of the invitedtalksforDS2003presentedbyThomasEiter(ViennaUniversityofTe- nology, Austria) on “Abduction and the Dualization Problem” and by Akihiko Takano (National Institute of Informatics, Japan) on “Association Computation for Information Access. ” The complete versions of these papers were published in the DS 2003 proceedings (Lecture Notes in Arti?cial Intelligence Vol. 2843). ALT has been awarding theE. MarkGoldAward for the most outstanding paper by a student author since 1999. This year the award was given to Sandra Zilles for her paper “Intrinsic Complexity of Uniform Learning. ” This conference was the 14th in a series of annual conferences established in 1990. ContinuationoftheALTseriesissupervisedbyitssteeringcommittee,c- sisting of: Thomas Zeugmann (Univ.

Discuss Algorithmic learning theory with other readers

Join or start a book club for Algorithmic learning theory on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Algorithmic learning theory?

Sign up free on Readfeed, then browse public clubs or start your own club with Algorithmic learning theory as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Algorithmic learning theory with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Algorithmic learning theory with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.