What is it about?

The problem is related to application of Formal Concept Analysis. Based on the performed tests, it dominates the other popular batch or incremental methods for sparse contexts. For dense contexts, the extended version of the proposed method, which integrates the InClose algorithm for processing of reduced contexts, provides a superior efficiency. Especially good results are experienced for symmetric contexts in the case of word clustering using context-based similarity.

Featured Image

Why is it important?

Suitable for both attribute and object level incremental context extensions, It provides an efficient algorithm for incremental concept set construction for concept management in knowledge engineering applications.

Perspectives

It can be used to enhance the efficiency of knowledge and ontology oriented information engineering.

Laszlo Kovacs
Miskolci Egyetem

Read the Original

This page is a summary of: An Algorithm using Context Reduction for Efficient Incremental Generation of Concept Set, Fundamenta Informaticae, February 2019, IOS Press,
DOI: 10.3233/fi-2019-1776.
You can read the full text:

Read

Contributors

The following have contributed to this page