Skip to main content

Advertisement

SpringerLink
Log in

Cognitive Computing and Rule Extraction in Generalized One-sided Formal Contexts

  • Published:
Cognitive Computation Aims and scope Submit manuscript

Abstract

As an effective tool for analyzing human behavior and social cognition, rule extraction is a key issue in cognitive computing. However, the existing association rules state whether an attribute is possessed only without considering the order relation of attribute values. In this paper, we propose a novel method for quantitative association rule mining based on a generalized one-sided context and solid cognitive foundations. The extracted rule indicates the order relation of the attribute values and the structure of truth values for different attributes. We also propose specific algorithms to extract generalized one-sided quantitative association rules and non-redundant generalized one-sided quantitative association rules. The scale of data also needs to be considered by cognitive computing. An object may possess different values for the same attribute according to different measuring scales. The relationship between generalized one-sided quantitative association rules at different scales is also discussed. Rather than converting the multi-valued formal context into a binary formal context, the generalized one-sided quantitative association rule is extracted directly in a multi-valued formal context. The experimental results show the presented algorithms reduce both time and space complexity compared with the classical quantitative association rule-mining algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Judith H, Marcia K, Adrian B. Cognitive computing and big data analytics. Indiana: Wiley. 2015.

  2. Agrawal R, Imielinaki T, Swami AN. Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of data 1993;207–216.

  3. Agrawal R, Srikant R. Fast algorithms for mining association rules. Proceedings of the 20th Internationa Conference on Very Large Data Bases 1994;487–499.

  4. Park JS, Chen MS, Yu PS. An effective hash-based algorithm for mining association rules. Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data 1997;175–186.

  5. Brin S, Motwani R, Ullman JD, Tsur S. Dynamic itemset counting and implication rules for market basket data. Proceedings of the 1997 ACM SIGMOD International Conference on Management of data 1997;255–264.

  6. Wang CX, Zheng XY. Application of improved time series apriori algorithm by frequent itemsets in association rule data mining based on temporal constraint. Evol Intel. 2020;13:39–49.

    Article  Google Scholar 

  7. Savasere A, Omiecinski E, Navathe S. An efficient algorithm for mining association rules in large databases. Proceedings of the 21th International Conference on Very Large Data Bases 1995;432–444.

  8. Srikant R, Agrawal R. Mining quantitative association rules in large relational tables. Proce Edings of the 1996 ACM SIGMOD International Conference on Management of data 1996;1–12.

  9. Miller RJ, Yang YQ. Association rules over interval data. Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data. 1997. https://doi.org/10.1145/253262.253361.

  10. Shukla S, Mohanty BK, Kumar A. A multi attribute value theory approach to rank association rules for leveraging better business decision making. Procedia Comput Sci. 2017;122:1031–8.

    Article  Google Scholar 

  11. Moslehi F, Haeri A, Martínez-Álvarez F. A novel hybrid GA-PSO framework for mining quantitative association rules. Soft Comput. 2020;6(24):4645–66.

    Article  Google Scholar 

  12. Xu WH, Guo YT. Generalized multigranulation double-quantitative decision-theoretic rough set. Knowl-Based Syst. 2016;105(1):190–205.

    Article  Google Scholar 

  13. Wille R. Restructing lattice theory: an approach based on hierarchies of concepts. Orderd Sets D Reidel. 1982;83:314–39.

    MATH  Google Scholar 

  14. Zou LG, Zhang ZP, Long J, Zhang H. A fast incremental algorithm for deleting objects from a concept lattice. Knowl-Based Syst. 2015;89:411–9.

    Article  Google Scholar 

  15. Chen JK, Mi JS, Lin YJ. A graph approach for fuzzy-rough feature selection. Fuzzy Set Syst. 2020;391:96–116.

    Article  MathSciNet  MATH  Google Scholar 

  16. Hu JH, Chen D, Liang P. A novel interval three-way concept lattice model with its application in medical diagnosis. Mathematics-Basel. 2019;7(1):103.

    Google Scholar 

  17. Wu X, Zhang JL, Lu RH. Attribute logic formula description of granule and its application to build concept lattice. IEEE Access. 2020;8:12592–606.

    Article  Google Scholar 

  18. Zou CF, Deng HF. Using fuzzy concept lattice for intelligent disease diagnosis. IEEE Access. 2017;5:236–42.

    Article  Google Scholar 

  19. Xu WH, Li WT. Granular computing approach to two-way learning based on formal concept analysis in fuzzy datasets. IEEE T Cybernetics. 2016;46(2):366–79.

    Article  MathSciNet  Google Scholar 

  20. Ren Y, Li JH, Kumar CA. Rule acquisition in formal decision contexts based on formal, object-oriented and property-oriented concept lattices. Sci World J. 2014;2014:1–10.

    Google Scholar 

  21. Yang YF, Zhang R, Liu BX. Dynamic parallel mining algorithm of association rules based on interval concept lattice. Mathematics-Basel. 2019;7(7):647.

    Google Scholar 

  22. Ganter B. Formal concept analysis: mathematical foundations. New York: Springer-Verlag; 1999.

    Book  MATH  Google Scholar 

  23. Konecny J. On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices. Fuzzy Set Syst. 2018;351(15):108–21.

    Article  MathSciNet  MATH  Google Scholar 

  24. Xu WH, Li JH, Wei L, Zhang T, Li WT. Formal concept analysis: theory and application. Beijing: Beijing Science Press; 2016.

    Google Scholar 

  25. Yao YY. Three-Way decisions and cognitive computing. Cogn Comput. 2016;8:543–54.

    Article  Google Scholar 

  26. Qi JJ, Wei L, Yao YY. Three-way formal concept analysis LNCS. 2014;818:732–41.

    Google Scholar 

  27. Yang H, Qin KY. Relationship between attribute(object) oriented multi-granularity concept lattices. J Front Comp Sci Tech. 2020;3:527–33.

    Google Scholar 

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

    Article  Google Scholar 

  29. Kong QZ, Zhang XW, Xu WH, Xie ST. Attribute reducts of multi-granulation information system. Artif Intell Rev. 2020;53(2):1353–71.

    Article  Google Scholar 

  30. Butka P, Pócs J. Generalization of one-sided concept lattices. Comput Inform. 2013;32(2):355–70.

    MathSciNet  MATH  Google Scholar 

  31. Shao MW, LI KW. Attribute reduction in generalized one-sided formal contexts. Inform Sciences 2017;378:317–327.

  32. Godin R, Missaoui R. An incremental concept formation approach for learning from databases. Theor Comput Sci. 1994;133:387–419.

    Article  MathSciNet  MATH  Google Scholar 

  33. Fang G, Wu Y, Li M, Chen J. An efficient algorithm for mining frequent closed itemsets. Comput Inform. 2015;39(1):87–98.

    MathSciNet  Google Scholar 

  34. Li JH, Huang CC, Mei CL, Yin YQ. An intensive study on rule acquisition in formal decision contexts based on minimal closed label concept lattices. Intell Autom Soft Co. 2017;23(3):519–33.

    Article  Google Scholar 

  35. Vo B, Le B. Interestingness measures for association rules: combination between lattice and hash tables. Expert Syst Appl. 2011;38(9):11630–40.

    Article  Google Scholar 

  36. Wu WZ, Leung Y. Theory and applications of granular labelled partitions in multi-scale decision tables. Info Sci. 2011;181(18):3878–97.

    Article  MATH  Google Scholar 

  37. Yang L, Xu WH, Zhang XY, Sang BB. Multi-granulation method for information fusion in multi-source decision information system. Int J Approx Reason. 2020;122:47–65.

    Article  MathSciNet  MATH  Google Scholar 

  38. Xu WH, Yu JH. A novel approach to information fusion in multi-source datasets: A granular computing viewpoint.Inform Sciences 2017;378:410–423.

  39. Gu SM, Wu WZ. On knowledge acquisition in multi-scale decision systems. Int J Mach Learn Cyb. 2013;4(5):477–86.

    Article  Google Scholar 

  40. Huang ZH, Li JH, Dai WZ, Lin RD. Generalized multi-scale decision tables with multi-scale decision attributes. Int J Approx Reason. 2019;155:194–208.

    Article  MathSciNet  MATH  Google Scholar 

  41. Han JW, Kamber M, Pei J. Data mining: concepts and techniques. 3rd ed. San Francisco: Margan Kaufmann; 2011.

    MATH  Google Scholar 

  42. Zaki MJ. Mining non-redundant association rules. Data Min Knowl Disc. 2004;9(3):223–48.

    Article  MathSciNet  Google Scholar 

  43. Dong XJ, Hao F, Zhao L, Xu TT. An efficient method for pruning redundant negative and positive association rules. Neurocomputing. 2020;393:245–58.

    Article  Google Scholar 

  44. Wu WZ, Leung Y. Optimal scale selection for multi-scale decision tables. Int J Approx Reason. 2013;54:1107–29.

    Article  MathSciNet  MATH  Google Scholar 

  45. Belohlavek R, DeBaets B, Konecny J. Granularity of attributes in formal concept analysis. Info Sci. 2014;260:149–70.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, China University of Petroleum (East China), Qingdao, China

    Mingwen Shao & Huan Liu

  2. College of Control Science and Engineering, China University of Petroleum (East China), Qingdao, China

    Zhiyong Hu

  3. School of Mathematical Sciences, Hebei Normal University, Shijiazhuang, China

    Jvsheng Mi

Authors
  1. Zhiyong Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mingwen Shao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Huan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jvsheng Mi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mingwen Shao.

Ethics declarations

Disclosure of potential conflicts of interest

This work was supported by the National Natural Science Foundation of China(Nos.62076088)

Research involving human participants and/or animals

The research doesn’t involve human participants or animals.

Informed consent

All authors consent all requirements of the journal.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hu, Z., Shao, M., Liu, H. et al. Cognitive Computing and Rule Extraction in Generalized One-sided Formal Contexts. Cogn Comput 14, 2087–2107 (2022). https://doi.org/10.1007/s12559-021-09868-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12559-021-09868-z

Keywords

Search

Navigation