The International Workshop on Algorithms for FCA and Data Mining (AFCADM 2016)

NEW: Venue

The workshop session will be held at the main venue (Myasnitskaya 11) in room 426.

Overview

What are current challenges in implementations of algorithms related to FCA? Can we evaluate the efficiency of modern algorithms implementations and compare theoretical and experimental estimates of computational complexity? What data formats should be supported by software components of systems in the field of FCA applications? We would like to get answers to such questions.
The workshop is going to bring together the community of FCA researchers and programmers. This will give an opportunity to get and share new ideas and approaches, to assess project solutions from different points of view, to discuss algorithmic problems, and to check the current state of the art in the field.

AFCADM workshop will be collocated with CLA-2016 in Moscow.

The workshop welcomes original FCA algorithms, their implementations and linked software components.

Workshop structure

Workhop consists of three parts:
1. Systems presentation
2. Algorithms benchmarks
3. Disscussion

Important dates

Paper submission: July 10, 2016
Notification of acceptance/rejection: July 13, 2016
Camera-ready copy: July 16, 2016
Workshop: July 18, 2016

Paper format

Springer LNCS format, 1-12 pages long.

Workshop chairs

Alexey A. Neznanov, NRU HSE, Russia (aneznanov@hse.ru).
Andrey A. Parinov, NRU HSE, Russia (aparinov@hse.ru).
Sergei O. Kuznetsov, NRU HSE, Russia (skuznetsov@hse.ru).

Program committee

Jan Outrata, Palacky University (Poland)
Simon Andrews, Sheffield Hallam University (United Kingdom)
Uta Priss, Ostfalia University of Applied Sciences (Germany)
Amedeo Napoli, LORIA research laboratory in Nancy (France)
Mehdi Kaytoue, INSA Lyon (France)
Rokia Missaoui, UQO (Canada)
Daniel Borchman, TU Dresden (Germany)
Mikhail Babin, Google (USA)
Aleksey Buzmakov, NRU HSE (Russia)

FCA software related workshop topics

Original FCA algorithms implementations in various application fields (SNA, Text Mining, etc.).
Implementations of high performance parallel algorithms.
Definition and construction of benchmarks.
FCA data formats conversion and tools interoperability.
- Common and special data formats for FCA-related tasks.
- Format validity testers.
- Format converters.
Data preprocessing (Data tidying) for FCA tasks.

Proceedings

All accepted papers will be included in the workshop’s proceedings to be published online on the CEUR-Workshop web site in a volume with ISSN and indexed by Scopus.

Submission Procedure

Electronic version of full paper complete with authors’ affiliations should be submitted through the conference electronic submission system.
Use the submission link http://www.easychair.org/conferences/?conf=afcadm2016.
Manuscripts must be prepared with LaTeX or Microsoft Office and should follow the Springer format available at http://www.springer.de/comp/lncs/authors.html.
The maximum number of accepted papers by an individual author that can be covered by the workshop’s registration charge is 3. The papers over 12 pages are not allowed.

Accepted Papers

Simon Andrews, Optimization Approaches for the Implementation of CbO-Type Algorithms
Simin Jabbari and Kilian Stoffel, A Hybrid Algorithm for Generating Formal Concepts and Building Concept Lattice Using NextClosure and Nourine Algorithms
Simin Jabbari and Kilian Stoffel, Parallel Execution of Binary-Based NextClosure Algorithm
Aleksey Buzmakov, FCAPS: a modular console Application for Pattern Structures

Program

14:00 - 14:20. Simon Andrews, Optimization Approaches for the Implementation of CbO-Type Algorithms
14:20 - 14:40. Simin Jabbari and Kilian Stoffel, A Hybrid Algorithm for Generating Formal Concepts and Building Concept Lattice Using NextClosure and Nourine Algorithms
14:40 - 15:00. Simin Jabbari and Kilian Stoffel, Parallel Execution of Binary-Based NextClosure Algorithm
15:00 - 15:20. Aleksey Buzmakov, FCAPS: a modular console Application for Pattern Structures