---------------------------------------- ----------------------------------------

KDD-2000 Workshop on Text Mining

August 20, 2000

---------------------------------------- ----------------------------------------

Held at KDD-2000, Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 20-23, 2000, Boston, MA, USA

Call for papers (expired) on the following topics was open till May 15, 2000. We received 40 submissions that entered the review process. The list of pre-registered workshop attendees contains about 80 names.

Workshop Schedule, Workshop Proceedings and the list of accepted papers are available on the Web as well as the Workshop Summary (to appera in SIGKDD Explorations, January 2001).

Topics of interest

The objective of this workshop is to enable presentation and exchange of ideas on various aspects of Text Mining. Our desire is to facilitate communication among researchers and practitioners from related and complementary research areas, who are working on similar problems but with possibly different focus and problem solving approaches. More precisely, we invite papers from the four areas:

Particular topics of interest for the workshop include but are not limited to:

Workshop schedule

The workshop consists of two invited talks, presentation of refereed papers and posters, and discussions. We hope that the program will stimulate future collaboration among researchers on text mining problems.



Program Chairs

Marko Grobelnik
J.Stefan Institute, Jamova 39, 1000 Ljubljana, Slovenia

Dunja Mladenic
J.Stefan Institute, Jamova 39, 1000 Ljubljana, Slovenia and Carnegie Mellon University, School of Computer Science, Pittsburgh, USA, 5000 Forbes Ave, Pittsburgh, PA 15213, USA

Natasa Milic-Frayling
Microsoft Research Ltd, St. George House, 1 Guildhall Street Cambridge, CB2 3NH, United Kingdom

Program Committee

This Workshop is partially supported by the European FP5 project "Data Mining and Decision Support for Business Competitiveness: A European Virtual Enterprise (Sol-Eu-Net)". ----------------------------------------