Research on concept lattice’s intent reduction

doi:10.3778/j.issn.1002-8331.2009.01.012

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (1): 42-44.DOI: 10.3778/j.issn.1002-8331.2009.01.012

• 理论研究 • Previous Articles Next Articles

Research on concept lattice’s intent reduction

ZHI Dong-jie¹,ZHI Hui-lai²,LIU Zong-tian²

1.School of Computer Science and Technology，He’nan Polytechnic University，Jiaozuo，Henan 454010，China
2.School of Computer Engineering and Science，Shanghai University Shanghai 200072，China

Received:2008-08-26 Revised:2008-10-29 Online:2009-01-01 Published:2009-01-01
Contact: ZHI Dong-jie

概念格的内涵缩减研究

智东杰¹,智慧来²,刘宗田²

1.河南理工大学计算机科学与技术学院，河南焦作 454010
2.上海大学计算机工程与科学学院，上海 200072

通讯作者: 智东杰

Abstract

Abstract: Concept lattice is used as attribute reduction data model.The relationship between father concept and son concept and sources of attributes are studied separately.If several concepts have common son concept，the son concept is only one.Concept lattice nodes’ attributes have two sources that include inherited attributes from its father concept and new adopted attributes in the process of refining its father concept.Accordingly，two rules for intent reduction are proposed.If a concept node has only one father concept node，then the intent reduction is formed by the difference sets of its attributes set and its father’s attribute set.If a concept has several father concepts，then the intent reduction is formed by two attributes inherited from any two different fathers.Then，these two rules are formally proved.Finally，algorithm for computing intent reduction is put forward.

Key words: concept lattice, intent reduction, association rule

摘要： 利用概念格作为属性约简的数据模型，对概念格上的父子关系和内涵属性来源进行了分析：在概念格中任意若干个概念如果存在共同的子概念，那么只存在一个共同的子概念；概念的属性有两种来源，其一是继承的父节点的属性，其二是概念细化过程中增加的属性。相应地提出了两条内涵缩减的规则：如果一个节点只有一个父节点，那么其内涵缩减来源于它的内涵与父节点内涵的差集；如果一个节点有两个或两个以上的父节点，那么其内涵缩减来源于任意两个父亲节点属性的并集。然后对两条规则进行了证明，并设计了计算内涵缩减的算法。

关键词: 概念格, 内涵缩减, 关联规则

ZHI Dong-jie¹,ZHI Hui-lai²,LIU Zong-tian². Research on concept lattice’s intent reduction[J]. Computer Engineering and Applications, 2009, 45(1): 42-44.

智东杰¹,智慧来²,刘宗田². 概念格的内涵缩减研究[J]. 计算机工程与应用, 2009, 45(1): 42-44.

[1]	ZHANG Chengling, LI Jinjin, LIN Yidong. Attribute Reduction in Formal Contexts Based on OE-Concept Lattices [J]. Computer Engineering and Applications, 2021, 57(15): 82-89.
[2]	ZHANG Zhenhai，ZHANG Xiangting. Context-Aware Information Service Recommendation Method for High-Speed Rail [J]. Computer Engineering and Applications, 2021, 57(12): 231-236.
[3]	YANG Geying, SHEN Xiajiong, SHI Xianjin, ZHANG Lei. Visualization of Association Rules in Context of Concept Lattices [J]. Computer Engineering and Applications, 2021, 57(1): 84-91.
[4]	JI Wenlu, WANG Hailong, SU Guibin, LIU Lin. Review of Recommendation Methods Based on Association Rules Algorithm [J]. Computer Engineering and Applications, 2020, 56(22): 33-41.
[5]	GU Junhua, SU Ming, ZHANG Yajuan, ZHANG Danhong. Research on Fast Frequent Pattern Mining Algorithm Based on Bitmap-Code List [J]. Computer Engineering and Applications, 2020, 56(19): 86-93.
[6]	SHE Yanhong, HU Mengting, HE Xiaoli, ZENG Wanglin. Comparative Study Between Two Multigranulation Formal Concept Analysis Models [J]. Computer Engineering and Applications, 2020, 56(10): 51-55.
[7]	LIU Liping1, ZHANG Xinyou1, NIU Xiaolu2, GUO Yongkun1, DING Liang1. Survey of Spark-Based Parallel Association Rules Mining Algorithm [J]. Computer Engineering and Applications, 2019, 55(9): 1-9.
[8]	HE Xiaoli, LIU Huali, LIU Yaoyao. Interval Formal Concept Analysis Approach for Multigranulation Data [J]. Computer Engineering and Applications, 2019, 55(19): 52-57.
[9]	GUO Peng, CAI Cheng. Data Mining and Analysis of Students’ Score Based on Clustering and Association Algorithm [J]. Computer Engineering and Applications, 2019, 55(17): 169-179.
[10]	QU Hanhua1, HUI Jianzhong1, HE Xianfeng2, WANG Muhua1, HE Xiaofeng1, FENG De’en1. Formal concept analysis model of meteorological services [J]. Computer Engineering and Applications, 2018, 54(9): 257-264.
[11]	GUO Shiwei, MENG Yuyu, CHEN Shaoli. Application of improved PSOGM algorithm in dynamic association rule mining [J]. Computer Engineering and Applications, 2018, 54(8): 160-165.
[12]	ZHAO Huiru，LIN Min. Topic learning and representation method of academic papers with association rules [J]. Computer Engineering and Applications, 2018, 54(20): 159-165.
[13]	WANG Xiaodan, WANG Jianyu. Warehouse algorithm research on medicine vending machine [J]. Computer Engineering and Applications, 2017, 53(4): 256-262.
[14]	SHEN Xiajiong1, 2, YE Manman2, GAN Tian2, HAN Daojun1, 2. Information retrieval based on concept lattice and its tree visualization [J]. Computer Engineering and Applications, 2017, 53(3): 95-99.
[15]	YAN Hongwen, ZOU Dan. Short-term wind speed forecasting based on PSO-Elman optimized by association rule [J]. Computer Engineering and Applications, 2017, 53(23): 261-266.

Research on concept lattice’s intent reduction

概念格的内涵缩减研究

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics