Call For Papers
------------------------
MultiClust: Discovering, Summarizing and Using Multiple Clusterings
1/2 a day Workshop co-located with KDD 2010, Washington D.C
www.eecs.oregonstate.edu/research/MultiClust/
Confirmed Keynote speakers:
"Multi-Clust Systems: When Many Views are Better than One",
Joydeep Ghosh, University of Texas, Austin.
"Alternative Clusterings: Current Progress and Open Challenges.",
James Bailey, University of Melbourne.
Rich Caruana, Microsoft, USA (Topic to be announced)
Clustering has traditionally focused on finding a single
clustering solution that best summarizes the data. However,
there often exists multiple alternative structures in data and
traditional clustering algorithms are forced to make arbitrary
choices among different alternatives. Recently, there has
developed an emerging research direction in clustering that
tackles this limitation by finding multiple clustering
solutions from data. To avoid redundancy and excessive burden
on the data analyst, it is key to extract clustering solutions
that are informative yet non-redundant from one another. Toward
this goal, important research issues include, how to define
redundancy among clusterings, can existing algorithms be
modified to accommodate this goal, how many solutions should we
extract, how to select among exponentially many possible
solutions which solutions to present to the data analyst, and
how to most effectively help the data analyst find what he or
she is searching for. Research in this area is developing and
can benefit from well-established closely related areas, such
as ensemble clustering, constraint-based clustering,
compression and coding theory.
In this workshop, we plan to bring together the researchers
from the above research areas to discuss important issues in
multiple clustering discovery, compression and summarization.
Our objectives are to: 1) further increase the general
interest on this important topic in the broader research
community; 2) bring together experts from closely related areas
(e.g., cluster ensembles and constraint-based clustering) to
shed light on how this emerging new research direction can
benefit from other well-established areas; 3) provide a venue
for active researchers to exchange ideas and explore important
research issues in this area.
A dinner will be organized to continue the discussion
after the workshop.
We invite papers describing novel research dealing with
discovering, summarizing and using multiple clusterings and
related areas of interest, including but not limited to
* Alternative clustering: discovering new clusterings that are
different from previously known clusterings
* Algorithms for simultaneously learning multiple diverse
clusterings
* Visualization of multiple clusterings
* Interactive exploration of multiple clusterings
* Model selection for non-redundant clustering: how many
clusterings and how many clusters?
* Non-redundant frequent patterns
* Non-redundant subspace clustering
* Meta Clustering
* Relation between cluster ensembles and disparate clustering
* Constraint-based alternative clusterings
* Evaluation metrics for multiple clusterings
* Applications
In particular, we encourage submission of unpublished original
research papers, well written position papers (summarizing the
authors
own previous work and detailing their future research and research
questions),
and thought-provoking papers that would stimulate a discussion on the
future of the field.
Submissions should be made in the KDD 2010 paper format to
multiclu...@gmail.com. We are accepting position papers (2
pages), short papers (6 pages) and regular papers (9 pages). If you
are considering
submitting to the workshop and need further information, please do not
hesitate
to contact the PC chairs.
Key Dates:
Submission: 05/04/10
Acceptance: 05/25/10
Camera Ready Copies: 05/28/10
Workshop Date: 07/25/10 Afternoon
PC Chairs - Xiaoli Fern (
xf...@eecs.oregonstate.edu)
Ian Davidson (
davi...@cs.ucdavis.edu)
Jennifer Dy (
j...@ece.neu.edu)
Please go to
http://eecs.oregonstate.edu/research/multiclust/
for details.
PC Committee:
* Ira Assent (Aalborg University, Denmark)
* James Bailey (University of Melbourne)
* Arindam Banerjee (University of Minnesota, USA)
* Rich Caruana (Microsoft, USA)
* Chris Ding (University of Texas at Arlington, USA)
* Tao Li (Florida International University, USA)
* Emmanuel Muller(RWTH Aachen University, Germany)
* Naren Ramakrishnan
* Thomas Seidl (RWTH Aachen University, Germany)
* Alexander Topchy (Nielsen Media Research)
* Kiri Wagstaff (NASA - JPL, USA)
--
You received this message because you are subscribed to the Google Groups "Machine Learning News" group.
To post to this group, send email to
ml-...@googlegroups.com.
To unsubscribe from this group, send email to
ml-news+u...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/ml-news?hl=en.