ECML-PKDD 2009: call for tutorials

The ECML-PKDD 2009 Organizing Committee invites proposals for tutorials to be held on the first and the last day of the conference, which will take place in Bled, Slovenia, on September 7-11, 2009.
Tutorials are free of charge to the conference attendees.

We seek proposals for half-day tutorials on core techniques and emerging research topics that enjoy broad interest within the machine learning and the data mining community. We also welcome tutorials from related research fields or exciting application areas. Tutorials should attract a wide audience. They should be broad enough to provide a gentle introduction to the chosen research area and they should highlight the current challenges. The ideal tutorial should also cover the most important contributions in sufficient depth and discuss future research directions. Proposals that exclusively focus on the presenters’ own work are not eligible.

Guidelines for preparing a proposal can be found at:

Tutorial proposals should be submitted via email in PDF format to the ECML-PKDD 2009 tutorial chair (ecml-pkdd-tu (at) Proposers should expect to receive a verification of receipt soon after submission.

The timeline is as follows:

Tutorial proposals due: March 8, 2009
Acceptance notification: March 25, 2009
Tutorial material due: August 15, 2009
Tutorials date: September 7 and 11, 2009

I hope to see you at the tutorials.

Cedric Archambeau
Tutorials Chair ECML-PKDD 2009

Grid@CLEF 2009 – New CLEF 2009 Pilot Track

Grid@CLEF is an activity of the Cross-Language Evaluation Forum (CLEF), which is launching a new pilot track in the CLEF 2009 campaign. Information about the objectives, the task, the organization, and the subscription procedure follows; for more information and updates, please visit the Grid@CLEF Web site at:


Multilingual information access (MLIA) is increasingly part of many complex systems, such as digital libraries, intranet and enterprise portals, Web search engines.

The Cross-Language Evaluation Forum (CLEF) research community has been outstanding and very active in designing, developing, and testing MLIA methods and techniques, constantly improving the performances of such components. But is this enough? Do we really know how MLIA components (stop lists, stemmers, IR models, relevance feedback, translation techniques, etc.) behave with respect to languages? Do we have a deep comprehension of how these components interact together when the language changes?
Unfortunately, today’s picture is quite fragmentary since researchers have mainly focused on specific aspects of multilinguality but a comprehensive and unifying view is still missing. This situation prevents an easy adoption of MLIA techniques and technology transfer by relevant application and developer communities. Indeed, it is often difficult for people outside the IR community to extract from the specialised scientific literature indications about the most promising
approaches and solutions.

We are thus launching a cooperative effort where a series of large-scale and systematic grid experiments will allow us to to improve our comprehension of MLIA systems and gain an exhaustive picture of their behaviour with respect to languages. In this way, we can exploit the
valuable resources and experimental collections made available by CLEF over the years in order to gain more insights about the effectiveness of the various weighting schemes and retrieval techniques with respect to the languages and to disseminate this knowledge to the relevant
application and developer communities.


This first year task focuses on *monolingual retrieval*, i.e. querying topics against documents in the same language of the topics, *in five European languages*:

* Dutch;
* English;
* French;
* German;
* Italian.

The selected languages will allow participants to test both romance and germanic languages, as well as languages with word compounding issues. Moreover, these languages have been extensively studied in the MLIA field and, therefore, it will be possible to compare and assess the
outcomes of the first year experiments with respect to the existing literature.

The reference scenario for Grid@CLEF 2009 concerns an IR system which consists of:

– a tokenizer component for processing the input document collection and producing a stream of tokens;
– an optional stop list component for removing stop words form the stream of tokens;
– an optional word decompounder component for splitting compound words in the stream of tokens;
– an optional stemmer component for stemming words in the stream of tokens;
– a weighting/scoring engine component for scoring documents against queries and producing an output ranked list.

Instead of directly feeding the next component, as usually happens in a monolithic IR system, the Grid@CLEF task requires each component to input and output from/to XML files in a well-defined format. This choice allows the exchange of these XML files among participants and the creation of a whole experiment from the chaining of components that may belong to different IR systems.

Therefore, the Grid@CLEF 2009 track has a twofold goal:

1. to prepare participants’ systems to work according to this new framework based on the exchange of well-defined XML messages;
2. to conduct as many experiments as possible, i.e. to put as many dots as possible on the grid, according to this new framework.

To facilitate the participation in this first year task, participants are required to participate in what we call the *island mode*, where all the components which constitute the IR system of the reference scenario are developed and run by the same participant. The participant is only requested to implement the XML messaging format for each of his own components and publish all the intermediate results of these components on the online XML messaging exchange system.

*Participanting in the Grid@CLEF 2009 pilot track is easy: you only need to join the island mode and produce as many experiments as possible.*


The tentative schedule for the Grid@CLEF 2009 track is as follows:

* Topics and collections release: early March 2009;
* XML messaging framework specification release: early April 2009;
* XML messaging exchange online system release: early May 2009;
* Experiment submission: mid June 2009;
* Results computation: early July 2009;
* Working note papers: mid August 2009;
* CLEF 2009 Workshop: from 30 September to 2 October 2009 in Corfu,

*Track Coordinators*

* Nicola Ferro, University of Padua, Italy – ferro (at)
* Donna Harman, National Institute of Standards and Technology
(NIST), USA – donna.harman (at)

*Advisory Committee*

* Chris Buckley, Sabir Research, USA;
* Fredric Gey, University of California at Berkeley, USA;
* Kalervo Javelin, University of Tampere, Finland;
* Noriko Kando, National Institute of Informatics (NII), Japan;
* Craig Macdonald, University of Glasgow, UK;
* Prasenjit Majumder, Indian Statistical Institute, Kolkata, India;
* Paul McNamee, Johns Hopkins University, USA;
* Teruko Mitamura, Carnegie Mellon University, USA;
* Mandar Mitra, Indian Statistical Institute, Kolkata, India;
* Stephen Robertson, Microsoft Research Cambridge and City University London, UK;
* Jacques Savoy, University of Neuchael, Switzerland.


Registration for CLEF 2009 and subscription to the Grid@CLEF 2009 pilot track open *4 February*. You can find more information on the main CLEF Web site at:

under “CLEF 2009”.

KDD’09 Call for Applications Papers


KDD-2009: The Fifteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’09)

