Skip to main content
Top
Published in: International Journal of Machine Learning and Cybernetics 1/2017

27-08-2016 | Original Article

Decomposition methods of formal contexts to construct concept lattices

Authors: Ting Qian, Ling Wei, Jianjun Qi

Published in: International Journal of Machine Learning and Cybernetics | Issue 1/2017

Log in

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

search-config
loading …

Abstract

As an important tool for data analysis and knowledge processing, formal concept analysis has been applied to many fields. In this paper, we introduce a decomposition method of a formal context to construct its corresponding concept lattice, which answers an open problem to some extent that how this decomposition method of a context translates into a decomposition method of its corresponding concept lattice. Firstly, based on subcontext, closed relation and pairwise noninclusion covering on the attribute set, we obtain the decomposition theory of a formal context, and then we provide the method and algorithm of constructing the corresponding concept lattice by using this decomposition theory. Moreover, we consider the similar decomposition theory and method of a formal context from the object set. Finally, we make another decomposition of a formal context by combining the above two results.

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!

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!

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!

Show more products
Literature
1.
go back to reference Wang XZ, Xing HJ et al (2015) A study on relationship between generalization abilities and fuzziness of base classifiers in ensemble learning. IEEE Trans Fuzzy Syst 23(5):1638–1654CrossRef Wang XZ, Xing HJ et al (2015) A study on relationship between generalization abilities and fuzziness of base classifiers in ensemble learning. IEEE Trans Fuzzy Syst 23(5):1638–1654CrossRef
2.
go back to reference Wang XZ, Ashfaq RAR, Fu AM (2015) Fuzziness based sample categorization for classifier performance improvement. J Intell Fuzzy Syst 29(3):1185–1196MathSciNetCrossRef Wang XZ, Ashfaq RAR, Fu AM (2015) Fuzziness based sample categorization for classifier performance improvement. J Intell Fuzzy Syst 29(3):1185–1196MathSciNetCrossRef
4.
go back to reference Ashfaq RAR, He YL, Chen DG (2016) Toward an efficient fuzziness based instance selection methodology for intrusion detection system. Int J Mach Learn Cybern. doi:10.1007/s13042-016-0557-4 Ashfaq RAR, He YL, Chen DG (2016) Toward an efficient fuzziness based instance selection methodology for intrusion detection system. Int J Mach Learn Cybern. doi:10.​1007/​s13042-016-0557-4
5.
go back to reference Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I (ed) Ordered sets. Reidel, Dordrecht-Boston, pp 445–470CrossRef Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I (ed) Ordered sets. Reidel, Dordrecht-Boston, pp 445–470CrossRef
6.
go back to reference Ganter B, Wille R (1999) Formal concept analysis: mathematical foundations. Springer-Verlag, BerlinCrossRefMATH Ganter B, Wille R (1999) Formal concept analysis: mathematical foundations. Springer-Verlag, BerlinCrossRefMATH
7.
go back to reference Davey BA, Priestley HA (2002) Introduction to lattices and order. Cambridge University Press, CambridgeCrossRefMATH Davey BA, Priestley HA (2002) Introduction to lattices and order. Cambridge University Press, CambridgeCrossRefMATH
8.
go back to reference Poelmans J, Ignatov DI, Kuznetsov SO, Dedene G (2013) Formal concept analysis in knowledge processing: a survey on applications. Expert systems with applications 40(16):6538–6560CrossRef Poelmans J, Ignatov DI, Kuznetsov SO, Dedene G (2013) Formal concept analysis in knowledge processing: a survey on applications. Expert systems with applications 40(16):6538–6560CrossRef
9.
go back to reference Kaytoue M, Kuznetsov SO, Napoli A, Duplessis S (2011) Mining gene expression data with pattern structures in formal concept analysis. Inf Sci 181(10):1989–2001MathSciNetCrossRef Kaytoue M, Kuznetsov SO, Napoli A, Duplessis S (2011) Mining gene expression data with pattern structures in formal concept analysis. Inf Sci 181(10):1989–2001MathSciNetCrossRef
10.
go back to reference Codocedo V, Napoli A (2015) Formal concept analysis and information retrieval-a survey. ICFCA 9113:61–77MATH Codocedo V, Napoli A (2015) Formal concept analysis and information retrieval-a survey. ICFCA 9113:61–77MATH
11.
12.
go back to reference Tonella P (2003) Using a concept lattice of decomposition slices for program understanding and impact analysis. IEEE Trans Softw Eng 29:495–509CrossRef Tonella P (2003) Using a concept lattice of decomposition slices for program understanding and impact analysis. IEEE Trans Softw Eng 29:495–509CrossRef
13.
go back to reference Ganapathy V, King D, Jaeger T, Jha S (2007) Mining security sensitive operations in legacy code using concept analysis. In: Proc. 29th Int. conference on software engineering, pp 458–467 Ganapathy V, King D, Jaeger T, Jha S (2007) Mining security sensitive operations in legacy code using concept analysis. In: Proc. 29th Int. conference on software engineering, pp 458–467
14.
go back to reference Bělohlávek R, Sigmund E, Zacpal J (2011) Evaluation of IPAQ questionnaires supported by formal concept analysis. Inf Sci 181(10):1774–1786 Bělohlávek R, Sigmund E, Zacpal J (2011) Evaluation of IPAQ questionnaires supported by formal concept analysis. Inf Sci 181(10):1774–1786
15.
go back to reference Singh PK, Kumar CA, Gani A (2016) A comprehensive survey on formal concept analysis, its research trends and applications. Int J Appl Math Comput Sci 26(2):495–516MathSciNetCrossRefMATH Singh PK, Kumar CA, Gani A (2016) A comprehensive survey on formal concept analysis, its research trends and applications. Int J Appl Math Comput Sci 26(2):495–516MathSciNetCrossRefMATH
16.
go back to reference Wu WZ, Leung Y, Mi JS (2009) Granular computing and knowledge reduction in formal contexts. IEEE Trans Knowl Data Eng 21(10):1461–1474CrossRef Wu WZ, Leung Y, Mi JS (2009) Granular computing and knowledge reduction in formal contexts. IEEE Trans Knowl Data Eng 21(10):1461–1474CrossRef
17.
go back to reference Wei L (2005) Reduction theory and approach to rough set and concept lattice. Xi’an Jiaotong University, Xi’an Wei L (2005) Reduction theory and approach to rough set and concept lattice. Xi’an Jiaotong University, Xi’an
18.
go back to reference Shao MW, Leung Y (2014) Relations between granular reduct and dominance reduct in formal contexts. Knowl Based Syst 65:1–11CrossRef Shao MW, Leung Y (2014) Relations between granular reduct and dominance reduct in formal contexts. Knowl Based Syst 65:1–11CrossRef
19.
go back to reference Dias SM, Vieira NJ (2015) Concept lattices reduction: defnition, analysis and classifcation. Expert Syst Appl 42:7084–7097CrossRef Dias SM, Vieira NJ (2015) Concept lattices reduction: defnition, analysis and classifcation. Expert Syst Appl 42:7084–7097CrossRef
20.
go back to reference Mi JS, Leung Y, Wu WZ (2010) Approaches to attribute reduction in concept lattices induced by axialities. Knowl Based Syst 23:504–511CrossRef Mi JS, Leung Y, Wu WZ (2010) Approaches to attribute reduction in concept lattices induced by axialities. Knowl Based Syst 23:504–511CrossRef
21.
go back to reference Ishigure H, Mutoh A, Matsui T, Inuzuka N (2015) Concept lattice reduction using attribute inference. In: IEEE 4th global conference on consumer electronics, Osaka, Japan, pp 108–111 Ishigure H, Mutoh A, Matsui T, Inuzuka N (2015) Concept lattice reduction using attribute inference. In: IEEE 4th global conference on consumer electronics, Osaka, Japan, pp 108–111
22.
go back to reference Kumar CA, Dias SM, Vieira NJ (2015) Knowledge reduction in formal contexts using non-negative matrix factorization. Math Comput Simul 109:46–63MathSciNetCrossRef Kumar CA, Dias SM, Vieira NJ (2015) Knowledge reduction in formal contexts using non-negative matrix factorization. Math Comput Simul 109:46–63MathSciNetCrossRef
23.
go back to reference Shao MW, Leung Y, Wu WZ (2014) Rule acquisition and complexity reduction in formal decision contexts. Int J Approx Reason 55:259–274MathSciNetCrossRefMATH Shao MW, Leung Y, Wu WZ (2014) Rule acquisition and complexity reduction in formal decision contexts. Int J Approx Reason 55:259–274MathSciNetCrossRefMATH
24.
go back to reference 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–165MathSciNetCrossRefMATH 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–165MathSciNetCrossRefMATH
25.
go back to reference Kumar CA, Srinivas S (2010) Mining associations in healthcare data using formal concept analysis and singular value decomposition. Biol Syst 18(4):787–807CrossRef Kumar CA, Srinivas S (2010) Mining associations in healthcare data using formal concept analysis and singular value decomposition. Biol Syst 18(4):787–807CrossRef
26.
go back to reference Kumar CA (2012) Fuzzy clustering based formal concept analysis for association rules mining. Appl Artif Intell 26(3):274–301CrossRef Kumar CA (2012) Fuzzy clustering based formal concept analysis for association rules mining. Appl Artif Intell 26(3):274–301CrossRef
28.
go back to reference Wan Q, Wei L (2015) Approximate concepts acquisition based on formal contexts. Knowl Based Syst 75:78–86CrossRef Wan Q, Wei L (2015) Approximate concepts acquisition based on formal contexts. Knowl Based Syst 75:78–86CrossRef
29.
go back to reference Singh PK, Kumar ChA, Li JH (2015) Concepts reduction in formal concept analysis with fuzzy setting using Shannon entropy. Int J Mach Learn Cybern 6(1):1–11CrossRef Singh PK, Kumar ChA, Li JH (2015) Concepts reduction in formal concept analysis with fuzzy setting using Shannon entropy. Int J Mach Learn Cybern 6(1):1–11CrossRef
30.
go back to reference Bělohlávek R (2000) Similarity relations in concept lattices. Logic Comput 10:823–845 Bělohlávek R (2000) Similarity relations in concept lattices. Logic Comput 10:823–845
31.
32.
go back to reference 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–379CrossRef 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–379CrossRef
33.
go back to reference Li JH, Mei CL, Xu WH, Qian YH (2015) Concept learning via granular computing: a cognitive viewpoint. Inf Sci 298:447–467MathSciNetCrossRef Li JH, Mei CL, Xu WH, Qian YH (2015) Concept learning via granular computing: a cognitive viewpoint. Inf Sci 298:447–467MathSciNetCrossRef
34.
go back to reference 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 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
37.
go back to reference Cornejo ME, Medina J, Eloisa R (2015) Cuts or thresholds, what is the best reduction method in fuzzy formal concept analysis? Fuzzy Systems (FUZZ-IEEE). In: 2015 IEEE international conference on Istanbul. doi:10.1109/FUZZ-IEEE.2015.7337990 Cornejo ME, Medina J, Eloisa R (2015) Cuts or thresholds, what is the best reduction method in fuzzy formal concept analysis? Fuzzy Systems (FUZZ-IEEE). In: 2015 IEEE international conference on Istanbul. doi:10.​1109/​FUZZ-IEEE.​2015.​7337990
38.
go back to reference Yao YY (2016) Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis. Inf Sci 346–347:442–462MathSciNetCrossRef Yao YY (2016) Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis. Inf Sci 346–347:442–462MathSciNetCrossRef
39.
go back to reference Zhi HL, Li JH (2016) Granule description based on formal concept analysis. Knowl Based Syst 104:62–73CrossRef Zhi HL, Li JH (2016) Granule description based on formal concept analysis. Knowl Based Syst 104:62–73CrossRef
41.
go back to reference Yao YY (2012) An outline of a theory of three-way decisions. Rough Set and Knowledge Technology, Spring International Publishing: volume 7413 of Lecture Notes in Computer Science, pp 1–17 Yao YY (2012) An outline of a theory of three-way decisions. Rough Set and Knowledge Technology, Spring International Publishing: volume 7413 of Lecture Notes in Computer Science, pp 1–17
42.
go back to reference Qi JJ, Wei L, Yao YY (2014) Three-way formal concept analysis. rough set and knowledge technology. In: Lecture notes in computer science, vol 8818. Spring International Publishing, pp 732–741 Qi JJ, Wei L, Yao YY (2014) Three-way formal concept analysis. rough set and knowledge technology. In: Lecture notes in computer science, vol 8818. Spring International Publishing, pp 732–741
43.
go back to reference Bělohlávek R, Vychodil V (2010) Discovery of optimal factors in binary data via a novel method of matrix decomposition. J Comput Syst Sci 76:3–20 Bělohlávek R, Vychodil V (2010) Discovery of optimal factors in binary data via a novel method of matrix decomposition. J Comput Syst Sci 76:3–20
44.
go back to reference Outrata J, Vychodil V (2012) Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Inf Sci 185:114–127MathSciNetCrossRefMATH Outrata J, Vychodil V (2012) Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Inf Sci 185:114–127MathSciNetCrossRefMATH
45.
go back to reference Zou L, Zhang Z, Long J (2015) A fast incremental algorithm for constructing concept lattices. Expert Syst Appl 42:4474–4481CrossRef Zou L, Zhang Z, Long J (2015) A fast incremental algorithm for constructing concept lattices. Expert Syst Appl 42:4474–4481CrossRef
46.
go back to reference Qian T, Wei L (2014) A novel concept acquisition approach based on formal contexts. Sci World J 1:1–7CrossRef Qian T, Wei L (2014) A novel concept acquisition approach based on formal contexts. Sci World J 1:1–7CrossRef
47.
go back to reference Krajca P, Outrata J, Vychodil V (2010) Parallel algorithm for computing fixpoints of Galois connections. Ann Math Artif Intell 59(2):257–272MathSciNetCrossRefMATH Krajca P, Outrata J, Vychodil V (2010) Parallel algorithm for computing fixpoints of Galois connections. Ann Math Artif Intell 59(2):257–272MathSciNetCrossRefMATH
48.
go back to reference Kourie DG, Obiedkov S, Watson BW, Vander MD (2009) An incremental algorithm to construct a lattice of set intersections. Sci Comput Program 74:128–142MathSciNetCrossRefMATH Kourie DG, Obiedkov S, Watson BW, Vander MD (2009) An incremental algorithm to construct a lattice of set intersections. Sci Comput Program 74:128–142MathSciNetCrossRefMATH
49.
go back to reference Qi JJ, Wei L, Li ZZ (2005) A partitional view of concept lattice. In: Rough set, fuzzy set, data mining, and granular computing. Lecture notes in computer science, vol 3641. Spring, Berlin, pp 74–83 Qi JJ, Wei L, Li ZZ (2005) A partitional view of concept lattice. In: Rough set, fuzzy set, data mining, and granular computing. Lecture notes in computer science, vol 3641. Spring, Berlin, pp 74–83
50.
go back to reference Qi JJ, Liu W, Wei L (2012) Computing the set of concepts through the composition and decomposition of formal contexts. Int Conf Mach Learn Cybern 4:1326–1332 Qi JJ, Liu W, Wei L (2012) Computing the set of concepts through the composition and decomposition of formal contexts. Int Conf Mach Learn Cybern 4:1326–1332
Metadata
Title
Decomposition methods of formal contexts to construct concept lattices
Authors
Ting Qian
Ling Wei
Jianjun Qi
Publication date
27-08-2016
Publisher
Springer Berlin Heidelberg
Published in
International Journal of Machine Learning and Cybernetics / Issue 1/2017
Print ISSN: 1868-8071
Electronic ISSN: 1868-808X
DOI
https://doi.org/10.1007/s13042-016-0578-z

Other articles of this Issue 1/2017

International Journal of Machine Learning and Cybernetics 1/2017 Go to the issue

Editorial

Editorial