Affiliation:
1. Hebei Normal University
Abstract
Abstract
Based on granularity tree, this paper studies the changes of association rules before and after attribute granularity transformation in formal context, and proposes zoom algorithms to update association rules. The zoom-in algorithm is to change the granularity of the attribute from coarse to fine, and the zoom-out algorithm is to change the granularity of the attribute from fine to coarse. According to the zoom algorithms, it can directly operate on the association rules in the original formal context by using concepts as a bridge to generate association rules in the new context. Which can reduce the reconstruction process of the concept lattice when the granularity of attributes changes. The experimental results show that the algorithm proposed in this paper greatly reduces the computational workload, and shortens the running time than the classical algorithm flow.
Publisher
Research Square Platform LLC
Reference42 articles.
1. Concept lattices and conceptual knowledge systems;Wille R;Comput Math Appl,1992
2. Ganter B, Wille R (1999) Formal concept analysis: Mathematical Foundations. Springer-Verlag, New York
3. Restructuring lattice theory:an approach based on hierarchies of concept;Wille R;Orderd Sets D Reidel,2009
4. Formal concept analysis with background knowledge:attribute priorities;Belohlavek R;IEEE Trans Systems Man Cybernet,2009
5. Toward human level machine intelligence-is it achievable? The need for a paradigm shift;Zadeh LA;IEEE Comput Intell M,2009