Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = update of negative concept lattices

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
14 pages, 472 KiB  
Article
A Fast Algorithm for Updating Negative Concept Lattices with Increasing the Granularity Sizes of Attributes
by Junping Xie, Liuhai Zhang and Jing Yang
Mathematics 2023, 11(14), 3229; https://doi.org/10.3390/math11143229 - 22 Jul 2023
Cited by 2 | Viewed by 1275
Abstract
In this paper, firstly, we studied the relationship between negative concept lattices with increasing the granularity sizes of the attributes. Aiming to do this, negative concepts and covering relations were both classified into three types, and the sufficient and necessary conditions of distinguishing [...] Read more.
In this paper, firstly, we studied the relationship between negative concept lattices with increasing the granularity sizes of the attributes. Aiming to do this, negative concepts and covering relations were both classified into three types, and the sufficient and necessary conditions of distinguishing these kinds of negative concepts and covering relations are given, respectively. Further, based on the above analysis, an algorithm for updating negative concept lattices after the increase is proposed. Finally, the experimental results demonstrated that our algorithm performed significantly better than the direct construction algorithm. Full article
(This article belongs to the Special Issue Data Mining: Analysis and Applications)
Show Figures

Figure 1

Back to TopTop