.png){kind=icon}
Return
Bit-Close: a fast incremental concept calculation method
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-024-05272-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The theory of Formal Concept Analysis (FCA) finds diverse applications in fields like knowledge extraction, cognitive concept learning and data mining. The construction of a concept lattice significantly influences the effectiveness of formal concept analysis; hence, the development of high-performance algorithms for concept construction is crucial. In this paper, we introduce a novel algorithm called Bit-Close for formal concept construction. Bit-Close leverages bit representation and operations, fundamental to computer science, to enhance the In-Close algorithm. Furthermore, we explore the parallel method of Bit-Close. Our experimental results, obtained from multiple public and random datasets, demonstrate that Bit-Close outperforms In-Close by approximately 20% and is significantly better than other competing algorithms.
Keywords:
Formal concept analysis
Construction algorithm
In-Close
Bit-Close
Parallelization
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
No organization information available
Cited Papers
Enzymatic Thioxyloside Synthesis: Characterization of Thioglycoligase Variants Identified from A Site‐Saturation Mutagenesis Library of Bacillus Circulans Xylanase.png)
ChemBioChem
ChemBioChemIF0
PREAI
ShareSaveShareSaveShareSaveShareSave
View more