Skip to main content

A Fast Methodology to Find Decisively Strong Association Rules (DSR) by Mining Datasets of Security Records

  • Conference paper
  • First Online:
Optimization and Learning (OLA 2023)

Abstract

Cybersecurity bulletins officially recognize and publicly share the vulnerabilities of Information Systems. The attacks exploit various aspects of those vulnerabilities, compromising confidentiality, integrity or availability of the data collected. We analyze a public dataset of security records so to obtain some common features and to be able to forecast future attacks. We propose an intervention based on history of attacks through data mining methods and so a more dynamic risk analysis, by concentrating on some specific classes of cyberattacks in a period of two years. We devise a fast algorithm to find strong rules which provide an estimate of the probability that these attacks will occur so to identify adequate controls and countermeasures.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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

Notes

  1. 1.

    https://nvd.nist.gov.

  2. 2.

    https://cve.mitre.org.

  3. 3.

    https://cwe.mitre.org/data/definitions/1000.html.

  4. 4.

    https://capec.mitre.org.

  5. 5.

    https://attack.mitre.org/matrices.

  6. 6.

    https://vuldb.com.

References

  1. Agrawal, M., Mishra, M., Kushwah, S.P.S.: Association rules optimization using improved PSO algorithm. In: 2015 International Conference on Communication Networks (ICCN). IEEE (2015)

    Google Scholar 

  2. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Rec. 22(2), 207–216 (1993)

    Article  Google Scholar 

  3. Cavallaro, C., Verga, G., Tramontana, E., Muscato, O.: Suggesting just enough (Un)crowded routes and destinations. In: CEUR Workshop Proceedings, vol. 2706, pp. 237–251 (2020)

    Google Scholar 

  4. Cavallaro, C., Ronchieri, E.: Identifying anomaly detection patterns from log files: a dynamic approach. In: Gervasi, O., et al. (eds.) ICCSA 2021. LNCS, vol. 12950, pp. 517–532. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-86960-1_36

    Chapter  Google Scholar 

  5. Cavallaro, C., Vizzari, G.: A novel spatial–temporal analysis approach to pedestrian groups detection. Procedia Comput. Sci. 207, 2364–2373 (2022)

    Article  Google Scholar 

  6. Dodiya, B., Singh, U.K., Gupta, V.: Trend analysis of the CVE classes across CVSS metrics. Int. J. Comput. Appl. 183(33), 23–30 (2021)

    Google Scholar 

  7. Fan, J., Li, Y., Wang, S., Nguyen, T.N.: A C/C++ code vulnerability dataset with code changes and CVE summaries. In: Proceedings of the 17th International Conference on Mining Software Repositories. ACM (2020)

    Google Scholar 

  8. Fouladvand, S., Osareh, A., Shadgar, B., Pavone, M., Sharafi, S.: DENSA: an effective negative selection algorithm with flexible boundaries for self-space and dynamic number of detectors. Eng. Appl. Artif. Intell. 62, 359–372 (2017)

    Article  Google Scholar 

  9. Ghafari, S.M., Tjortjis, C.: A survey on association rules mining using heuristics. WIREs Data Min. Knowl. Discov. 9(4), e1307 (2019)

    Google Scholar 

  10. Han, J., et al.: PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings of the 17th International Conference on Data Engineering, pp. 215–224. IEEE (2001)

    Google Scholar 

  11. Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)

    Article  MathSciNet  Google Scholar 

  12. Katos, V., et al.: State of vulnerabilities 2018/2019 : analysis of events in the life of vulnerabilities. European Network and Information Security Agency (2020). for Cybersecurity, E.U.A.

    Google Scholar 

  13. Li, Z., Li, X., Tang, R., Zhang, L.: Apriori algorithm for the data mining of global cyberspace security issues for human participatory based on association rules. Front. Psychol. 11, 582480 (2021)

    Article  Google Scholar 

  14. Murtaza, S.S., Khreich, W., Hamou-Lhadj, A., Bener, A.B.: Mining trends and patterns of software vulnerabilities. J. Syst. Softw. 117, 218–228 (2016)

    Article  Google Scholar 

  15. Saboori, E., Parsazad, S., Sanatkhani, Y.: Automatic firewall rules generator for anomaly detection systems with Apriori algorithm. In: 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE). IEEE (2010)

    Google Scholar 

  16. Tisbeni, S.R., et al.: A big data platform for heterogeneous data collection and analysis in large-scale data centers. In: Proceedings of International Symposium on Grids & Clouds 2021 — PoS (ISGC2021). Sissa Medialab (2021)

    Google Scholar 

  17. Yan, X., Zhang, C., Zhang, S.: Genetic algorithm-based strategy for identifying association rules without specifying actual minimum support. Expert Syst. Appl. 36(2, Part 2), 3066–3076 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mario Pavone .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cavallaro, C., Cutello, V., Pavone, M., Zito, F. (2023). A Fast Methodology to Find Decisively Strong Association Rules (DSR) by Mining Datasets of Security Records. In: Dorronsoro, B., Chicano, F., Danoy, G., Talbi, EG. (eds) Optimization and Learning. OLA 2023. Communications in Computer and Information Science, vol 1824. Springer, Cham. https://doi.org/10.1007/978-3-031-34020-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-34020-8_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-34019-2

  • Online ISBN: 978-3-031-34020-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics