IDA-99 The Third Symposium on Intelligent Data Analysis Amsterdam, The Netherlands

The symposium is a three-day event: August 9-10-11, 1999. It is organized by the Leiden Center for Natural Computation from Leiden University, in cooperation with AAAI, CEPIS and NVKI. It is the third symposium on Intelligent Data Analysis after the successful symposia Intelligent Data Analysis 97 in London and Intelligent Data Analysis 95 in Baden-Baden. The proceedings are published in the Lecture Notes in Computer Science series of Springer as LNCS 1642. The proceedings of Intelligent Data Analysis 97 appeared in this series as LNCS 1280. We plan to have a special issue of the Intelligent Data Analysis journal with extended versions of a number of papers presented during the symposium.

General Information
including accepted papers and program

Registration and Hotel Reservation

Program Committee

Symposium Location

Demonstrations/Exhibition

Social Event

General Information

• Jacqueline Meulman (Leiden University, The Netherlands): Optimal Scaling,
• Zdzislaw Pawlak (Warsaw Institute of Technology, Poland): Rough Sets,
• Paul Cohen (University of Massachusetts, Amherst): Data Analysis and the Development of Robot Minds.

OBJECTIVE

Our aim is for IDA-99 to bring together a wide variety of researchers concerned with extracting knowledge from data, including people from statistics, machine learning, neural networks, computer science, pattern recognition, database management, and other areas. The strategies adopted by people from these areas are often different, and a synergy results if this is recognised. IDA-99 is intended to stimulate interaction between these different areas, so that more powerful tools emerge for extracting knowledge from data and a better understanding is developed of the process of intelligent data analysis.

Contributed papers are invited on any relevant topic, including, but not restricted to

APPLICATIONS & TOOLS:

• analysis of different kinds of data (e.g., censored, temporal etc.)
• applications (e.g., commerce, engineering, finance, legal, manufacturing, medicine, public policy, science)
• assistants, intelligent agents for data analysis
• evaluation of IDA systems
• human-computer interaction in IDA
• IDA systems and tools
• information extraction, information retrieval

THEORY & GENERAL PRINCIPLES:

• analysis of IDA algorithms
• classification, projection, regression, optimization clustering
• data cleaning
• data pre-processing
• experiment design
• model specification, selection, estimation
• reasoning under uncertainty
• search
• statistical strategy
• uncertainty and noise in data

ALGORITHMS & TECHNIQUES:

• Bayesian inference and influence diagrams
• bootstrap and randomization
• causal modeling
• data mining
• decision analysis
• exploratory data analysis
• automated data analysis
• fuzzy, neural and evolutionary appraoches
• knowledge-based analysis
• machine learning
• statistical pattern recognition
• visualization

The Call for Papers is still available. However, the deadlines for submission have passed.

Registration and Hotel Reservation

The registration form is also available in PostScript: a4 format and us-letter format.

Program Committee

General Chair

• David Hand, Open University, UK

Program Chair

• Joost Kok, Leiden University, The Netherlands

Program Co-Chairs

• Michael Berthold, University of California, Berkeley, US
• Doug Fisher, Vanderbilt University, US

Members

• Niall Adams, Open University, UK
• Pieter Adriaans, Syllogic, The Netherlands
• Russell Almond, Educational Testing Service, US
• Thomas Bäck, Informatik Centrum Dortmund, Germany
• Riccardo Bellazzi, University of Pavia, Italy
• Paul Cohen, University of Massachusetts, US
• Paul Darius, Leuven University, Belgium
• Tom Dietterich, Oregon State University, US
• Gerard van den Eijkel, Delft University of Technology, The Netherlands
• Fazel Famili, National Research Council, Canada
• Karl Froeschl, Univ of Vienna, Austria
• Linda van der Gaag, Utrecht University, The Netherlands
• Alex Gammerman, Royal Holloway London, UK
• Jaap van den Herik, Universiteit Maastricht, The Netherlands
• Rainer Holve, FORWISS Erlangen, Germany
• Larry Hunter, National Library of Medicine, US
• David Jensen, University of Massachusetts, US
• Bert Kappen, Nijmegen University, The Netherlands
• Hans Lenz, Free University of Berlin, Germany
• Frank Klawonn, University of Applied Sciences Emden, Germany
• Bing Liu, National University, Singapore
• Xiaohui Liu, Birkbeck College, UK
• David Madigan, University of Washington, US
• Heikki Mannila, Helsinki University, Finland
• Erkki Oja, Helsinki University of Technology, Finland
• Wayne Oldford, Waterloo, Canada
• Albert Prat, Technical University of Catalunya, Spain
• Luc de Raedt, KU Leuven, Belgium
• Rosanna Schiavo, University of Venice, Italy
• Kaisa Sere, Abo Akademi University, Finland
• Jude Shavlik, University of Wisconsin, US
• Roberta Siciliano, University of Naples, Italy
• Arno Siebes, Center for Mathematics and Computer Science, The Netherlands
• Rosaria Silipo, International Computer Science Institute, US
• Floor Verdenius, ATO-DLO, The Netherlands
• Stefan Wrobel, GMD, Germany
• Jan Zytkow, University of North Carolina, Charlotte, US

Symposium Location

You can read some instructions about how to get to CWI; and more instructions on how to get to CWI by public transport and consult The Internet Guide to Amsterdam in order to obtain more information on finding your way in Amsterdam. Some information on one-day excursions is also available.

Local Chair

• Walter Kosters, Leiden University, The Netherlands

Demonstrations/Exhibition

Social Event

There are special boats and trams that circle along the touristic attractions of Amsterdam and hence it will be easy for the participants to find their way. Each participant will be provided with a ``social package'', including a list of restaurants and bars, maps of town, public transport information, timetables of trains, etc. Further information can be found in the The Internet Guide to Amsterdam. Some panoramic pictures are also available.