This Title All WIREs
How to cite this WIREs title:
WIREs Data Mining Knowl Discov
Impact Factor: 7.250

A comprehensive review on updating concept lattices and its application in updating association rules

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

Abstract Formal concept analysis (FCA) visualizes formal concepts in terms of a concept lattice. Usually, it is an NP‐problem and consumes plenty of time and storage space to update the changes of the lattice. Thus, introducing an efficient way to update and maintain such lattices is a significant area of interest within the field of FCA and its applications. One of those vital FCA applications is the association rule mining (ARM), which aims at generating a loss‐less nonredundant compact Association Rule‐basis (AR‐basis). Currently, the real‐world data rapidly overgrow that asks the need for updating the existing concept lattice and AR‐basis upon data change continually. Intuitively, updating and maintaining an existing concept‐lattice or AR‐basis is much more efficient and consistent than reconstructing them from scratch, particularly in the case of massive data. So far, the area of updating both concept lattice and AR‐basis has not received much attention. Besides, few noncomprehensive studies have focused only on updating the concept lattice. From this point, this article comprehensively introduces basic knowledge regarding updating both concept lattices and AR‐basis with new illustrations, formalization, and examples. Also, the article reviews and compares recent remarkable works and explores the emerging future research trends. This article is categorized under: Algorithmic Development > Association Rules Fundamental Concepts of Data and Knowledge > Knowledge Representation Technologies > Association Rules
Formal context
[ Normal View | Magnified View ]
Updated concept lattice L after inserting object g = {O7}, g = {C, D} to concept lattice L shown in Figure 2
[ Normal View | Magnified View ]
FFCA taxonomy
[ Normal View | Magnified View ]
Iceberg lattice Extracted from formal context in Table 4 with minsup = 60%
[ Normal View | Magnified View ]
Formal concept lattice extracted from formal context in Table 4
[ Normal View | Magnified View ]

Browse by Topic

Technologies > Association Rules
Fundamental Concepts of Data and Knowledge > Knowledge Representation
Algorithmic Development > Association Rules

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts