南京大学学报(自然科学版) ›› 2018, Vol. 54 ›› Issue (4): 786.
李俊余1,2,朱荣杰1,王 霞1,2*,吴伟志1,2
Li Junyu1,2,Zhu Rongjie1,Wang Xia1,2*,Wu Weizhi1,2
摘要: 由于三元概念分析是形式概念分析的拓展,因此三元概念和形式概念(二元概念)之间有着紧密的联系. 首先,从二元背景出发来描述三元概念,研究一个三元背景的三元概念和所有非空条件子集确定的二元背景的二元概念之间的关系. 在每一个条件确定的二元背景的所有二元对象概念集上定义一种运算,证明了通过该运算和二元概念间的并运算可以生成所有非空条件子集确定的二元背景的所有二元概念. 其次,定义了一个从二元概念到三元概念的双射,并从概念粒的角度将一个三元背景的所有三元概念和二元概念进行分层,共分为三层,其中第一层是由单个对象和条件确定的二元对象概念,由它们可以生成第二层和第三层的概念粒,因此第一层是最基本的概念粒,这对三元概念的理解和构造具有重要的作用. 最后,从三元概念出发来寻找二元概念,基于三元概念提出生成由每个条件确定的二元背景的二元概念的方法,并给出了严格证明. 此外,还通过三元图对该方法加以直观解释.
[1] Lehmann F,Wille R. A triadic approach to formal concept analysis ∥ Proceedings of 3rd International Conference on Conceptual Struc-tures:Applications,Implementation and Theory. Springer Berlin Heidelberg,1995:32-43. [2] Ganter B,Wille R. Formal concept analysis:Mathematical foundations. Springer Berlin Heidelberg,1999,284. [3] Wille R. Restructuring lattice theory:An approach based on hierarchies of concepts ∥ Rival I. Ordered Sets. Dordrecht:Springer,1982:445-470. [4] Wille R. The basic theorem of triadic concept analysis. Order,1995,12(2):149-158. [5] Biedermann K. Triadic Galois connections ∥ Denecke K,Lüders O. General Algebra and Applications in Discrete Mathematics. Aachen:Shaker Verlag,1997:23-33. [6] Biedermann K. An equational theory for trilattices. Algebra Universalis,1999,42(4):253-268. [7] Biedermann K. How triadic diagrams represent conceptual structures ∥ Lukose D,Delugach H,Keeler M,et al. Conceptual Structures:Fulfilling Peirce’s Dream. Springer Berlin Heidelberg,1997:304-317. [8] Ganter B,Obiedkov S. Implications in triadic formal contexts ∥ Wolff K E,Pfeiffer H D,Delugach H S. Conceptual Structures at Work. Springer Berlin Heidelberg,2004:186-195. [9] Missaoui R,Kwuida L. Mining triadic association rules from ternary relations ∥ Valtchev P,Jschke R. Formal Concept Analysis. Springer Berlin Heidelberg,2011:204-218. [10] Kavtoue M,Kuznetsov S O,Macko J,et al. Mining Biclusters of similar values with triadic concept analysis ∥ Proceedings of the 8th International Conference on Concept Lattices and Their Applications(CLA2011). Nancy,France:CLA,2011:175-190. [11] Kaytoue M,Kuznetsov S O,Macko J,et al. Biclustering meets triadic concept analysis. Annals of Mathematics and Artificial Intelligence,2014,70(1-2):55-79. [12] Ignatov D I,Gnatyshak D V,Kuznetsov S O,et al. Triadic formal concept analysis and triclustering:Searching for optimal patterns. Machine Learning,2015,101(1-3):271-302. [13] Belohlavek R,Vychodil V. Optimal factorization of three-way binary data ∥ 2010 IEEE International Conference on Granular Computing. San Jose,CA,USA:IEEE,2010:61-66. [14] Glodeanu C V. Factorization methods of binary,triadic,real and fuzzy data. Studia Universitatis Babes-Bolyai,Informatica,2011,56(2):81-86. [15] Belohlavek R,Glodeanu C,Vychodil V. Optimal factorization of three-way binary data using triadic concepts. Order,2013,30(2):437-454. [16] Glodeanu C V. Tri-ordinal factor analysis ∥ Cellier P,Distel F,Ganter B. Formal Concept Analysis. International Conference on Formal Concept Analysis(LNCS7880). Springer Berlin Heidelberg,2013:125-140. [17] Belohlavek R,Osicka P. Triadic concept analysis of data with fuzzy attributes ∥ 2010 IEEE International Conference on Granular Computing. San Jose,CA,USA:IEEE,2010:661-665. [18] Belohlavek R,Osicka P. Triadic concept lattices of data with graded attributes. International Journal of General System,2012,41(2):93-108. [19] Konecny J,Osicka P. Triadic concept lattices in the framework of aggregation structures. Information Sciences,2014,279:512-527. [20] Glodeanu C V. Fuzzy-valued triadic implica-tions ∥ Proceedings of the 8th International Conference on Concept Lattices and Their Applications(CLA2011). Nancy,France:CLA,2011:159-173. [21] Belohlavek R,Osicka P. Triadic fuzzy Galois connections as ordinary connections. Fuzzy Sets and Systems,2014,249:83-99. [22] 王 霞,张 茜,李俊余等. 基于粗糙集的三元概念分析. 山东大学学报(理学版),2017,52(7):37-43.(Wang X,Zhang Q,Li J Y,et al. Triadic concept analysis based on rough set theory. Journal of Shandong University(Natural Science),2017,52(7):37-43.) [23] Wille R. Triadic concept graphs ∥ Proceedings of the 6th International Conference on Conceptual Structures. Montpellier,France:Springer,1998:194-208. [24] Groh B,Wille R. Lattices of triadic concept graphs ∥ Ganter B,Mineau G W. Conceptual Structures:Logical,Linguistic,and Computational Issues. ICCS 2000. Springer Berlin Heidelberg,2000:332-341. [25] 祁建军,魏 玲. 三元背景及概念三元格的简化. 计算机科学,2017,44(9):53-57.(Qi J J,Wei L. Simplification of triadic contexts and concept trilattices. Computer Science,2017,44(9):53-57.) [26] 刘晓今. 概念三元格构造算法及应用研究. 硕士学位论文. 西安:西安电子科技大学,2013.(Liu X J. Study on the construction algorithm of concept trilattices and its application. Master Dissertation. Xi’an:Xidian University,2013.) [27] 汤亚强,范 敏,李金海. 三元形式概念分析下的认知系统模型及信息粒转化方法. 山东大学学报(理学版),2014,49(8):102-106.(Tang Y Q,Fan M,Li J H. Cognitive system model and approach to transformation of information granules under triadic formal concept analysis. Journal of Shandong University(Natural Science),2014,49(8):102-106.) [28] Hao F,Park D S,Min G Y,et al. k-Cliques mining in dynamic social networks based on triadic formal concept analysis. Neurocomputing,2016,209:57-66. [29] Kumar C A,Mouliswaran S C,Li J H,et al. Role based access control design using Triadic concept analysis. Journal of Central South University,2016,23(12):3183-3191. [30] 李 贞,张 卓,王黎明. 基于三元概念分析的文本分类算法研究. 计算机科学,2017,44(8):207-215.(Li Z,Zhang Z,Wang L M. Research on text classification algorithm based on triadic concept analysis. Computer Science,2017,44(8):207-215.) [31] Wei L,Qian T,Wan Q,et al. A research summary about triadic concept analysis. International Journal of Machine Learning and Cybernetics,2016,9(4):699-712. [32] 魏 玲,万 青,钱 婷等. 三元概念分析综述. 西北大学学报(自然科学版),2014,44(5):689-699.(Wei L,Wan Q,Qian T,et al. An overview of triadic concept analysis. Journal of Northwest University(Natural Science Edition),2014,44(5):689-699.) [33] Ignatov D I. On closure operators related to maximal tricliques in tripartite hypergraphs. Discrete Applied Mathematics,2018,doi:10. 1016/j. dam. 2017. 12. 032. |
No related articles found! |
|