$37.50
It plays an essential role in the application of concept lattice. This paper presents a fast, efficient, incremental algorithm to compute formal concepts.
It plays an essential role in the application of concept lattice. This paper presents a fast, efficient, incremental algorithm to compute formal concepts.
This paper provides an approach to generate transformation rules from a set of models semi-automatically by using a formal concept analysis (FCA) that is a ...
Efficient tool and platform for several areas, concept lattice are widely used in many fields of research. Dynamic environment requires an incremental ...
Jan 1, 2014 · Dynamic environment requires an incremental algorithm to build formal concepts. It plays an essential role in the application of concept lattice ...
It plays an essential role in the application of concept lattice. This paper presents a fast, efficient, incremental algorithm to compute formal concepts.
It plays an essential role in the application of concept lattice. This paper presents a fast, efficient, incremental algorithm to compute formal concepts.
The main goal of the research work is to analyse the different incremental methods and to optimize their efficiency. The proposed method is based on the novel ...
People also ask
What is the most efficient algorithm efficiency?
What is an example of an incremental algorithm?
Feb 25, 2019 · In this paper, an efficient and rapid incremental concept lattice construction algorithm is proposed. The algorithm, named FastAddExtent, is ...
Missing: Swiftly | Show results with:Swiftly
In this paper, we propose an efficient incremental algorithm for concept lattice construction. The algorithm, called FastAddIntent, results as a modification of ...