Abstract
How to reduce the complexity of lattice construction is an important research topic in formal concept analysis. Based on granularity tree, the relationship between the extent and the intent of the attribute (object)-oriented concept before and after granularity transformation are investigated. Then, zoom algorithms for attribute (object)-oriented concept lattices are proposed. Specifically, zoom-in algorithm is applied to change the attribute granularity from coarse-granularity to fine-granularity, and zoom-out algorithm achieves changing the attribute granularity from fine-granularity to coarse-granularity. Zoom algorithms deal with the problems of fast construction of the attribute (object)-oriented multi-granularity concept lattices. By using zoom algorithms, the attribute (object)-oriented concept lattice based on different attribute granularity can be directly generated through the existing attribute (object)-oriented concept lattice. The proposed algorithms not only reduce the computational complexity of concept lattice construction, but also facilitate further data mining and knowledge discovery in formal contexts. Furthermore, the transformation algorithms among three kinds of concept lattice are proposed.



Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Belohlavek R, Sklenar V (2005) Formal concept analysis over attributes with levels of granularity. In: International conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce, vol 1, pp 619–624
Belohlavek R, Vychodil V (2009) Formal concept analysis with background knowledge: attribute priorities. IEEE Trans Syst Man Cybern 39(4):399–409
Belohlavek R, Baets BD, Konecny J (2014) Granularity of attributes in formal concept analysis. Inf Sci 260(1):149–170
Belohlavek R, Baets BD, Konecny J (2014) Boolean factors as a means of clustering of interestingness measures of association rules. Ann Math Artif Intell 70(1–2):151–184
Bernhard G (1999) Formal concept analysis: mathematical foundations. Springer, New York
Burusco A, Fuentes-Gonzfilez R (1998) Construction of the L-fuzzy concept lattice. Fuzzy Sets Syst 97(1):109–119
Chai YM (2012) An algorithm for mining global closed frequent itemsets based on distributed frequent concept direct product. Chin J Comput 35(5):990–1001
Chen D, Cui HP, Su YL (2018) Basic issues of visual analysis system of multi-granularity spatial-temporal objects. Geomat World 25(2):36–44
Dick S, Tappenden A, Badke C, Olarewaju O (2013) A granular neural network: performance analysis and application to re-granulation. Int J Approx Reason 54(8):1149–1167
Duntsch I, Gediga G (2003) Approximation operators in qualitative data analysis, theory and applications of relational structures as knowledge instruments, COST Action 274. TARSKI, Revised Papers, pp 214–230
Du WL, Miao DQ, Li DG, Zhang NQ (2005) Correlation analysis between concept lattice and granularity. Comput Sci 32(12):181–183
Ganter B, Wille R (1999) Formal concept analysis, mathematic foundations. Springer, Berlin
Gediga G, Duntsch I (2002) Modal-style operators in qualitative data analysis. In: Proceedings of the 2002 IEEE international conference on data mining, pp 155–162
Godin R, Missaoui R, Alaoui H (2010) Incremental concept formation algorithms based on galois(concept) lattices. Comput Intell 11(2):246–267
Gong FM, Shao MW, Qiu GF (2017) Concept granular computing systems and their approximation operators. Int J Mach Learn Cybern 8(2):1–14
Hu KY, Sui YF, Lu YC, Wang J, Shi CY (2001) Concept approximation in concept lattice, PAKDD 2001. Adv Knowl Discov Data Min 2035:167–173
Hao C, Fan M, Li JH, Yin YQ, Wang DJ (2016) Particle mark rule based optimal marker selection. Pattern Recognit Artif Intell 29(3):272–280
Kang XP, Miao DQ (2016) A study on information granularity in formal concept analysis based on concept-bases. Knowl Based Syst 105:147–159
Kang XP, Miao DQ, Lin GP (2018) Yong Liu, Relation granulation and algebraic structure based on concept lattice in complex information systems. Int J Mach Learn Cybern 9:1895–1907
Kent RE (1996) Rough concept analysis: a synthesis of rough sets and formal concept analysis. Fundam Inf 27(2):169–181
Krajca P, Outrata J, Vychodil V (2012) Computing formal concepts by attribute sorting. Fund Inf 115(4):395–417
Li F, Hu BQ (2017) A new approach of optimal scale selection to multi-scale decision tables. Inf Sci 381:193–208
Li F, Hu BQ, Wang J (2017) Stepwise optimal scale selection for multi-scale decision tables via attribute significance. Knowl Based Syst 129:4–16
Li KW, Shao MW, Wu WZ (2017) A data reduction method in formal fuzzy contexts. Int J Mach Learn Cybern 8(4):1145–1155
Li LF (2017) Multi-level interval-valued fuzzy concept lattices and their attribute reduction. Int J Mach Learn Cybern 8(1):45–56
Li JH, Ren Y, Mei CL, Qian YH, Yang XB (2016) A comparative study of multigranulation rough sets and concept lattices via rule acquisition. Knowl Based Syst 91:152–164
Lin GP, Liang JY, Li JJ (2016) A fuzzy multigranulation decision-theoretic approach to multi-source fuzzy information systems. Knowl Based Syst 91:102–113
Lin TY (2003) Granular computing, rough sets, fuzzy sets, data mining, and granular computing. In: International conference, Rsfdgrc 2003, Chongqing, China, May 26–29, 2003, Proceedings, pp 16–24
Liu H, Cocea M (2018) Granular computing-based approach of rule learning for binary classification. Granul Comput 1:1–9
Outrata J, Vychodil V (2012) Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Inf Sci 185(1):114–127
Park Y (2000) Software retrieval by samples using concept analysis. J Syst Softw 54(3):179–183
Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 11(5):341–356
Pedrycz W (2013) Granular computing. Physica-Verlag, Heidelberg, pp 16–24
Piotr H (2018) Recent granular computing frameworks for mining relational data. Artif Intell Rev 2018:1–38
Qian YH, Liang JY, Yao YY, Dang CY (2010) MGRS: a multi-granulation rough set. Inf Sci 180(6):949–970
Ren JD, Yang X, Dong J (2012) An algorithm based on bit complementary tree for mining closed frequent itemsets. Int J Adv Comput Technol 4(22):427–435
Shao MW, Li KW (2017) Attribute reduction in generalized one-sided formal contexts. Inf Sci 378(1):317–327
Shao MW, Leung Y, Wang XZ, Wu WZ (2016) Granular reducts of formal fuzzy contexts. Knowl Based Syst 114(15):156–166
She YH, Li JH, Yang HL (2015) A local approach to rule induction in multi-scale decision tables. Knowle Based Syst 89:398–410
Shi JL, Zhang QQ, Xu JC (2018) Optimal granularity selection of attribute reductions in multi-granularity decision system. Comput Sci 163:31
Wang BL, Liang JY, Qian YH (2015) Determining decision makers weights in group ranking: a granular computing method. Int J Mach Learn Cybern 6(3):511–521
Wang GY, Ji X (2014) Granular computing with multiple granular layers for brain big data processing. Brain Inform 1(1–4):1–10
Wang LM, Zhang Z (2007) Closed frequent itemsets mining algorithm based on iceberg concept lattices integration. Comput Res Dev 44(7):1184–1190
Wang XX, Zhang SL (2009) Batch construction algorithm of concept lattice based on object expansion. J Taiyuan Univ Sci Technol 30(35):368–373
Wille R (1992) Concept lattices and conceptual knowledge systems. Comput Math Appl 23(6–9):493–515
Wille R (2009) Restructuring lattice theory : an approach based on hierarchies of concept. Orderd Sets D Reidel 83:314–339
Wu WZ, Leung Y (2011) Theory and applications of granular labelled partitions in multi-scale decision tables. Inf Sci 181(18):3878–3897
Wu WZ, Leung Y (2013) Optimal scale selection for multi-scale decision tables. Int J Approx Reason 54(8):1107–1129
Xu WH, Pang JZ, Luo SQ (2014) A novel cognitive system model and approach to transformation of information granules. Granul Comput 55(3):853–866
Xu WH, Li WT (2016) Granular computing approach to two-way learning based on formal concept analysis in fuzzy datasets. IEEE Trans Cybern 46(2):366–379
Xu WH, Yu JH (2017) A novel approach to information fusion in multi-source datasets: a granular computing viewpoint. Inf Sci 378:410–423
Yao YY (2001) Information granulation and rough set approximation. Int J Intell Syst 16(1):87–104
Yao YY (2004) A partition model of granular computing. LNCS Trans Rough Sets 2004:232–253
Yao YY (2004) Concept lattices in rough set theory. Fuzzy Inf 2:796–801
Yao YY (2004) A comparative study of formal concept analysis and rough set theory in data analysis. In: International conference on rough sets and current trends in computing, pp 59–68
Yao YY (2015) The two sides of the theory of rough sets. Knowl Based Syst 80:67–77
Zadeh LA (2009) Toward human level machine intelligence—is it achievable? The need for a paradigm shift. Comput Intell Mag IEEE 3(3):11–22
Zhang CL, Zhai YH, Li DY, Yang YH (2017) Multigranulation rough set model in hesitant fuzzy information systems and its application in person-job fit. Int J Mach Learn Cybern 9:1–13
Zhang JS, Hua YX, Xiang LI (2018) The basic content and methods of multi-granularity spatio-temporal object modeling. Geomat World 25(2):12–16
Zhang SL, Guo P, Zhang JF, Wang XX (2010) A batch constructing method of weighted concept lattice based on deviance analysis. In: International conference on computational intelligence and security, pp 69–73
Zhang WX, Liang Y, Wu WZ (2003) Information system and knowledge discovery. Science Press, Henderson
Zhang WX, Wei L, Qi JJ (2005) Attribute reduction theory and method of concept lattice. Sci China Ser E Inf Sci 6:628–639
Zhang XY, Wei L, Xu WH (2017) Attributes reduction and rules acquisition in an lattice-valued information system with fuzzy decision. Int J Mach Learn Cybern 8(1):135–147
Zou LG, Zhang ZP, Long J (2016) An efficient algorithm for increasing the granularity levels of attributes in formal concept analysis. Expert Syst Appl 46:224–235
Acknowledgements
This work was supported by grants from the National Natural Science Foundation of China (nos. 61673396, 61573321), and Shandong Province National Natural Science Foundation (nos. ZR2017MF032, ZR2015FM022), the Fundamental Research Funds for the Central Universities under Grant (no. 18CX02133A).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix: the demonstrations of the zoom-in and zoom-out algorithms
Appendix: the demonstrations of the zoom-in and zoom-out algorithms
The formal contexts are presented by Tables 3 and 4 with the object set is \(\{x_1,x_2,x_3,x_4,x_5,x_6\}\), attribute sets are \(\{a,b,c,d,e\}\) and \(\{a,b,c_1,c_2,d,e\}\) respectively. In the sequence of graphs, the green concept indicates the concept currently being processed and the red concept represents the processed concept.
The first figure sequence (Figs. 4, 5, 6, 7, 8) is a zoom-in algorithm presentation for the attribute-oriented concept lattice, that is, from the attribute-oriented concept lattice corresponding to Table 3 to the attribute-oriented concept lattice corresponding to Table 4.
The second figure sequence (Fig. 9, 10, 11, 12, 13, 14, 15, 16) is a zoom-out algorithm presentation for attribute-oriented concept lattice, that is, from the attribute-oriented concept lattice corresponding to Table 4 to the attribute-oriented concept lattice corresponding to Table 3.
Rights and permissions
About this article
Cite this article
Shao, MW., Lv, MM., Li, KW. et al. The construction of attribute (object)-oriented multi-granularity concept lattices. Int. J. Mach. Learn. & Cyber. 11, 1017–1032 (2020). https://doi.org/10.1007/s13042-019-00955-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13042-019-00955-0