Attribute reduction is one of the crucial issues in Formal Concept Analysis. Discernibility matrix plays an important role in attribute reduction, and has been achieved many successful applications in different concept lattice models. Nevertheless, it requires the construction of the concept lattice before the discernibility matrices are computed when applying traditional approaches, which is both time and space consuming. Furthermore, in some discernibility matrices, the comparisons between every two concepts result in a high computation complexity. To address these problems, granular concepts, i.e., the object concepts and the attribute concepts, are considered in this paper, and a simple discernibility matrix named Object-Attribute discernibility matrix is proposed. It averts the construction of the whole concept lattice and the comparisons between every two concepts. Consequently, the time complexity is greatly reduced, and a lot of storage space can also be saved. Theoretical analysis and experimental results show the efficiency of Object-Attribute discernibility matrix.
CarpinetoC. and RomanoG.A lattice conceptual clustering system and its application to browsing retrieval, Machine Learning24(2) (1996), 95–122.
2.
ChenJ.K., MiJ.S. and LinY.J.A graph approach for knowledge reduction in formal contexts, Knowledge-Based Systems148 (2018), 177–188.
3.
ChenJ.K., MiJ.S., XieB. and LinY.J.A fast attribute reduction method for large formal decision contexts, International Journal of Approximate Reasoning106 (2019), 1–17.
4.
ColeR., EklundP. and StummeG.Document retrieval for email search and discovery using formal concept analysis, Applied Artificial Intelligence17(3) (2003), 257–280.
5.
CornejoM.E., MedinaJ. and Ramírez-PoussaE.Characterizing reducts in multi-adjoint concept lattices, Information Sciences422 (2018), 364–376.
6.
DiasS.M. and VieiraN.J.Concept lattices reduction: Definition, analysis and classification, Expert Systems with Applications42(20) (2015), 7084–7097.
KaytoueM., KuznetsovS.O., NapoliA. and DuplessisS.Mining gene expression data with pattern structures in formal concept analysis, Information Sciences181(10) (2011), 1989–2001.
9.
KonecnyJ.On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction, Information Sciences415-416 (2017), 199–212.
10.
KonecnyJ. and KrajčaP.On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method, Information Sciences491 (2019), 48–62.
11.
KuznetsovS.O.Machine Learning on the Basis of Formal Concept Analysis, Plenum Press, 2001.
12.
KuznetsovS.O. and ObiedkovS.A.Comparing performance of algorithms for generating concept lattices, Journal of Experimental & Theoretical Artificial Intelligence14(2-3) (2002), 189–216.
13.
LiJ.H., KumarC.A., MeiC.L. and WangX.Z.Comparison of reduction in formal decision contexts, International Journal of Approximate Reasoning80 (2017), 100–122.
14.
LiJ.H., MeiC.L. and LvY.J.A heuristic knowledgereduction method for decision formal contexts, Computers & Mathematics with Applications61(4) (2011), 1096–1106.
15.
LiJ.H., MeiC.L. and LvY.J.Incomplete decision contexts: Approximate concept construction, rule acquisition and knowledge reduction, International Journal of Approximate Reasoning54(1) (2013), 149–165.
16.
LiJ.H., MeiC.L., XuW.H. and QianY.H.Concept learning via granular computing: A cognitive viewpoint, Information Sciences298(1) (2015), 447–467.
17.
LiL.J., MiJ.S. and XieB.Attribute reduction based on maximal rules in decision formal context, International Journal of Computational Intelligence Systems7(6) (2014), 1044–1053.
18.
LiM.Z. and MiJ.S.The strong direct product of formal contexts, Information Sciences226 (2013), 47–67.
19.
LiM.Z. and WangG.Y.Knowledge reduction in crisply generated fuzzy concept lattices, Fundamenta Informaticae142(1-4) (2015), 307–335.
20.
LiT.J., LiM.Z. and GaoY.Attribute reduction of concept lattice based on irreducible elements, International Journal of Wavelets, Multiresolution and Information Processing11(06) (2013), 2797–2813.
21.
LiuM., ShaoM.W., ZhangW.X. and WuC.Reduction method for concept lattices based on rough set theory and its application, Computers & Mathematics with Applications53(9) (2007), 1390–1410.
22.
MaoH. and MiaoH.R.Attribute reduction based on directed graph in formal fuzzy contexts, Journal of Intelligent & Fuzzy Systems34 (2018), 4139–4148.
23.
MedinaJ.Relating attribute reduction in formal, objectoriented and property-oriented concept lattices, Computers & Mathematics with Applications64(6) (2012), 1992–2002.
24.
MiJ.S., LeungY. and WuW.Z.Approaches to attribute reduction in concept lattices induced by axialities, Knowledge-Based Systems23(6) (2010), 504–511.
25.
PawlakZ.Rough Sets: Theoretical Aspects of Reasoning about Data,, Kluwer Academic Publishers, 1991.
26.
PoelmansJ., IgnatovD.I., KuznetsovS.O. and DedeneG.Formal concept analysis in knowledge processing: A survey on applications, Expert Systems with Applications40(16) (2013), 6538–6560.
27.
PoshyvanykD., GethersM. and MarcusA.Concept location using formal concept analysis and information retrieval, ACM Transactions on Software Engineering and Methodology21(4) (2012), 1–34.
28.
PrissU.Formal concept analysis in information science, Annual Review of Information Science & Technology40(1) (2006), 521–543.
29.
QiJ.J.Attribute reduction in formal contexts based on a new discernibility matrix, Journal of Applied Mathematics and Computing30(1-2) (2009), 305–314.
30.
QiJ.J., WeiL. and YaoY.Y.Three-way formal concept analysis, In Rough Sets and Knowledge Technology, Springer, 2014, pp. 732–741.
31.
RenR.S. and WeiL.The attribute reductions of three-way concept lattices, Knowledge-Based Systems99 (2016), 92–102.
32.
ShaoM.W. and LeungY.Relations between granular reduct and dominance reduct in formal contexts, Knowledge-Based Systems65 (2014), 1–11.
33.
ShaoM.W. and LiK.W.Attribute reduction in generalized one-sided formal contexts, Information Sciences378 (2017), 317–327.
34.
ShaoM.W., YangH.Z. and WuW.Z.Knowledge reduction in formal fuzzy contexts, Knowledge-Based Systems73 (2015), 265–275.
35.
SkowronA. and RauszerC.The discernibility matrices and functions in information systems, Theory and Decision Library11 (1992), 331–362.
36.
ValtchevP., MissaouiR. and GodinR.Formal concept analysis for knowledge discovery and data mining: The new challenges, Lecture Notes in Computer Science2961 (2004), 352–371.
37.
WangH. and CuiP.Z.Analysis of interval-valued decision formal contexts, Journal of Intelligent & Fuzzy Systems29 (2015), 1565–1574.
38.
WeiL., QiJ.J. and ZhangW.X.Attribute reduction theory of concept lattice based on decision formal contexts, Science in China Series F-Information Sciences51(7) (2008), 910–923.
39.
WilleR.In I. Rival, editor, Ordered sets, Reidel, Dordrecht-Boston, pp, Restructuring lattice theory: An approach based on hierachies of concepts (1982), 314–339.
40.
WuW.Z., LeungY. and MiJ.S.Granular computing and knowledge reduction in formal contexts, IEEE Transactions on Knowledge and Data Engineering21(10) (2009), 1461–1474.
41.
XuW.H. and LiW.T.Granular computing approach to two-way learning based on formal concept analysis in fuzzy datasets, IEEE Transactions on Cybernetics46(2) (2016), 366–379.
42.
YaoY.Y.Concept lattices in rough set theory, In Processing of the 2004 IEEE Annual Meeting of the Fuzzy Information, 2004, pp. 796–801.
43.
YaoY.Y. and ZhaoY.Discernibility matrix simplification for constructing attribute reducts, Information Sciences179(7) (2009), 867–882.
44.
ZhangW.X., WeiL. and QiJ.J.Attribute reduction theory and approach to concept lattice, Science in China Series F: Information Sciences48(6) (2005), 713–726.
