Search Results for author:
Found 3 papers, 0 papers with code
Concept and Attribute Reduction Based on Rectangle Theory of Formal Concept
Second, we derive the bounds for both the maximum number of relative necessary concepts and the maximum number of unnecessary concepts and it is a difficult problem as either in concept reduction preserving binary relations or attribute reduction of decision formal contexts, the computation of formal contexts from formal concepts is a challenging problem.
Granule Description based on Compound Concepts
Concise granule descriptions for definable granules and approaching descriptions for indefinable granules are challenging and important issues in granular computing.
A New Algorithm based on Extent Bit-array for Computing Formal Concepts
The emergence of Formal Concept Analysis (FCA) as a data analysis technique has increased the need for developing algorithms which can compute formal concepts quickly.
