Object-oriented interval-set concept lattices

Abstract Formal concept analysis and rough set are two kinds of efficient mathematical tools for data analysis and knowledge discovery. By combining these two theories, object-oriented and property-oriented concept lattices are proposed. Interval set theory is proposed to describe a partially-known concept by a lower bound and a upper bound. In order to obtain the more accurate extension and intension for a partially-known object-oriented concept, we introduce the theory of interval sets into the object-oriented concept lattice, and propose an object-oriented interval-set concept lattice. Properties of them are investigated. Relationships among interval-set concept lattices, object-oriented interval-set concept lattices and property-oriented interval-set concept lattices are discussed. By discussing the relationships between the object-oriented concept lattice and the object-oriented interval-set concept lattice, an approach to construct object-oriented interval-set concept lattices are established.

[1]  Yiyu Yao.  Rough Set Approximations : a Concept Analysis Point Of , 2013 .

[2]  Christopher G. Chute,et al.  Viewpoint Paper: Auditing the Semantic Completeness of SNOMED CT Using Formal Concept Analysis , 2009, J. Am. Medical Informatics Assoc..

[3]  Yiyu Yao,et al.  Interval sets and three-way concept analysis in incomplete contexts , 2016, International Journal of Machine Learning and Cybernetics.

[4]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[5]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[6]  Didier Dubois,et al.  A Possibility-Theoretic View of Formal Concept Analysis , 2007, Fundam. Informaticae.

[7]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[8]  Robert E. Kent,et al.  Rough Concept Analysis: A Synthesis of Rough Sets and Formal Concept Analysis , 1996, Fundam. Informaticae.

[9]  Wen-Xiu Zhang,et al.  Axiomatic characterizations of dual concept lattices , 2013, Int. J. Approx. Reason..

[10]  Yiyu Yao,et al.  Concept lattices in rough set theory , 2004, IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04..

[11]  Jinhai Li,et al.  Incomplete decision contexts: Approximate concept construction, rule acquisition and knowledge reduction , 2013, Int. J. Approx. Reason..

[12]  Atsuo Murata,et al.  Rough Set Approximations in Formal Concept Analysis , 2010, Trans. Rough Sets.

[13]  Xizhao Wang,et al.  Comparison of reduction in formal decision contexts , 2017, Int. J. Approx. Reason..

[14]  Ivo Düntsch,et al.  Modal-style operators in qualitative data analysis , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[15]  Jian-Min Ma,et al.  Concept acquisition approach of object-oriented concept lattices , 2017, Int. J. Mach. Learn. Cybern..

[16]  Amedeo Napoli,et al.  Mining gene expression data with pattern structures in formal concept analysis , 2011, Inf. Sci..

[17]  Zdzislaw Pawlak,et al.  Information systems theoretical foundations , 1981, Inf. Syst..

[18]  Minhong Wang,et al.  International Journal of Approximate Reasoning an Interval Set Model for Learning Rules from Incomplete Information Table , 2022 .

[19]  Yiyu Yao,et al.  A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis , 2004, Rough Sets and Current Trends in Computing.

[20]  Guoping Lin,et al.  Connections between covering-based rough sets and concept lattices , 2015, Int. J. Approx. Reason..

[21]  Somesh Jha,et al.  Mining Security-Sensitive Operations in Legacy Code Using Concept Analysis , 2007, 29th International Conference on Software Engineering (ICSE'07).

[22]  Yiyu Yao,et al.  Interval sets and interval-set algebras , 2009, 2009 8th IEEE International Conference on Cognitive Informatics.

[23]  Paolo Tonella,et al.  Using a Concept Lattice of Decomposition Slices for Program Understanding and Impact Analysis , 2003, IEEE Trans. Software Eng..

[24]  Yiyu Yao,et al.  A multiview approach for intelligent data analysis based on data operators , 2008, Inf. Sci..

[25]  Yiyu Yao,et al.  Interval-set algebra for qualitative knowledge representation , 1993, Proceedings of ICCI'93: 5th International Conference on Computing and Information.

[26]  Jitender S. Deogun,et al.  Formal Rough Concept Analysis , 1999, RSFDGrC.

[27]  Ju Wang,et al.  Concept Approximation in Concept Lattice , 2001, PAKDD.

[28]  Theresa Beaubouef,et al.  Rough Sets , 2019, Lecture Notes in Computer Science.

[29]  Jirapond Tadrat,et al.  A new similarity measure in formal concept analysis for case-based reasoning , 2012, Expert Syst. Appl..

[30]  Jan Konecny,et al.  Block relations in formal fuzzy concept analysis , 2016, Int. J. Approx. Reason..

[31]  Bernhard Ganter,et al.  Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings , 2008, International Conference on Formal Concept Analysis.

[32]  Yuhua Qian,et al.  A comparative study of multigranulation rough sets and concept lattices via rule acquisition , 2016, Knowl. Based Syst..

[33]  Ivo Düntsch,et al.  Approximation Operators in Qualitative Data Analysis , 2003, Theory and Applications of Relational Structures as Knowledge Instruments.

[34]  Xiao Zhang,et al.  Rule-preserved object compression in formal decision contexts using concept lattices , 2014, Knowl. Based Syst..

[35]  Dexue Zhang,et al.  The concept lattice functors , 2013, Int. J. Approx. Reason..

[36]  Qingguo Li,et al.  A categorical representation of algebraic domains based on variations of rough approximable concepts , 2014, Int. J. Approx. Reason..