ACM SIGCHI General Interest Announcements (Mailing List)


Options: Use Forum View

Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Giovanni Maria Sacco <[log in to unmask]>
Reply To:
Giovanni Maria Sacco <[log in to unmask]>
Tue, 15 Jan 2008 12:11:09 +0100
text/plain (110 lines)

FIND08 -- 2nd Int. Workshop on Dynamic Taxonomies and Faceted Search

Torino, Italy, September 1-5, 2008 (in conjunction with DEXA 2008)

Current search paradigms for the web, direct access via search engines 
and navigational access via static taxonomies,
have recently been strongly criticized. A third approach, dynamic 
taxonomies or faceted search, focuses on user-centered
conceptual exploration and is finally gaining acceptance to the extent 
that it is now the de facto standard in product
selection for e-commerce.
Dynamic taxonomies work on multidimensional taxonomies (usually 
organized by facets) and provide a single, coherent
visual framework in which users can focus on one or more concepts in the 
taxonomy, and immediately see a conceptual
summary of their focus, in the form of a reduced taxonomy derived from 
the original one by pruning unrelated concepts.
Concepts in the reduced taxonomy can be used to set additional, 
dependent foci and users iterate in a guided yet
unconstrained way until they reach a result set sufficiently small for 
manual inspection.
The access paradigm supported is a conceptual exploration, far more 
frequent in "search" tasks than the retrieval by
exact specification supported by search engines and database queries. 
The underlying model is simple and easily understood
by users, offers substantial benefits over traditional approaches and 
has an extremely wide application range and a
potential for important extensions.
This 1-day workshop will discuss all aspects of dynamic taxonomies and 
faceted search, from underlying technology to user
interfaces and commercial use, including demo systems and applications.

Topics of Interest:

Topics of interest include, but are not limited to the following areas:
·    Multidimensional/faceted taxonomy design
·    Automatic or semiautomatic multidimensional/faceted taxonomy 
creation from meta-data, from structured and
    unstructured documents or by social tagging
·    Extensions of dynamic taxonomies
·    Efficient and scalable indexing and retrieval
·    User interface issues
·    Emerging applications
·    Evaluation approaches and metrics

Important Dates:

Submission of papers:         15 March 2008
Notification of acceptance:     20 April 2008
Camera-ready copies:         15 May 2008

Submission Details:

Authors are invited to submit research contributions, practical 
experience reports and demos via the submission system at
Submissions must be in pdf and consist of no more than 5 pages in IEEE 
double column A4 format

Accepted papers will be published by IEEE CS Press.


Giovanni Maria Sacco, Università di Torino, Italy

Program Committee:

·    Anastasia Analyti, University of Crete, Greece
·    Giuseppe Berio, Università di Torino, Italy
·    Barbara Demo, Università di Torino, Italy
·    Sébastien Ferré, Université de Rennes, France
·    Jonathan Koren, University of California at Santa Cruz, USA
·    Saverio Perugini, University of Dayton, USA
·    Yannis Tzitzikas, University of Crete, Greece
·    Moritz Stefaner, University of Applied Sciences Potsdam, Germany
·    Yi Zhang, University of California at Santa Cruz, USA

Please see the workshop web site ( for further 
This workshop is organized by SIG-FIND, Special Interest and Research 
Group on Dynamic Taxonomies and Faceted Search

Prof. Giovanni M. Sacco
Dipartimento di Informatica
Universita' di Torino
Corso Svizzera 185, I-10149 Torino, Italy

Phone +39 0116706727
Fax +39 011751603  
email: [log in to unmask]

                To unsubscribe, send an empty email to
     mailto:[log in to unmask]
    For further details of CHI lists see