Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Soft Computing
Published in: Soft Computing 2/2019

29-06-2018 | Foundations

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

Authors: Lifeng Li, Dongxiao Zhang

Published in: Soft Computing | Issue 2/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.
previous article Topological spaces of monadic MV-algebras
next article Hesitant fuzzy Lukasiewicz implication operation and its application to alternatives’ sorting and clustering analysis

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now
Literature
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–191
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–202CrossRefMATH
Cornejo ME, Medina J, Ramirez-Poussa E (2017) Attribute and size reduction mechanisms in multi-adjoint concept lattices. J Comput Appl Math 318:388–402MathSciNetCrossRefMATH
Diaby M (1993) Implicit enumeration for the pure integer 0/1 minimax programming problem. Oper Res 41(6):1172–1176CrossRefMATH
Ferre S, Ridoux O (2000) A logical generalization of formal concept analysis. In: Lecture notes in artificial intelligence, vol 1867, pp 371–384
Ganter B, Wille R (1999) Formal concept analysis: mathematical foundations. Springer, BerlinCrossRefMATH
Gong QQ, Zhou YQ, Yang Y (2010) Artificial glowworm swarm optimization algorithm for solving 0–1 knapsack problem. Adv Mater Res 143–144:166–171CrossRef
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–212CrossRef
Laskari EC, Parsopoulos KE, Vrahatis MN (2002) Particle swarm optimization for integer programming. In: Evolutionary computation on CEC02 congress 16(6):1582–1587
Li LF (2017) Multi-level interval-valued fuzzy concept lattices and their attribute reduction. Int J Mach Learn Cybernet 8:45–56CrossRef
Li LF, Zhang JK (2010) Attribute reduction in fuzzy concept lattices based on the T implication. Knowl-Based Syst 23(6):497–503MathSciNetCrossRef
Li JH, Mei CL, Lv YJ (2011) Knowledge reduction in decision formal contexts. Knowl-Based Syst 24:709–715CrossRefMATH
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–164CrossRef
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–1410MathSciNetCrossRefMATH
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–1026MathSciNetCrossRefMATH
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–1045MathSciNetCrossRefMATH
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–580
Marinescu R, Dechter R (2010) Evaluating the impact of AND/OR search on 0–1 integer linear programming. Constraints 15(1):29–63MathSciNetCrossRefMATH
Medina J, Ojeda-Aciego M, Ruiz-Calvigo J (2009) Formal concept analysis via multi-adjoint concept lattices. Fuzzy Sets Syst 160(2):130–144MathSciNetCrossRefMATH
Ren R, Wei L (2016) The attribute reductions of three-way concept lattices. Knowl-Based Syst 99:92–102CrossRef
Shao MW, Leung Y (2014) Relations between granular reduct and dominance reduct in formal contexts. Knowl-Based Syst 65:1–11CrossRef
Shao MW, Yang HZ, Wu WZ (2014) Rule acquisition and complexity reduction in formal decision contexts. Int J Approx Reason 55:259–274MathSciNetCrossRefMATH
Shao MW, Yang HZ, Wu WZ (2015) Knowledge reduction in formal fuzzy contexts. Knowl-Based Syst 73:265–275CrossRef
Shao W, Hu W, Huang X (2008) A new implicit enumeration method for linear 0–1 programming. In: International workshop on modelling, pp 98–301
Wang X, Zhang WX (2008) Relations of attribute reduction between object and property oriented concept lattices. Knowl-Based Syst 21(5):398–403CrossRef
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–487
Wei L, Qi JJ (2010) Relation between concept lattice reduction and rough set reduction. Knowl-Based Syst 23:934–938CrossRef
Wei L, Wan Q (2016) Granular transformation and irreducible element judgment theory based on pictorial diagrams. IEEE Trans Cybern 46(2):380–387CrossRef
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–923MathSciNetMATH
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–470CrossRef
Wu WZ, Leung Y, Mi JS (2009) Granular computing and knowledge reduction in formal contexts. IEEE Trans Knowl Data Eng 21(10):1461–1474CrossRef
Xu YT, Wang LS, Zhang RY (2011) A dynamic attribute reduction algorithm based on 0–1 integer programming. Knowl-Based Syst 24:1341–1347CrossRef
Yang HZ, Shao MW (2007) Two types of generalized variable precision formal concepts. In: Lecture Notes in Computer Science, vol 4585, pp 658–667
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 applications
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–165
Zhao YX, Li JH, Liu WQ, Xu WH (2016) Cognitive concept learning from incomplete information. Int J Mach Learn Cybern 7(4):1–12
Metadata
Title
0–1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices
Authors
Lifeng Li
Dongxiao Zhang
Publication date
29-06-2018
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 2/2019
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-018-3352-1

Other articles of this Issue 2/2019

Soft Computing 2/2019 Go to the issue

Methodologies and Application

Ontology-based GFML agent for patent technology requirement evaluation and recommendation

Methodologies and Application

A survey on data mining techniques in recommender systems

Methodologies and Application

Clustering-based Optimized HEED protocols for WSNs using bacterial foraging optimization and fuzzy logic system

Methodologies and Application

Swarming movement of dynamical multi-agent systems with sampling control and time delays

Foundations

Homomorphism between ordered decision systems

Foundations

Topological spaces of monadic MV-algebras

Premium Partner

    Image Credits