ontolog-forum
[Top] [All Lists]

[socop-forum] CFP FCA4AI Workshop at ECAI 2014 ``What can FCA do for Art

To: mailing-list-cla-2011@xxxxxxxx, fca-list@xxxxxxxxxxxxxxxx, cfp@xxxxxxxxxxxxx, conferences@xxxxxxxxxxxx, diagrams-owner@xxxxxxxxxxxxxxxxx, dl@xxxxxxxxx, editor@xxxxxxxxxxxxx, events_calendar@xxxxxxx, fg-db@xxxxxxxxxxxxxxxxxxxxxxxxx, kr@xxxxxx, nesy-list@xxxxxxxxxxxxxxxxxxx, onto@xxxxxxxxxxxxxxxxxxxxx, ontolog-forum@xxxxxxxxxxxxxxxx, ontology@xxxxxxxxxxx, ontology@xxxxxxxx, ontoquery@xxxxxx, rr-association-members@xxxxxxxxxxxx, semantic-web@xxxxxx, sw-announce@xxxxxxxxxxxxxxxxxx, sw-ergo@xxxxxxxxxxxxx, topicmapmail@xxxxxxxxxxxx, wi@xxxxxxxxxxxxxxxxxxxxx, PlanetKR@xxxxxx, cogsci-list@xxxxxxxxxxxxx, kdnet-members@xxxxxxxxxxxxxxxxxx, GSCL-Mitglieder@xxxxxxxx, corpora@xxxxxxxxx, sigwac@xxxxxxxxxxxxxxx, IRList@xxxxxxxxxxxxxxxx, mlnet@xxxxxxxxxxxxxxxxxx, nodali@xxxxxxxxxxx, data-mining@xxxxxxxxxxxxxxxx, datamining@xxxxxxxxxxxxxxxxx, info-ic@xxxxxxxxxxxxxxx, bull-i3@xxxxxxx, AI-SGES@xxxxxxxxxxxxxx, eccaisocieties08@xxxxxxxxx, cphc-conf@xxxxxxxxxxxxxx, bulletin@xxxxxxxxxxx, ml-news@xxxxxxxxxxxxxxxx, cscw-all@xxxxxxxxxxxxxx, gulp-all@xxxxxxxxxxxxxxx, grin-eventi@xxxxxxxxxxxxxxxxxxx, aixia@xxxxxxxx, editor1@xxxxxxxxxxxxx, uai@xxxxxxxxxxxxx, dmc@xxxxxxxxxxx, conferencemailinglist@xxxxxxxxx, dbitaly@xxxxxxxxxxxxxxxxxxxx, eetn@xxxxxxxxxxxxxxxxx, dbhellas@xxxxxxx, rede@xxxxxxxx, sbc-l@xxxxxxxxxx, kdml-admin@xxxxxxxxxxxxxxxx, ml-ugent@xxxxxxxxxxxxx, event@xxxxxxxxxxxxxxxxxx, fg-arc@xxxxxxxxxxxxxxxxxxxxxx
Cc: Amedeo Napoli <amedeo.napoli@xxxxxxxx>, Sergei Kuznetsov <skuznetsov@xxxxxxxxx>, Sebastian Rudolph <sebastian.rudolph@xxxxxxxxxxxxx>
From: Amedeo Napoli <amedeo.napoli@xxxxxxxx>
Date: Sat, 24 May 2014 13:34:35 +0200 (CEST)
Message-id: <1249073050.13345930.1400931275473.JavaMail.zimbra@xxxxxxxx>
-------------------------------------------------------------------------------------------------------------------
                                           Call for Papers
-------------------------------------------------------------------------------------------------------------------

                                       -- FCA4AI (Third Edition) --
                           ``What can FCA do for Artificial Intelligence?''
                             co-located with ECAI 2014, Prague, Czech Republic
                                           August 19 2014
                                      http://www.fca4ai.hse.ru

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

General Information.

The first and the second editions of the FCA4AI Workshop (ECAI 2012, Montpellier and IJCAI 2013, Beijing) showed that many researchers working in Artificial Intelligence are indeed interested by a powerful method for classification and mining such as Formal Concept Analysis (see http://ceur-ws.org/Vol-939/ and http://ceur-ws.org/Vol-1058/).
We have the chance to organize a new edition of the workshop in Prague at the ECAI 2014 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.

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 30, 2014
Notification to authors: June 23, 2014
          Final version: July 14, 2014
               Workshop: August 19, 2014


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=fca4ai2014 (opening soon)

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    Technische Universitaet Dresden, 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
Karell Bertet, Université de La Rochelle, France
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, LIRIS-INSA, University of Lyon, France
Markus Krötzsch, University of Oxford, UK
Sergei A. Obiedkov, Higher Schools of Economics, Moscow, Russia
Jan Outrata, Palacky University, Olomouc, Czech Republic
Uta Priss, Ostfalia University of Applied Sciences, Wolfenbüttel, Germany
Baris Sertkaya, SAP Dresden, Germany,
Henry Soldano, Université de Paris-Nord, France
Gerd Stumme, Universitaet Kassel, Germany
Petko Valtchev, Université du Québec à Montréal, Montréal, Canada

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


_________________________________________________________________
Msg Archives: http://ontolog.cim3.net/forum/socop-forum/   
Subscribe/Config: http://ontolog.cim3.net/mailman/listinfo/socop-forum/  
Unsubscribe: mailto:socop-forum-leave@xxxxxxxxxxxxxxxx
Community Shared Files: http://ontolog.cim3.net/file/work/SOCoP/ 
Community Wiki: http://ontolog.cim3.net/cgi-bin/wiki.pl?SOCoP     (01)
<Prev in Thread] Current Thread [Next in Thread>