The 13th International Conference on Concept Lattices and Their Applications
Scope and Areas
CLA is an international conference dedicated to Formal Concept Analysis (FCA) and areas closely related to FCA such as data mining, information retrieval, knowledge management, data and knowledge engineering, logic, algebra and lattice theory. CLA provides a forum for researchers, practitioners, and students. The program of CLA consists of invited plenary talks, regular talks, and poster sessions. Papers in all areas relevant to theory and applications of FCA are solicited. Those areas include but are not restricted to:
- concept lattices and related structures,
- attribute implications and data dependencies,
- data preprocessing,
- redundancy and dimensionality reduction,
- information retrieval,
- association rules and other data dependencies,
The 13th International Conference on Concept Lattices and their Applications will be held in Moscow, Russia, and will be organized by National Research University Higher School of Economics.
Paper submission: March 25, 2016
Notification of acceptance/rejection: May 9, 2016
Camera-ready papers due: May 30, 2016
Conference: July 18-22, 2016
Paper Submission and Publication
Papers of up to 12 pages may be submitted in PDF or Postscript format. Papers need to be formatted using the Springer Lecture Notes in Computer Science style.
The submission is to be done via EasyChair.
All papers will be judged based on their technical merits, originality, relevance to areas of interest, and presentation clarity. Papers should describe original work that has not been published before, is not under review elsewhere, and will not be submitted elsewhere during CLA 2016's review period.
Accepted papers will be published in conference proceedings (with ISBN), available at the conference (printed) and at CEUR Workshop Proceedings and CLA Homepage (online).
Selected papers accepted to CLA 2016 will be invited to further revise and extend their work in a special issue of a well-established journal (name will come).