Calls for Papers and Proposals

KDD 2019 Call for Workshop Proposals

The KDD 2019 organizing committee solicits proposals for full-day and half-day workshops to be held in conjunction with the main conference. The purpose of a workshop is to provide an opportunity for participants from academia, industry, government, and other related parties to present and discuss novel ideas on current and emerging topics relevant to knowledge discovery and data mining. The workshops will be scheduled on August 5th, 2019.


Each workshop should be organized under a well-defined theme focusing on emerging research areas, challenging problems, and/or industrial/governmental applications. The goal of the workshops is to provide an informal forum to discuss important research questions and practical challenges in data mining and related areas. Novel ideas, controversial issues, open problems, and comparisons of competing approaches are strongly encouraged as workshop topics. In particular, we would like to encourage organizers to avoid a mini-conference format by (i) encouraging the submission of position papers and extended abstracts, (ii) allowing plenty of time for discussions and debates, and (iii) organizing workshop panels.

Organizers have free control on the format, style, and the building blocks of the workshop. Possible contents of a workshop include but are not limited to invited talks, regular papers/posters, panels, and other pragmatic alternatives. In case workshop proposers need extra time to prepare their workshop, early decisions may be considered if justified.

Topics of Interest

Possible workshop topics include all areas of data mining and knowledge discovery, machine learning, statistics, and data and information sciences, but are not limited to these. Interdisciplinary workshops that explore the convergence of data mining and data sciences with various disciplines (such as health, medicine, biology, sustainability, ecology, social sciences, humanities, material science, or aerospace) are of high interest. Workshops in emerging areas are also highly sought, examples including interpretable machine learning, physics-guided machine learning, robustness of machine learning to adversarial attacks, Bayesian deep learning, fairness in machine learning, ethical and privacy aspects of data mining, computational social sciences, semi-supervised learning, heterogeneous machine learning, large scale computing, urban computing, political data analysis, fake news, Internet of Things, computational sustainability, interactive and visual analytics, and computational creativity.


Organizers of accepted workshops are expected to announce the workshop and disseminate calls for papers, make and maintain the workshop website, gather submissions, conduct the reviewing process, and decide upon the final workshop program. They are also required to prepare workshop proceedings to be distributed online on a website maintained by the workshop organizers. Workshop organizers may choose to form organizing or program committees aiming to accomplish these tasks successfully.

Note: Workshop papers will not be archived in the ACM Digital Library. However, workshop organizers may set up any archived publication mechanism that best suits their workshop.


The proposal should contain the following information:

  • The NAMES, AFFILIATIONS, and SHORT BIOS of all the organizers
  • The MAIN CONTACT organizer’s e-mail and telephone number
  • The TITLE of the workshop
  • A maximum of three paragraphs that describe the TOPIC of the workshop, its target AUDIENCE, and its RELEVANCE to SKGKDD.
  • One paragraph MOTIVATING the workshop (why we should organize it NOW in conjunction with KDD 2019)
  • Tentative names of invited speakers, reviewers, and panelists (where appropriate)
  • The desired LENGTH of the workshop: full-day (~8 hours) or half-day (~4 hours)
  • Tentative PROGRAM SKETCH, including tentative descriptions of all workshop components (panels,discussion sessions, poster sessions, invited talks, etc.)
  • If you wish to deviate from the suggested deadlines below (see “Deadlines and Dates”), a tentative TIMELINE and motivation for why the suggested deadlines are not suitable.)
  • For workshops previously held at KDD or other conferences, details on venue, attendance and number of submissions/accepted papers from past editions
  • For new workshops, a list of possible attendees/submissions and/or a justification of the expected attendees/submissions
  • A list of possible venues (e.g., mailing lists, social media) to advertise the proposed workshop
  • Include the link to the CFPs for paper submission from past editions (for workshops previously held at KDD or other conferences).
  • (Optional): Append a tentative CFP for paper submission at the end of the proposal (for new workshops).

Workshop proposals should be submitted by Friday February 22, 2019 at 11:59PM Alofi Time. Please prepare one single PDF that contains the aforementioned contents and submit it via EasyChair. The submission website is:

Deadlines and Dates

Workshop proposal dates:

  • Workshop proposal submissions: February 22, 2019
  • Workshop proposal notifications: March 14, 2019

Suggested workshop paper submission dates:

For consistency, all workshop deadlines should be set at 11:59 PM Pacific Standard Time. Furthermore, unless impractical and clearly motivated, all workshops should adhere to the following deadlines for their paper submissions and notifications.

  • Workshop paper submissions: May 5, 2019
  • Workshop paper notifications: June 1, 2019

Practical workshop organization dates:

  • Workshop Website and CFP: March 23, 2019
  • Notifications to Workshop Chairs (number of papers and acceptance rate): June 6, 2019
  • Final submission of workshop program and materials and full workshop websites online: June 22, 2019
  • Workshop date: August 5, 2019

How can we assist you?

We'll be updating the website as information becomes available. If you have a question that requires immediate attention, please feel free to contact us. Thank you!

Please enter the word you see in the image below: