Skip to main content
SpringerLink
Log in

Research on Parallel Attribute Exploration Algorithm Based on Unrelated Attribute and Intent Sets

  • Conference paper
  • First Online:
Simulation Tools and Techniques (SIMUtools 2021)

Included in the following conference series:

  • 836 Accesses

Abstract

The attribute exploration algorithm is an important knowledge discovery tool for obtaining the stem basis and intent of a given formal context in formal concept analysis. However, when the scale of the formal context is large, the traditional attribute exploration algorithm and the improved attribute exploration algorithm still traverse the attribute sets in the lexicographical order, which leads to the calculation process of the algorithm is too time-consuming. It seriously hinders the promotion and application of the current big data era. The time-consuming bottleneck mainly exists in the link of “traversing attribute sets in the lexicographic order”. To solve this problem, first, we construct a prefix dictionary tree in the inverse linear order of the attribute sets in the inter-layer cardinality order and use the irrelevant definition. Second, we propose and prove three theorems by the above definition and formal concept analysis. Third, according to these theorems, we put forward a new parallel attribute exploration algorithm based on attribute and intent sets. In the process of calculating intent and pseudo-intent sets, the algorithm skips the computing process of attribute sets which are intent sets and neither intent nor pseudo-intent sets with the help of these proposed theorems and reduces search space of the algorithm and the scale of implication calculation, so as to reduce the time complexity. Experimental results show that the worst time complexity of the algorithm is \(O(M^{2}\times \max (P, G))\). Compared with the improved algorithm, this algorithm has obvious time performance advantages.

