Appel: Workshop FCA4AI 2013 at IJCAI 2013

Thierry Hamon thierry.hamon at UNIV-PARIS13.FR
Fri Mar 22 21:12:06 UTC 2013


Date: Thu, 21 Mar 2013 12:53:30 +0100 (CET)
From: Amedeo Napoli <amedeo.napoli at loria.fr>
Message-ID: <179708206.5866033.1363866810542.JavaMail.root at loria.fr>
X-url: http://www.fca4ai.hse.ru

With apologies for cross-posting. 

------------------------------------------------------------------------
Call for Papers 
------------------------------------------------------------------------

--FCA4AI-- 
``What can FCA do for Artificial Intelligence?'' 
(Second Edition) 
co-located with IJCAI 2013 

August 3-5, 2013 

Beijing, China 

http://www.fca4ai.hse.ru 

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

General 

The first edition of the FCA4AI Workshop at ECAI 2012 in Montpellier
showed that many researchers working in Artificial Intelligence are
indeed interested by a powerful method for classification and mining
such as Formal Concept Analysis (http://ceur-ws.org/Vol-939/). We have
the chance to organize a new edition of the workshop in Beijing at the
IJCAI 2013 Conference.

Formal Concept Analysis (FCA) is a mathematically well-founded theory
aimed at data analysis and classification. FCA allows one to build a
concept lattice and a system of dependencies (implications) which can be
used for many AI needs, e.g. knowledge processing involving learning,
knowledge discovery, knowledge representation and reasoning, ontology
engineering, and as well as information retrieval and text processing.
Thus, there exist many ``natural links'' between FCA and AI.

Recent years have been witnessing increased scientific activity around
FCA, in particular a strand of work emerged that is aimed at extending
the possibilities of FCA w.r.t. knowledge processing, such as work on
pattern structures and relational context analysis. These extensions are
aimed at allowing FCA to deal with more complex than just binary data,
both from the data analysis and knowledge discovery point of view and
from the knowledge representation point of view, including, e.g.,
ontology engineering.
All these works extend the capabilities of FCA and offer new
possibilities for AI activities in the framework of FCA.

Accordingly, in this workshop, we will be interested in two main issues:

- How can FCA support AI activities such as knowledge processing
  (knowledge discovery, knowledge representation and reasoning),
  learning (clustering, pattern and data mining), natural language
  processing, information retrieval.

- How can FCA be extended in order to help AI researchers to solve new
  and complex problems in their domain.

The workshop is dedicated to discuss such issues. 

INVITED SPEAKER 
TBA 

TOPICS OF INTEREST include but are not limited to: 

- Concept lattices and related structures: description logics, pattern
  structures, relational structures.
- Knowledge discovery and data mining with FCA: association rules,
  itemsets and data dependencies, attribute implications, data
  pre-processing, redundancy and dimensionality reduction,
  classification and clustering.
- Knowledge engineering and ontology engineering: knowledge
  representation and reasoning.
- Scalable algorithms for concept lattices and artificial intelligence
  ``in the large'' (distributed aspects, big data).
- Applications of concept lattices: semantic web, information retrieval,
  visualization and navigation, pattern recognition.

The workshop will include time for audience discussion for having a
better understanding of the issues, challenges, and ideas being
presented.

IMPORTANT DATES: 

Submission deadline: May 13, 2013 
Notification: June 17, 2013 
Final version: July 08, 2013 
Workshop: August 03-05, 2013 


SUBMISSION DETAILS: 

The workshop welcomes submissions in pdf format in Springer's LNCS
style.
Submissions can be 
- technical papers not exceeding 8 pages, 
- system descriptions or position papers on work in progress not 
  exceeding 4 pages 

Submissions are via EasyChair at 
https://www.easychair.org/conferences/?conf=fca4ai2013 

The workshop proceedings will be published as CEUR proceedings. 
A selection of the best papers presented at the workshop will be
considered for a special issue of a high-level journal. 

WORKSHOP CHAIRS: 

- Sergei O. Kuznetsov Higher Schools of Economics, Moscow, Russia 
- Amedeo Napoli LORIA-INRIA, Vandoeuvre les Nancy, France 
- Sebastian Rudolph AIFB Karlsruhe Institute of Technology, Karlsruhe,
  Germany


PROGRAM COMMITTEE (in constitution) 

Mathieu D'Aquin, Open University, Milton Keynes, UK 
Franz Baader, Technische Universitaet Dresden, Germany 
Radim Belohlavek, Palacky University, Olomouc, Czech Republic 
Claudio Carpineto, Fondazione Ugo Bordoni, Roma, Italy 
Felix Distel, Technische Universitaet Dresden, Germany 
Sébastien Ferré, IRISA Rennes, France 
Bernhard Ganter, Technische Universitaet Dresden, Germany 
Pascal Hitzler, Wright State University, Dayton, Ohio, USA 
Marianne Huchard, LIRMM Montpellier, France 
Dmitry I. Ignatov, Higher School of Economics, Moscow, Russia 
Mehdi Kaytoue, Universidade Federal Minas Gerais, Belo Horizonte, Brazil 
Markus Krötzsch, University of Oxford, UK 
Sergei A. Obiedkov, Higher Schools of Economics, Moscow, Russia 
Uta Priss, Ostfalia University of Applied Sciences, Wolfenbüttel, Germany 
Baris Sertkaya, SAP Dresden, Germany, 
Gerd Stumme, Universitaet Kassel, Germany 
Petko Valtchev, Université du Québec à Montréal, Montréal, Canada 

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

-------------------------------------------------------------------------
Message diffuse par la liste Langage Naturel <LN at cines.fr>
Informations, abonnement : http://www.atala.org/article.php3?id_article=48
English version       : 
Archives                 : http://listserv.linguistlist.org/archives/ln.html
                                http://liste.cines.fr/info/ln

La liste LN est parrainee par l'ATALA (Association pour le Traitement
Automatique des Langues)
Information et adhesion  : http://www.atala.org/
-------------------------------------------------------------------------



More information about the Ln mailing list