Advertisement

Soft Computing

, Volume 23, Issue 2, pp 383–391 | Cite as

0–1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices

  • Lifeng LiEmail author
  • Dongxiao Zhang
Foundations
  • 73 Downloads

Abstract

Knowledge reduction is one of the key issues in formal concept analysis, and there have been many studies on this topic. Granule knowledge reduction and attribute reduction are two of the most important knowledge reduction in formal concept analysis. Firstly, theorem to character granule knowledge reduction is given, and granule knowledge reduction method in concept lattices based on 0–1 linear integer programming is proposed in this paper. Then, characterization theorems of three types attributes are obtained in attribute reduction, and attribute reduction method in concept lattices based on 0–1 linear integer programming is proposed.

Keywords

Concept lattice Granule knowledge reduction Attribute reduction 0–1 linear integer programming 

Notes

Acknowledgements

This work was partially supported by the National Natural Science Foundation of China (GrantNos. 11401469, 11701446) and the Natural Science Foundation of Shanxi Province (2018JM1055) and Natural Science Foundation of Fujian Province (2016J01310).

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human or animal participants performed by any of the authors.

Informed consent

Informed consent is obtained from all individual participants included in the study.

References

  1. Alcalde C, Burusco A, Fuentes-Gonzlez R, Zubia I (2009) Treatment of L-fuzzy contexts with absent values. Inf Sci 179:1–15MathSciNetCrossRefzbMATHGoogle Scholar
  2. Bělohlávek R (2004) Concept lattices and order in fuzzy logic. Ann Pure Appl Log 128:277–298MathSciNetCrossRefzbMATHGoogle Scholar
  3. Bělohlávek R, Sklenář V (2005) Formal concept analysis constrained by attribute dependency formulas. In: Proceedings of ICFCA 2005. Lecture notes in artificial intelligence, pp 176–191Google Scholar
  4. Cornejo ME, Medina J, Ramirez-Poussa E (2015a) On the use of irreducible elements for reducing multi-adjoint concept lattices. Knowl-Based Syst 89:192–202CrossRefzbMATHGoogle Scholar
  5. Cornejo ME, Medina J, Ramirez-Poussa E (2015b) Attribute reduction in multi-adjoint concept lattices. Inf Sci 294:41–56MathSciNetCrossRefzbMATHGoogle Scholar
  6. Cornejo ME, Medina J, Ramirez-Poussa E (2017) Attribute and size reduction mechanisms in multi-adjoint concept lattices. J Comput Appl Math 318:388–402MathSciNetCrossRefzbMATHGoogle Scholar
  7. Deogun JS, Saquer J (2004) Monotone concepts for formal concept analysis. Discrete Appl Math 144(1–2):70–78MathSciNetCrossRefzbMATHGoogle Scholar
  8. Diaby M (1993) Implicit enumeration for the pure integer 0/1 minimax programming problem. Oper Res 41(6):1172–1176CrossRefzbMATHGoogle Scholar
  9. Fan SQ, Zhang WX, Xu W (2006) Fuzzy inference based on fuzzy concept lattice. Fuzzy Sets Syst 157(24):3177–3187MathSciNetCrossRefzbMATHGoogle Scholar
  10. Ferre S, Ridoux O (2000) A logical generalization of formal concept analysis. In: Lecture notes in artificial intelligence, vol 1867, pp 371–384Google Scholar
  11. Ganter B, Wille R (1999) Formal concept analysis: mathematical foundations. Springer, BerlinCrossRefzbMATHGoogle Scholar
  12. Gong QQ, Zhou YQ, Yang Y (2010) Artificial glowworm swarm optimization algorithm for solving 0–1 knapsack problem. Adv Mater Res 143–144:166–171CrossRefGoogle Scholar
  13. 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–212CrossRefGoogle Scholar
  14. Krajci S (2005) A generalized concept lattice. Log J IGPL 13(5):543–550MathSciNetCrossRefzbMATHGoogle Scholar
  15. Laskari EC, Parsopoulos KE, Vrahatis MN (2002) Particle swarm optimization for integer programming. In: Evolutionary computation on CEC02 congress 16(6):1582–1587Google Scholar
  16. Li LF (2017) Multi-level interval-valued fuzzy concept lattices and their attribute reduction. Int J Mach Learn Cybernet 8:45–56CrossRefGoogle Scholar
  17. Li LF, Zhang JK (2010) Attribute reduction in fuzzy concept lattices based on the T implication. Knowl-Based Syst 23(6):497–503MathSciNetCrossRefGoogle Scholar
  18. Li JH, Mei CL, Lv YJ (2011) Knowledge reduction in decision formal contexts. Knowl-Based Syst 24:709–715CrossRefzbMATHGoogle Scholar
  19. Li JH, Mei CL, Lv YJ (2012) Knowledge reduction in real decision formal contexts. Inf Sci 189:191–207MathSciNetCrossRefzbMATHGoogle Scholar
  20. Li JH, Mei CL, Xu WH, Qian YH (2015) Concept learning via granular computing: a cognitive viewpoint. Inf Sci 298:447–467MathSciNetCrossRefzbMATHGoogle Scholar
  21. 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–164CrossRefGoogle Scholar
  22. Liu M, Shao MW, Zhang WX, Wu C (2007) Reduction method for concept lattices based on rough set theory and its application. Comput Math Appl 53(9):1390–1410MathSciNetCrossRefzbMATHGoogle Scholar
  23. Liu X, Wang W, Chai T, Liu W (2007a) Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory I. Inf Sci 177(4):1007–1026MathSciNetCrossRefzbMATHGoogle Scholar
  24. Liu X, Wang W, Chai T, Liu W (2007b) Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory II. Inf Sci 177(4):1027–1045MathSciNetCrossRefzbMATHGoogle Scholar
  25. Lv Y, Liu H, J Li (2009) Attribute reduction of formal context based on concept lattice. In: Sixth international conference on fuzzy systems and knowledge discovery, vol 1, pp 576–580Google Scholar
  26. Marinescu R, Dechter R (2010) Evaluating the impact of AND/OR search on 0–1 integer linear programming. Constraints 15(1):29–63MathSciNetCrossRefzbMATHGoogle Scholar
  27. Medina J, Ojeda-Aciego M (2010) Multi-adjoint t-concept lattices. Inf Sci 180(5):712–725MathSciNetCrossRefzbMATHGoogle Scholar
  28. Medina J, Ojeda-Aciego M, Ruiz-Calvigo J (2009) Formal concept analysis via multi-adjoint concept lattices. Fuzzy Sets Syst 160(2):130–144MathSciNetCrossRefzbMATHGoogle Scholar
  29. Ohtake Y, Nishida N (1985) A branch-and-bound algorithm for 0–1 parametric mixed integer programming. Oper Res Lett 4(1):41–45MathSciNetCrossRefzbMATHGoogle Scholar
  30. Ren R, Wei L (2016) The attribute reductions of three-way concept lattices. Knowl-Based Syst 99:92–102CrossRefGoogle Scholar
  31. Shao MW, Leung Y (2014) Relations between granular reduct and dominance reduct in formal contexts. Knowl-Based Syst 65:1–11CrossRefGoogle Scholar
  32. Shao MW, Li KW (2017) Attribute reduction in generalized one-sided formal contexts. Inf Sci 378:317–327MathSciNetCrossRefGoogle Scholar
  33. Shao MW, Yang HZ, Wu WZ (2014) Rule acquisition and complexity reduction in formal decision contexts. Int J Approx Reason 55:259–274MathSciNetCrossRefzbMATHGoogle Scholar
  34. Shao MW, Yang HZ, Wu WZ (2015) Knowledge reduction in formal fuzzy contexts. Knowl-Based Syst 73:265–275CrossRefGoogle Scholar
  35. Shao W, Hu W, Huang X (2008) A new implicit enumeration method for linear 0–1 programming. In: International workshop on modelling, pp 98–301Google Scholar
  36. Wang X, Zhang WX (2008) Relations of attribute reduction between object and property oriented concept lattices. Knowl-Based Syst 21(5):398–403CrossRefGoogle Scholar
  37. Wang J, Liang J, Qian Y (2010) A heuristic method to attribute reduction for concept lattice. In: International conference on machine learning and cybernetics, vol 1, pp 483–487Google Scholar
  38. Wei L, Qi JJ (2010) Relation between concept lattice reduction and rough set reduction. Knowl-Based Syst 23:934–938CrossRefGoogle Scholar
  39. Wei L, Wan Q (2016) Granular transformation and irreducible element judgment theory based on pictorial diagrams. IEEE Trans Cybern 46(2):380–387CrossRefGoogle Scholar
  40. 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–923MathSciNetzbMATHGoogle Scholar
  41. Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concept. In: Ivan Rival R (ed) Ordered sets. Reidel, Dordecht, Boston, pp 445–470CrossRefGoogle Scholar
  42. Wu WZ, Leung Y, Mi JS (2009) Granular computing and knowledge reduction in formal contexts. IEEE Trans Knowl Data Eng 21(10):1461–1474CrossRefGoogle Scholar
  43. Xu YT, Wang LS, Zhang RY (2011) A dynamic attribute reduction algorithm based on 0–1 integer programming. Knowl-Based Syst 24:1341–1347CrossRefGoogle Scholar
  44. Yang HZ, Shao MW (2007) Two types of generalized variable precision formal concepts. In: Lecture Notes in Computer Science, vol 4585, pp 658–667Google Scholar
  45. Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997) New algorithms for fast discovery of association rules. In: Proceedings of 3rd international conference on database systems for advanced applicationsGoogle Scholar
  46. Zhang WX, Wei L, Qi JJ (2005) Attribute reduction in concept lattice based on discernibility matrix. In: Slezak D et al (eds) RSFDGrC2005. LNAI, vol 3642, pp 157–165Google Scholar
  47. Zhang WX, Ma JM, Fan SQ (2007) Variable threshold concept lattices. Inf Sci 177(22):4883–4892MathSciNetCrossRefzbMATHGoogle Scholar
  48. Zhao YX, Li JH, Liu WQ, Xu WH (2016) Cognitive concept learning from incomplete information. Int J Mach Learn Cybern 7(4):1–12Google Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of ScienceXian University of Posts and TelecommunicationsXianChina
  2. 2.Shaanxi Key Laboratory of Network Data Analysis and Intelligent ProcessingXian University of Posts and TelecommunicationsXianChina
  3. 3.School of ScienceJimei UniversityXiamenChina

Personalised recommendations