Attribute reduction in formal decision contexts and its application to finite topological spaces


Attribute reduction in formal decision contexts has become one of the key issues in the research and development of formal concept analysis (FCA) and its applications. As far as we know, however, most of the existing reduction methods for formal decision contexts are time-consuming especially for the large-scale data. This paper investigates the attribute reduction method for large-scale formal decision contexts. The computation of a discernibility matrix is an important step in the development of the corresponding reduction method. A simple and powerful method to efficiently calculate the discernibility matrix of formal decision contexts is first presented. In addition, a heuristic algorithm for searching the optimal reduct is then proposed. Thirdly, as an application of the new results, we discuss the problem of finding the minimal subbases of finite topological spaces. It has shown that the method of attribute reduction in formal decision contexts can be used to obtain all the minimal subbases of a finite topological space. Furthermore, we present an algorithm for computing the minimal subbase of a topological space, based on the attribute reduction method proposed in this paper. Finally, two groups of experiments are carried out on some large-scale data sets to verify the effectiveness of the proposed algorithms.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4


  1. 1.

    Aswani CK (2012) Fuzzy clustering-based formal concept analysis for association rules mining. Appl Artif Intell 26(3):274–301

    Google Scholar 

  2. 2.

    Aswani CK, Dias SM, Newton JV (2015) Knowledge reduction in formal contexts using non-negative matrix factorization. Math Comput Simul 109:46–63

    MathSciNet  Google Scholar 

  3. 3.

    Carpineto C, Romano G (1996) A lattice conceptual clustering system and its application to browsing retrieval. Mach Learn 10:95–122

    Google Scholar 

  4. 4.

    Chen JK, Li JJ, Lin YJ, Lin GP, Ma ZM (2015) Relations of reduction between covering generalized rough sets and concept lattices. Inf Sci 304:16–27

    MathSciNet  MATH  Google Scholar 

  5. 5.

    Chen JK, Mi JS, Lin YJ (2018) A graph approach for knowledge reduction in formal contexts. Knowl-Based Syst 148:177–188

    Google Scholar 

  6. 6.

    Chen JK, Mi JS, Xie B, Lin YJ (2019) A fast attribute reduction method for large formal decision contexts. Int J Approx Reason 106:1–17

    MathSciNet  MATH  Google Scholar 

  7. 7.

    Dias SM, Vieira NJ (2015) Concept lattices reduction: definition, analysis and classification. Expert Syst Appl 42(20):7084–7097

    Google Scholar 

  8. 8.

    Dong C (2016) Attribute reduction of strongly harmonious decision formal contexts. Dissertation for the Master Degree (in Chinese), Yanshan University, Hebei.

  9. 9.

    Ganter B, Wille R (1999) Formal concept analysis. Mathematical foundations. Springer, Berlin

    Google Scholar 

  10. 10.

    Godin R (1995) Incremental concept formation algorithm based on Galois (concept) lattices. Computat Intell 11:246–67

    Google Scholar 

  11. 11.

    Guo LK, Huang FP, Li QG, Zhang GQ (2011) Power contexts and their concept lattices. Discrete Math 311(18–19):2049–2063

    MathSciNet  MATH  Google Scholar 

  12. 12.

    Kang X, Miao D, Lin G, Liu Y (2018) Relation granulation and algebraic structure based on concept lattice in complex information systems. Int J Mach Learn Cybern 9(11):1895–1907

    Google Scholar 

  13. 13.

    Kelly J (1995) General topology. Van Nostrand Company, New York

    Google Scholar 

  14. 14.

    Kent RE (1994) Rough concept analysis. In: Ziarko WP (ed) Rough sets, Fuzzy sets and knowledge discovery. Springer-Verlag, London, pp 248–255

    Google Scholar 

  15. 15.

    Konecny J (2017) On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction. Inf Sci 415–416:199–212

    MATH  Google Scholar 

  16. 16.

    Lang G, Miao D, Cai M (2017) Three-way decision approaches to conflict analysis using decision-theoretic rough set theory. Inf Sci 406–407:185–207

    MATH  Google Scholar 

  17. 17.

    Lang G, Miao D, Cai M, Zhang Z (2017) Incremental approaches for updating reducts in dynamic covering information systems. Knowl-Based Syst 134:85–104

    Google Scholar 

  18. 18.

    Li TJ, Wu WZ (2011) Attribute reduction in formal contexts: a covering rough set approach. Fundam Inform 111:15–32

    MathSciNet  MATH  Google Scholar 

  19. 19.

    Li JH, Mei CL, Lv YJ (2011) A heuristic knowledge-reduction method for decision formal contexts. Comput Math Appl 61(4):1096–1106

    MathSciNet  MATH  Google Scholar 

  20. 20.

    Li JH, Mei CL, Lv YJ (2011) Knowledge reduction in decision formal contexts. Knowl-Based Syst 24(5):709–715

    MATH  Google Scholar 

  21. 21.

    Li JH, Mei CL, Aswani Kumar Ch, Zhang X (2013) On rule acquisition in decision formal contexts. Int J Mach Learn Cybern 4(6):721–731

    Google Scholar 

  22. 22.

    Li JH, Mei CL, Lv YJ (2013) Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction. Int J Approx Reason 54(1):149–165

    MathSciNet  MATH  Google Scholar 

  23. 23.

    Li JH, Aswani Kumar Ch, Mei CL, Wang XZ (2017) Comparison of reduction in formal decision contexts. Int J Approx Reason 80:100–122

    MathSciNet  MATH  Google Scholar 

  24. 24.

    Li KW, Shao MW, Wu WZ (2017) A data reduction method in formal fuzzy contexts. Int J Mach Learn Cybern 8(4):1145–1155

    Google Scholar 

  25. 25.

    Li L, Zhang D (2019) 0–1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices. Soft Comput 23(2):383–391

    MATH  Google Scholar 

  26. 26.

    Li LJ, Li MZ, Mi JS, Xie B (2019) A simple discernibility matrix for attribute reduction in formal concept analysis based on granular concepts. J Intell Fuzzy Syst 37(3):4325–4337

    Google Scholar 

  27. 27.

    Lin Y, Li J, Lin P, Lin G, Chen J (2014) Feature selection via neighborhood multi-granulation fusion. Knowl-Based Syst 67:162–168

    Google Scholar 

  28. 28.

    Ma J, Hu L, Qian Y (2019) Object-oriented interval-set concept lattices. Int J Approx Reason 110:64–81

    MathSciNet  MATH  Google Scholar 

  29. 29.

    Medina J (2012) Relating attribute reduction in formal, object-oriented and property-oriented concept lattices. Comput Math Appl 64(6):1992–2002

    MathSciNet  MATH  Google Scholar 

  30. 30.

    Meeks WH, Perez J (2017) Finite topology minimal surfaces in homogeneous three-manifolds. Adv Math 312:185–197

    MathSciNet  MATH  Google Scholar 

  31. 31.

    Mi JS, Leung Y, Wu WZ (2010) Approaches to attribute reduction in concept lattices induced by axialities. Knowl-Based Syst 23:504–511

    Google Scholar 

  32. 32.

    Nourine L, Raynaud O (1999) A fast algorithm for building lattices. Inf Process Lett 71:199–204

    MathSciNet  MATH  Google Scholar 

  33. 33.

    Pei D, Mi JS (2011) Attribute reduction in decision formal context based on homomorphism. Int J Mach Learn Cybern 2(4):289–293

    Google Scholar 

  34. 34.

    Qi JJ, Qian T, Wei L (2016) The connections between three-way and classical concept lattices. Knowl-Based Syst 91:143–151

    Google Scholar 

  35. 35.

    Qiao SY, Wen SP, Chen CY, Li ZG (2003) A fast algorithm for building concept lattice. Int Conference Mach Learn Cybern 1:163–167

    Google Scholar 

  36. 36.

    Qin K, Li B, Pei Z (2019) Attribute reduction and rule acquisition of formal decision context based on object (property) oriented concept lattices. Int J Mach Learn Cybern 10:2837–2850

    Google Scholar 

  37. 37.

    Rajapakse PK, Denham M (2006) Text retrieval with more realistic concept matching and reinforcement learning. Inf Process Manag 42:1260–1275

    Google Scholar 

  38. 38.

    Shao MW, Leung Y (2014) Relations between granular reduct and dominance reduct in formal contexts. Knowl-Based Syst 65:1–11

    Google Scholar 

  39. 39.

    Shao MW, Leung Y, Wu WZ (2014) Rule acquisition and complexity reduction in formal decision contexts. Int J Approx Reason 55(1):259–274

    MathSciNet  MATH  Google Scholar 

  40. 40.

    Shao MW, Li KW (2017) Attribute reduction in generalized one-sided formal contexts. Inf Sci 378:317–327

    MathSciNet  MATH  Google Scholar 

  41. 41.

    Shao MW, Guo L, Wang CZ (2018) Connections between two-universe rough sets and formal concepts. Int J Mach Learn Cybern 9(11):1869–1877

    Google Scholar 

  42. 42.

    Shao MW, Lv MM, Li KW, Wang CZ (2020) The construction of attribute (object)-oriented multi-granularity concept lattices. Int J Mach Learn Cybern 11:1017–1032

    Google Scholar 

  43. 43.

    She Y, He X, Qian T, Wang Q, Zeng W (2019) A theoretical study on object-oriented and property-oriented multi-scale formal concept analysis. Int J Mach Learn Cybern 10(11):3263–3271

    Google Scholar 

  44. 44.

    Shi Y, Mi Y, Li J, Liu W (2018) Concept-cognitive learning model for incremental concept learning. IEEE Trans Syst Man Cyber 1(1):1–13

    Google Scholar 

  45. 45.

    Skowron A (1993) Boolean reasoning for implication rules generation. Methodologies for intelligent systems. Springer-Verlag, Berlin

    Google Scholar 

  46. 46.

    Stong RE (1966) Finite topological spaces. T Am Math Soc 123(2):325–340

    MathSciNet  MATH  Google Scholar 

  47. 47.

    Tan AH, Li J, Lin G (2015) Connections between covering-based rough sets and concept lattices. Int J Approx Reason 56:43–58

    MathSciNet  MATH  Google Scholar 

  48. 48.

    Valtchev P, Missaoui R, Godin R (2004) Formal concept analysis for knowledge discovery and data mining: the new challenge. In: Proceedings of the 2nd International Conference on Formal Concept Analysis, Sydney, Australia, pp 352–371

  49. 49.

    Wang LD, Liu XD (2008) Concept analysis via rough set and AFS algebra. Inf Sci 178(21):4125–4137

    MathSciNet  MATH  Google Scholar 

  50. 50.

    Wang H, Zhang WX (2008) Approaches to knowledge reduction in generalized consistent decision formal context. Math Comput Model 48(11–12):1677–1684

    MathSciNet  MATH  Google Scholar 

  51. 51.

    Wang C, Huang Y, Shao M, Chen D (2019) Uncertainty measures for general fuzzy relations. Fuzzy Sets Syst 360:82–96

    MathSciNet  MATH  Google Scholar 

  52. 52.

    Wang C, Huang Y, Shao M, Fan X (2019) Fuzzy rough set-based attribute reduction using distance measures. Knowl Based Syst 164:205–212

    Google Scholar 

  53. 53.

    Wei L, Qi JJ, Zhang WX (2008) Attribute reduction theory of concept lattice based on decision formal contexts. Sci China Ser F 51(7):910–923

    MathSciNet  MATH  Google Scholar 

  54. 54.

    Wei L, Qi JJ (2010) Relation between concept lattice reduction and rough set reduction. Knowl-Based Syst 23:934–938

    Google Scholar 

  55. 55.

    Wei L, Wan Q (2016) Granular transformation and irreducible element judgment theory based on pictorial diagrams. IEEE Trans Cybern 46(2):380–387

    Google Scholar 

  56. 56.

    Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I (ed) Ordered Sets. Reidel, Dordrecht-Boston, pp 445–470

    Google Scholar 

  57. 57.

    Wille R (2002) Why can concept lattices support knowledge discovery in databases? J Exp Theor Artif Intell 14(2–3):81–92

    MATH  Google Scholar 

  58. 58.

    Wu WZ, Leung Y, Mi JS (2009) Granular computing and knowledge reduction in formal context. IEEE Trans Knowl Data Eng 21(10):1461–1474

    Google Scholar 

  59. 59.

    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

    MathSciNet  Google Scholar 

  60. 60.

    Zhang WX, Wei L, Qi JJ (2005) Attribute reduction in concept lattice based on discernibility matrix. Lect Notes Comput Sci 3642:157–165

    MATH  Google Scholar 

  61. 61.

    Zhang WX, Qiu GF (2005) Uncertain decision making based on rough sets. Tsinghua University Press, Beijing

    Google Scholar 

  62. 62.

    Zhang WX, Ma JM, Fan SQ (2007) Variable threshold concept lattices. Inf Sci 177(22):4883–4892

    MathSciNet  MATH  Google Scholar 

Download references


We would like to thank the referees for their valuable comments and suggestions. This work was supported by the National Natural Science Foundation of China (Nos. 61170107, 61672272 and 11871259), the Natural Science Foundation of Fujian Province (Nos. 2017J01507 and 2018J01548), the Natural Science Foundation of Hebei Province (Nos. A2018205103, F2018205196 and CXZZBS2019076) and the Foundation of Minnan Normal University (No. L11802).

Author information



Corresponding author

Correspondence to Jinkun Chen.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Chen, J., Mi, J., Xie, B. et al. Attribute reduction in formal decision contexts and its application to finite topological spaces. Int. J. Mach. Learn. & Cyber. 12, 39–52 (2021).

Download citation


  • Attribute reduction
  • Formal decision contexts
  • Subbases
  • Topological spaces