Paris, France
June 28 – July 1, 2009.

CALL FOR Industrial/Government Applications Papers


The Industrial/Government Applications Track of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
(KDD-2009) will highlight challenges, lessons, research issues and practical problems arising out of deploying applications of KDD technology.
The focus is on promoting the exchange of ideas between researchers and practitioners of data mining.

Important dates:

***Note the earlier submission deadlines***
Abstract submission: February 2, 2009
Paper submission: February 6, 2009
Notification: April 10, 2009
Conference dates: June 28 – July 1, 2009


The KDD-2009 Industrial/Government Applications (I/G) Track seeks to:

* provide a forum for exchanging ideas between KDD practitioners,
researchers, companies, and government organizations;
* help commercial and government organizations highlight successful
KDD applications;
* raise interesting industrial challenges and other concerns more
specific to industry and government and exchange ideas about how
recent research development could help and bring solutions for
typical issues include but are not limited to customer privacy issues,

analysis of data not generally available in academia, issues of
scale that arise more heavily in a corporate setting, etc.

The I/G Applications Track solicits papers describing implementations of KDD solutions relevant to commercial or government settings. The primary emphasis is on papers that advance our understanding of practical, applied, or pragmatic issues and highlight new research challenges in real KDD applications. Applications can be in any field including, but not limited to: e-commerce, medical and pharmaceutical, defense, public policy, engineering, manufacturing, telecommunications, banking, insurance, finance, and government. Being held in Europe for the first time, we enthusiastically seek contributions from European authors and on European projects.

The I/G Applications Track will consist of competitively-selected contributed papers – presented in oral and/or poster form – as well as invited talks. We envision submissions along four sub-areas:

* Emerging applications and technology
* Deployed KDD case studies
* Comparative studies of KDD technology
* Pragmatic issues and research considerations in fielding real applications.

Emerging application and technology papers discuss prototype applications, tools for focused domains or tasks, useful techniques or methods, useful system architectures, scalability enablers, tool evaluations, or integration of KDD and other technologies. Case studies describe deployed projects with measurable benefits that include KDD technology. Such papers need to demonstrate the importance and general impact of the work clearly.
Comparative studies compare and contrast KDD technologies using specific examples (without being a product advertisement). Pragmatic issues and considerations include important practical and research considerations, approaches, and architectures that enable successful applications.

Submitters are encouraged (but not required) to select one (or more) of these sub-areas for their papers. In their submission, authors are required to explain why the application is important, the specific need for KDD technology to solve the problem (including why other methods perhaps not based on data mining may fall short), and any innovations or lessons learned in the solution.

KDD 2009 will also feature keynote presentations, a research track, workshops, tutorials, and the KDD Cup competition.

I/G Applications Track Co-Chairs:

* Kamal Ali, ISLE/Stanford,
* Ricardo Baeza-Yates, Yahoo! Research

KDD-09 Second Call for Research Papers


KDD-2009: The Fifteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’09)

Paris, France
June 28 – July 1, 2009.



The annual ACM SIGKDD conference is the premier international forum for data mining researchers and practitioners from academia, industry, and government to share their ideas, research results and experiences. KDD-09 will feature keynote presentations, oral paper presentations, poster sessions, workshops, tutorials, panels, exhibits, demonstrations, and the KDD Cup competition.

We invite submissions on all aspects of knowledge discovery and data mining.
We especially encourage papers relevant to KDD that cut across disciplines such as machine learning, pattern recognition, statistics, databases, theory, mathematical optimization, data compression, cryptography, and high performance computing. Papers are expected to describe innovative ideas and solutions that are rigorously evaluated and well-presented. Submissions that describe minor variations of existing methods or only make small or questionable improvements to existing algorithms are discouraged.

Important dates:

***Note the earlier submission deadlines***
Abstract submission: February 2, 2009
Paper submission: February 6, 2009
Notification: April 10, 2009
Conference dates: June 28 – July 1, 2009

Areas of interest include, but are not limited to:

Novel data mining algorithms
Data mining foundations
Innovative applications of data mining
Data mining and KDD systems and frameworks Mining data streams and sensor data Mining multi-media data Mining social networks and graph data Mining spatial and temporal data Mining biological and biomedical data Mining text, Web, semantic web and semi-structured data Mining dynamic data Pre-processing and post-processing in data mining Robust and scalable statistical methods Security, privacy, and adversarial data mining High performance and parallel/distributed data mining Mining tera-/peta-scale data Visual data mining and data visualization Data integration issues in mining Data and knowledge provenance in KDD

All submitted papers will be judged based on their technical merit, rigor, significance, originality, repeatability, relevance, and clarity. Papers submitted to KDD’09 should be original work, not previously published in a peer-reviewed conference or journal. Substantially similar versions of the paper submitted to KDD’09 should not be under review in another peer-reviewed conference or journal during the KDD-09 reviewing period.

Repeatability guideline:

Repeatability is a cornerstone of any scientific endeavor. To ensure the long term viability of the research output of the SIGKDD community, we require open-source/public distribution of the code and the datasets. In those cases where this is not possible due to proprietary considerations, every effort should be made to provide the binary executable. If proprietary datasets are used, every effort should also be made to apply the approach to similar publicly available datasets. Furthermore, the description of experimental results in submitted papers should be accompanied by all relevant implementation details and exact parameter specifications.

Peter Flach and Mohammed J. Zaki
KDD’09 Program Co-Chairs

John Elder and Francoise Soulie Fogelman General Chair

KDD-09 Call for Panel Proposals


The 2009 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’09)

June 28 – July 1st, 2009. Paris, France.

The KDD-2009 organizing committee invites proposals for panels to be held at the conference. Panel proposals should address emerging, controversial and critical issues in data mining that would likely to have a lasting impact on the field and would also lead to exciting discussions and debates. A mix of industry, academic and government participants is encouraged.

For this year´s conference we are interested in addressing new topics, particularly centered around human issues related to data mining (e.g., privacy, ethics, cultural differences, applications and implications of data mining on end users, etc.).

Proposal Details:
Panel proposals should be no more than four pages long and should include the following:

– Title of the panel
– The topic and issues to be discussed in the panel
– Name, affiliation, and contact information for the panel organizer
– Names and affiliations of up to four panelists (in addition to the panel
organizer) who have made a commitment to participate
– List of 10 questions that the panel organizer will ask the panelists
– Brief biography of each participant

IMPORTANT: the KDD 09 panels will be summarized in a paper that will be published in the conference proceedings. Therefore, the panel organizer will be requested to collect from the panelists, in writing, the responses to some of the questions well in advance of the conference. The conference panel chair (A. Jaimes) will collect the materials and work with the panel organizers selected to produce the paper. The motivation for having the paper is two-fold: make the panelists´ perspectives available after the conference, and ensure that panelists (and audience) give considerable thought to the issues prior to the panel.

Panel proposals should be sent by e-mail in PDF or ASCII format to the Panel Chair Alejandro Jaimes (ajaimes AT before February 23rd.

KDD’09 Call for Tutorial Proposals



The 2009 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’09)

June 28 – Jult 1st, 2009. Paris, France.

KDD’09 will host tutorials covering topics in data mining of interest to the research community as well as application developers. The tutorials will be part of the main conference technical program, and are free of charge to the attendees of the conference.

We invite proposals for half-day tutorials from active researchers and experienced tutors. Ideally, a tutorial will cover the state-of-the-art research, development and applications in a specific data mining direction, and stimulate and facilitate future work. Tutorials on interdisciplinary directions, novel and fast growing directions, and significant applications are highly encouraged. Accepted tutorials will receive one free registration to the conference and an honorarium of $500.

A tutorial proposal should be formatted in the following sections.

1. Title

2. Abstract (up to 150 words)

3. Target audience and prerequisites. Proposals must clearly identify the intended audience for the tutorial (e.g., novice users of statistical techniques, or expert researchers in text mining). What background will be required of the audience? Why is this topic important/interesting to the KDD community? What is the benefit to participants?

4. Outline of the tutorial. Enough material should be included to provide a sense of both the scope of material to be covered and the depth to which it will be covered. The more details that can be provided, the better (up to and including links to the actual slides). Note that the tutors should NOT focus mainly on their own research results. A KDD tutorial is not a forum for promoting one’s research or product.

5. A list of forums and their time and locations if the tutorial or a similar/highly related tutorial has been presented by the same author(s) before, and highlight the similarity/difference between those and the one proposed for KDD’08 (up to 100 words for each entry)

6. A list of tutorials on the same/similar/highly related topics given by other people, and highlight the difference between yours and theirs (up to 100 words for each entry)

7. A list of other tutorials given by the authors, please list the titles, the presenters and the forums only.

8. Tutors’ short bio and their expertise related to the tutorial (up to 200 words per tutor)

9. A list of up to 20 most important references that will be covered in the tutorial

10. (Optional) URLs of the slides/notes of the previous tutorials given by the authors, and any specific audio/video/computerrequirements for the tutorial.

Important dates for the tutorials:

-Proposals due: March 15

-Notification of Acceptance: May 25

Please send your submission to bart.goethals (at)

Tutorials Chair Bart Goethals

Vision and Sports Summer School 2009

Zurich, 17-21 August 2009
application deadline: 10 May 2009


Vision and Sports is a special special kind of summer school. In addition to a broad-range of lectures on state-of-the-art Computer Vision techniques, it offers exciting sport activities, such as Kung-Fu, Ultimate Frisbee, and Volleyball. Sports will be organized by the same internationally renowned experts who deliver the lectures. The school offers the best of both worlds to participants: high-quality teaching on Computer Vision, and lots of fun with a variety of attractive sports. This will offer plenty of opportunity for personal contact between students and teachers.

The Vision and Sports Summer School will cover a broad range of subjects, reflecting the diversity of Computer Vision. Each lecture will cover both basic aspects and state-of-the-art research. Every day there will two Computer Vision classes and one sports session. The classes will include both lectures and practical exercises.

The school is open to about 40 participants, and is targeted mainly to young researchers (Master students and PhD students in particular).


Jiri Matas
Czech Technical University

Marc Pollefeys
ETH Zurich

Carsten Rother
Microsoft Cambridge

Bodo Rosenhahn
University of Hannover

Christoph Lampert
MPI Tuebingen

Bastian Leibe
TU Aachen

Vittorio Ferrari
ETH Zurich


Topics will include:

Local feature extraction
Multi-view geometry
3D reconstruction
Large-scale specific object recognition
Appearance-based object categorization
Shape representation and matching
Contour-based object categorization
Kernel Methods for Computer Vision
Markov Random Fields and Conditional Random Fields for Computer Vision
3D human pose estimation


Tennis, Volleyball, Ultimate Frisbee, Kung-Fu, Unihockey, Table Tennis


The school is open to about 40 participants. Please apply online at

Although priority will be given to young researchers (Master/PhD students in particular), applications from senior researchers and industrial professionals are welcome as well. The registration fee is expected to be around 300 Euro. This fee will include all classes, sports activities, coffee breaks, lunches, and a social dinner. For hotel accommodation, students will get discount rates on hotels affiliated with the Summer School.

Applicants should apply before 10 May 2009.
Notification of acceptance will be sent by 31 May 2009.


PostDoc on road traffic datamining at Mines ParisTech

Applications are invited for a post-doctoral position in road traffic datamining and prediction, for 15 month starting within S1 2009, at Robotics Lab. of Mines ParisTech (Paris, France).

The robotics laboratory (CAOR) of Mines ParisTech, associated with IMARA project of INRIA in LaRA « Joint Research Unit », has been involved in 2 big European projects (REACT and COM2REACT) using V2I (Vehicle toInfrastructure) and V2V (Vehicle To Vehicle) communications for enhancing global « road information system ». In these projects the 2 labs worked in particular on analysis and prediction of traffic for improving preventive re-routing strategies in order to reduce congestions. An algorithm has been developed for reconstructing and predicting traffic from a fleet of « sensor » vehicles regularly sending position/speed/traffic information.
CAOR has just started, again with IMARA, and together with TAO project of INRIA and LET of Lyon, a new collaborative project sponsored by ANR (French national research funding agency). This project will focus on analysis and prediction of road traffic, first on realistic simulated data (to be produced with Metropolis software developed by LET), then on real data.

Research work description
The work to do is firstly data-mining of traffic data, seen as a graph whose each edge is a road section with associated traffic level (mean speed, travel time or congestion level), in order to extract common traffic patterns. For this « pattern mining », the idea is to test various clustering methods, in particular unsupervised training algorithms, such as Kohonen maps and K-means, so as to identify main « attractor » states and/or usual traffic states.
Then, the candidate should try to build a simplified dynamic model, as prediction of transitions between identified patterns. In particular, the possibility to exploit fully the graph structure of roads network shall be examined, by experimenting “graph kernel methods” recently developed and mainly applied in the context of bioinformatics.
A possible extension is analysis of road network as a complex dynamical system (bifurcation diagram, etc…).

The candidate should hold a good PhD in the field of statistical machine-learning and/or data-mining, with:
• Very good knowledge of data mining and analysis techniques, as well as of machine-learning methods;
• Good knowledge in probabilities and statistics (in particular Markovian models);
• Some knowledge on graphs and associated algorithms;
• Good computer programming skills (C/C++/Java)

Speaking French is not absolutely mandatory, but would be a plus.

Duration and date
Duration of post-doctoral contract is 15 month, starting within first semester 2009.

Supervision and contact :
Fabien Moutarde, (+33), Fabien.Moutarde (at)

To apply:
Candidates must send a detailed CV, with a cover letter, main publications (or links), together with name and contact of at least 2 references, to above e-mail address.

The Analysis of Patterns – Call for Participation

You are invited to participate in the third course on:

Pula Science Park (Cagliari)
Pula, Italy
September 27th – October 3rd, 2009

Organizers: Nello Cristianini, Fabio Roli, Tijl de Bie


* Florent Nicart – Université de Rouen
* Jean Philippe Vert – Mines Paris Tech
* John Shawe-Taylor – University College London
* Nello Cristianini – University of Bristol
* Bart Goethals – University of Antwerp
* Elisa Ricci, Idiap
* Fabio Roli, University of Cagliari

+ Research Seminars (to be announced)


Every aspect of modern society has been affected by the data revolution. Cheap collection, storage and transmission of vast amounts of information have revolutionized the practice of science, technology and business. Ideas from various disciplines have been deployed to help in the task
of designing computer systems that can automatically detect and exploit useful regularities (patterns) in general types of data.

This is the third meeting of a series devoted to pursuing a unified theoretical description of the various branches of Pattern Analysis. These include statistical approaches to pattern recognition,
combinatorial approaches to pattern matching, grammatical representations of structures, and many more fields of mathematics and computer science. The summer school will aim to emphasize a fundamental unity in goals and methods in all these diverse fields, to enhance our understanding of the central principles of pattern analysis, and to assist in the development of new pattern analysis approaches.

The meeting is interdisciplinary in nature, and can be seen both as a School for advanced students, and as a Workshop for researchers. Leading researchers in various subfields of pattern analysis will hold tutorials on their subject area, while new ideas will be presented in poster sessions, discussions and short seminars. Students in machine learning, pattern recognition, statistics, optimization, data mining, bioinformatics, are particularly encouraged to apply.

The registration fee for the School is 680 Euro per person for a double room (820 Euro for a single room) and includes 7 nights accommodation, meals and school fees.

Attendance is limited to 50 students and will be allocated on a first-come-first-served basis.

Registrations will open in february 2009.

Final Call for ICML/UAI/COLT 2009 Workshop Proposals

Montreal, Canada, June 18 2009
Proposal Deadline: Mon 19 Jan, 2009
Acceptance Notification: February 2, 2009

The ICML, UAI, and COLT conferences will be colocated in Montreal June
14-21 2009. We solict proposals for workshops to be held during a single joint workshop day on June 18. This date lies between ICML (June 14-17) and UAI/COLT (June 19-21). Workshops will be selected on the basis of their interest to the attendees of one or more of the conferences.

The goal of the workshops is to provide an informal forum for researchers to discuss important research questions and challenges. Controversial issues, open problems, and comparisons of competing approaches are encouraged. Representation of alternative viewpoints and panel-style discussions are also encouraged.

* Organization

The format, style, and content of accepted workshops is under the control of the workshop organizers and largely autonomous from the main conferences. The workshops will be seven hours long and split into morning and afternoon sessions. Workshop organizers will be expected to manage the workshop content, specify the workshop format, be present to moderate the discussion and panels, invite experts in the domain, and maintain a website for the workshop. Workshop registration will be handled centrally by the main conferences with a single uniform registration fee and with registrants allowed to attend workshops other than the one they register for.

* Submission Instructions

Proposals should specify clearly all of the following:

* the workshop’s title (what is it called?)
* topic (what is it about?)
* motivation (why a workshop on this topic?)
* impact and expected outcomes (what will having the workshop do?)
* potential invited speakers (who might come?)
* a list of related publications (where can we learn more?)
* main workshop organizer (who is making it happen?)
* other organizers (who else is making it happen?)
* workshop URL (where will interested parties get more information?)
* relevant conferences (which of ICML, UAI, and COLT would it appeal to?)

Please also provide brief CVs of all organizers.
This information should be sent by email (in plain text or pdf format) to
Icml-uai-colt-workshops09 (at)
by 19 Jan 2009.

Jeff Bilmes and Andrew Ng: UAI co-chairs Sham Kakade: COLT workshops chair Chris Williams: ICML 2009 workshops chair