To be Held in Conjunction with
Second SIAM International Conference on Data Mining (SDM 2002)
Applications in various domains often lead to very high-dimensional data; the dimension of the data being in the hundreds or thousands, for example in text/web mining and bioinformatics. In addition to the high dimensionality, these data sets are also often sparse. Clustering such high-dimensional data sets is a contemporary challenge. Successful algorithms must avoid the curse of dimensionality but at the same time should be computationally efficient.
A one-day workshop on Clustering High Dimensional Data and its Applications is being held in conjunction with SDM 2002 in Arlington (April '02) to bring together researchers to present their current approaches and results in clustering high-dimensional data that arise in various applications. Particular areas of interest are text mining, clustering of bio-informatics data, market-basket and web log data.
Clustering Algorithms and Models
- Probabilistic Models
- Vector-space Models
- Graph-based Models
- Density based clustering (k-means, EM)
- Software and Toolkits
- Text Mining
- Feature selection
- Web log analysis
- Factor Analysis
Attendees are required to register for SDM 2002, but no separate registration is needed for this workshop.
Original papers on clustering high-dimensional data are solicited. For consideration, send an electronic submission (postscript or PDF versions printable on 8.5 x 11 paper only) to Jacob Kogan: email@example.com; phone: (410)-455-3297; fax: (410)-455-1066.
An email including the title, authors and abstract of the paper should be sent separately in plain ASCII format (no HTML-tags please).
To guarantee consideration, manuscripts must be received by January 14, 2002, and must be no more than 10 pages excluding figures, tables, and references. Submission of work in progress is also encouraged.
All accepted papers whose camera-ready copies are received by the Mar 1, 2002 deadline (see below) will be distributed as photocopied proceedings available at the conference for purchase by attendees. Electronic copies will also be put on a SIAM web site.
Select either Postscript or
Will be available later
Cliff Behrens, Telcordia Technologies
Paul Bradley, digiMine Inc.
Dan Boley , University of Minnesota
Kui-Yu Chang, Interwoven Inc., Austin.
Ming Gu, University of California, Berkeley.
George Karypis, University of Minnesota
Jon Kettenring, Telcordia Technologies
Shailesh Kumar, HNC
Edward Marcotte, Biochemistry Division, University of Texas
Dharmendra Modha, IBM Almaden Research Center
Ray Mooney, University of Texas, Austin
Nick Street, University of Iowa
Mark Teboulle, Tel-Aviv University
Department of Computer Science
University of Texas
Austin, TX 78712-1188
Phone: (512) 471-9725
Fax: (512) 471-8885
Department of Mathematics and Statistics
Univ. of Maryland, Baltimore County
Baltimore, MD 21250
Phone: (410) 455-3297
Fax: (410) 455-1066
Last modified on Oct 30, 2002.