This work was supported by the Scientific and technological project of Henan Province (Grant No. 202102310340), Foundation of University Young Key Teacher of Henan Province (Grant No. 2019GGJS040, 2020GGJS027), and Key scientific research projects of colleges and universities in Henan Province (Grant No. 21A110005).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Ganter, B.: Formal Concept Analysis: Mathematical Foundations, 1st edn. Springer, Heidelberg (1999)

    Google Scholar 

  2. Li, J., et al.: Concept lattice theory and method and their research prospect. Pattern Recogn. Artif. Intell. 33(7), 619–642 (2020)

    Google Scholar 

  3. Zhang, L., Zhang, H., Shen, X., Yin, L.: A bottom-up algorithm of vertical assembling concept lattices. Int. J. Data Min. Bioinform. 7, 229–244 (2013)

    Google Scholar 

  4. Yang, J., Shen, X., Chen, W., Ge, Q., Zhang, L., Chen, H.: A model study on collaborative learning and exploration of RBAC roles. Wirel. Commun. Mob. Comput. (2021). https://doi.org/10.1155/2021/5549109

  5. Shemis, E., Mohammed, A.: A comprehensive review on updating concept lattices and its application in updating association rules. Wiley Interdisc. Rev. Data Min. Knowl. Discov. 11(2), e1401 (2021)

    Google Scholar 

  6. Shen, X., Yang, J., Zhang, L., Yang, G.: An interactive role learning and discovery model for multi-department RBAC building based on attribute exploration. J. Ambient Intell. Humaniz. Comput. (2020). https://doi.org/10.1007/s12652-020-02634-3

  7. Zhang, L., Huang, Z., Liu, W., Guo, Z., Zhang, Z.: Weather radar echo prediction method based on convolution neural network and Long Short-Term memory networks for sustainable e-Agriculture. J. Clean. Prod. (2021). https://doi.org/10.1016/j.jclepro.2021.126776

  8. Zhang, L., Xu, C., Gao, Y., Han, Y., Du, X., Tian, Z.: Improved Dota2 lineup recommendation model based on a bidirectional LSTM. Tsinghua Sci. Technol. 25(6), 712–720 (2020)

    Google Scholar 

  9. Wei, L., Liu, L., Qi, J., Qian, T.: Rules acquisition of formal decision contexts based on three-way concept lattices. Inf. Sci. 516, 529–544 (2020). https://doi.org/10.1016/j.ins.2019.12.024

  10. Zhang, L., Tang, S., Lv, L.: An finite iterative algorithm for sloving periodic Sylvester bimatrix equations. J. Frankl. Inst. 357(15), 10757–10772 (2020)

    Google Scholar 

  11. Hua, M., Zhen, Z., Xiaoqing, L.: A method for mining decision rules based on decision formal context. J. Hebei Univ. (Nat. Sci. Ed.) 9(01), 1–6 (2021)

    Google Scholar 

  12. Ling, W., Siyu, Z.: Granules and knowledge structure in three-way concept analysis. J. Northwest Univ. (Nat. Sci. Ed.) 50(04), 537–545 (2020)

    Google Scholar 

  13. Xueyan, Z.: Research on role updating technology based on concept lattices. Inner Mongolia University of Science and Technology (2020)

    Google Scholar 

  14. Jingyu, W., Junqing, L., Yuesheng, T.: Design of role based access control for triadic concept analysis. J. Harbin Univ. Sci. Technol. 25(02), 31–37 (2020)

    Google Scholar 

  15. Tang, J., Wei, L., Ren, R., Zhao, S.: Granule description using possible attribute analysis. J. Shandong Univ. (Nat. Sci. Ed.) 56(01), 75–82 (2021)

    Google Scholar 

  16. Mi, Y., Liu, W., Shi, Y., Li, J.: Semi-supervised concept learning by concept-cognitive learning and concept space. IEEE Trans. Knowl. Data Eng. (99), 11 (2020)

    Google Scholar 

  17. Huilai, Z., Li, Y.: Knowledge representation based on concept cluster. J. Northwest Univ. (Nat. Sci. Ed.) 50(04), 529–536 (2020)

    Google Scholar 

  18. Yan, E., Yu, C., Lu, L., Hong, W., Tang, C.: Incremental concept cognitive learning based on three-way partial order structure. Knowl.-Based Syst. 220(23), 106898 (2021). https://doi.org/10.1016/j.knosys.2021.106898

  19. Li, J.H., He, J.J., Wu, W.Z.: Optimization of class-attribute block in multi-granularity formal concept analysis. J. Shandong Univ. (Nat. Sci.) 55(05), 1–12 (2020)

    Google Scholar 

  20. Zhou, Y., Li, J.: Skill reduction and assessment in formal context. Comput. Sci. Explor. 1–10 (2021)

    Google Scholar 

  21. Lei, Z., Yu, H., Qiang, G.: A privacy protection scheme for IoT big data based on time and frequency limitation. Wirel. Commun. Mob. Comput. (3), 1–10 (2021)

    Google Scholar 

  22. Lv, L., et al.: Contract and Lyapunov optimization based load scheduling and energy management for UAV charging stations. IEEE Trans. Green Commun. Netw. https://doi.org/10.1109/TGCN.2021.3085561

  23. Ganter, B., Obiedkov, S.: Conceptual Exploration. 1st edn. Springer, Heidelberg (2016)

    Google Scholar 

  24. Borchmann, D.: A general form of attribute exploration. ArXiv. vol. abs/1202.4824 (2012)

  25. Jäschke, R., Rudolph, S.: Attribute exploration on the web. Computer Science (2013)

    Google Scholar 

  26. Potoniec, J., Rudolph, S., Lawrynowicz, A.: Towards combining machine learning with attribute exploration for ontology refinement. In: International Semantic Web Conference (2014)

    Google Scholar 

  27. Hanika, T., Zumbragel, J.: Towards collaborative conceptual exploration. ArXiv. vol. abs/1712.08858 (2018)

  28. Codocedo, V., Baixeries, J., Kaytoue, M., Napoli, A.: Sampling representation contexts with attribute exploration. In: Cristea, D., Le Ber, F., Sertkaya, B. (eds.) ICFCA 2019. LNCS (LNAI), vol. 11511, pp. 307–314. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-21462-3_20

  29. Reppe, H.: Attribute exploration using implications with proper premises. In: Eklund, P., Haemmerlé, O. (eds.) ICCS-ConceptStruct 2008. LNCS (LNAI), vol. 5113, pp. 161–174. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-70596-3_11

  30. Ryssel, U., Distel, F., Borchmann, D.: Fast algorithms for implication bases and attribute exploration using proper premises. Ann. Math. Artif. Intell. 70(1-2), 25–35 (2013)

    Google Scholar 

  31. Xiaoxiang, Z., Ping, Q.: On attribute exploration algorithms. J. Front. Comput. Sci. Technol. (2009)

    Google Scholar 

  32. Xiajiong, S., Jiyong, Y., Lei, Z.: Attribute discovery algorithm based on unrelated attribute sets. Computer Science (2020)

    Google Scholar 

  33. Distel, F.: Hardness of enumerating pseudo-intents in the lectic order. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS (LNAI), vol. 5986, pp. 124–137. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11928-6_9

  34. Kriegel, F.: Parallel Attribute Exploration. In: Haemmerlé, O., Stapleton, G., Faron Zucker, C. (eds.) ICCS 2016. LNCS (LNAI), vol. 9717, pp. 91–106. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40985-6_8

  35. Shen, X., Yang, J., Zhang, L., Yang, G.: An interactive role learning and discovery model for multi-department RBAC building based on attribute exploration. J. Ambient Intell. Humaniz. Comput. (2020)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Henan Key Laboratory of Big Data Analysis and Processing, Henan University, Kaifeng, Henan, China

    Daojun Han, Wan Chen & Xianyu Zuo

  2. School of Computer and Information Engineering, Henan University, Kaifeng, Henan, China

    Daojun Han, Wan Chen & Xianyu Zuo

Authors
  1. Daojun Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xianyu Zuo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Electronic Science and Technology of China, Chengdu, China

    Dingde Jiang

  2. Embry-Riddle Aeronautical University, Daytona Beach, FL, USA

    Houbing Song

Rights and permissions

Reprints and permissions

Copyright information

© 2022 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Han, D., Chen, W., Zuo, X. (2022). Research on Parallel Attribute Exploration Algorithm Based on Unrelated Attribute and Intent Sets. In: Jiang, D., Song, H. (eds) Simulation Tools and Techniques. SIMUtools 2021. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 424. Springer, Cham. https://doi.org/10.1007/978-3-030-97124-3_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-97124-3_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-97123-6

  • Online ISBN: 978-3-030-97124-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation