=====================================================================
[Apologies if you receive multiple copies of this message]
*********************************************************************
CALL FOR PAPERS: ALT 2000
The Eleventh International Conference on Algorithmic Learning Theory
Coogee Holiday Inn, Sydney, Australia
December 11 - 13, 2000
http://www.i.kyushu-u.ac.jp/alt2000/
*********************************************************************
The 11th International Conference on Algorithmic Learning Theory (ALT
2000) will be held in Sydney, Australia during December 11--13, 2000.
The main objective of this conference is to provide an open forum for
discussion and exchange of ideas among researchers from various fields
of learning theory and machine learning.
SCOPE. We invite submissions to ALT 2000 in all areas related to
algorithmic learning theory including (but not limited to):
* the design and analysis of learning algorithms
* the theory of machine learning
* computational logic of/for machine discovery
* inductive inference, learning via queries
* new learning models
* scientific discovery, learning by analogy
* artificial and biological neural networks
* pattern recognition, statistical learning
* Bayesian/MDL/MML estimation
* inductive logic programming
* data mining and knowledge discovery
* application of learning to biological sequence analysis
INVITED TALKS will be delivered by three distinguished researchers:
* William Cohen (Whizbang Labs)
* Tom Dietterich (Oregon State Univ.)
* Osamu Watanabe (Tokyo Inst. Tech.).
SUBMISSIONS. Authors may either e-mail postscript files of their
extended abstracts to:
[EMAIL PROTECTED]
or submit nine copies of their extended abstracts to:
Hiroki Arimura - ALT 2000
Department of Informatics, Kyushu University
Fukuoka 812-8581, Japan
IMPORTANT DATES.
* Submission Deadline: May 25, 2000
* Notification of Acceptance: July 10, 2000.
* Camera-ready Due: August 10, 2000.
FORMAT. The submitted abstract should consist of a cover page with
title, author names, postal and e-mail addresses, an approximately 200
word summary, and a body not longer than ten (10) pages of size A4 or
7x10.5 inches in twelve-point font. You may use appendices to include
long but major proofs. If you submit hardcopies, double-sided
printing is encouraged.
POLICY. Each submitted abstract will be reviewed by the members of
the program committee, and be judged on clarity, significance, and
originality. Joint submissions to other conferences with published
proceedings are not allowed. Papers that have appeared in journals or
other conferences are not appropriate for ALT 2000.
E.M. GOLD AWARD. One scholarship of $500US sponsored by IFIP TC 1.4
will be awarded to a student author (please mark student authors) of
an excellent paper.
PROCEEDINGS will be published as a volume in the Lecture Notes in
Artificial Intelligence, Springer-Verlag, and will be available at the
conference. Selected papers of ALT 2000 will be invited to a special
issue of the journal Theoretical Computer Science.
CONFERENCE CHAIR:
Arun Sharma, University of New South Wales.
Email: [EMAIL PROTECTED]
PROGRAM COMMITTEE CHAIRS:
H. Arimura (Kyushu Univ., Fukuoka, Japan)
S. Jain (National Univ. of Singapore, Singapore)
PROGRAM COMMITTEE:
N. Abe (NEC, Japan)
M. Bain (Univ. of New South Wales, Australia)
P. Bartlett (Australian National Univ., Australia)
S. Ben David (Technion, Israel)
R. Freivalds (Univ. of Latvia, Latvia)
N. Indurkhya (Nanyang Tech Univ., Singapore)
R. Khardon (Edinburgh Univ., UK)
E. Martin (Univ. of New South Wales, Australia)
Y. Sakakibara (Tokyo Denki Univ. , Japan)
T. Shinohara (Kyushu Inst. of Tech, Japan)
F. Stephan (Univ. of Heidelberg, Germany)
O. Watanabe (Titech, Japan)
A. Yamamoto (Hokkaido Univ., Japan)
LOCAL ARRANGEMENTS COMMITEE:
E. Martin (Univ. of New South Wales, Australia)
E. McCreath (Univ. of Sydney, Australia)
--------------------------------------------------------------------
CONFERENCE HOMEPAGE: http://www.i.kyushu-u.ac.jp/alt2000/
For more information, contact:
Hiroki Arimura ([EMAIL PROTECTED]) or
Sanjay Jain ([EMAIL PROTECTED])
=====================================================================
====================================================================
