Skip to main content

An Answer Set Programming Based Framework for High-Utility Pattern Mining Extended with Facets and Advanced Utility Functions

  • Conference paper
  • First Online:
Rules and Reasoning (RuleML+RR 2021)

Abstract

In the context of pattern mining, the utility of a pattern can be described as a preference ordering over a choice set; it can be actually assessed from very different perspectives and at different abstraction levels. However, while the topic of High-Utility Pattern Mining (HUPM) has been widely studied, the basic assumption is that each item in a knowledge base is associated with one, static utility. In this paper we introduce, among others, the notion of facets for items, which allows to cope with this limitation and, moreover, we show how a more structured representation of available information, coupled with facets defined also for higher abstraction levels, paves the way to new opportunities for HUPM. In particular, the proposed framework allows to introduce some new advanced classes of utility functions in the detection process, whose relevance is also experimentally evaluated. A real use case on paper reviews is exploited to analyze the potentiality of the proposed framework in knowledge creation and discovery. Given the wide variety of analytical scenarios that can be envisioned in this new setting, we take full advantage of the capabilities of Answer Set Programming and its extensions for a fast encoding and testing of the framework.

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

    The online Appendix is available at https://www.mat.unical.it/~cauteruccio/rulemlrr21.

  2. 2.

    https://spacy.io/.

References

  1. Chakraborty, S., Goyal, P., Mukherjee, A.: Aspect-based sentiment analysis of scientific reviews. In: JCDL 2020: Proceedings of the ACM/IEEE Joint Conference on Digital Libraries in 2020, Virtual Event, China, 1–5 August 2020, pp. 207–216. ACM (2020)

    Google Scholar 

  2. Dodaro, C., Ricca, F.: The external interface for extending wasp. Theor. Pract. Log. Program. 20(2), 225–248 (2020)

    Article  MathSciNet  Google Scholar 

  3. Eiter, T., et al.: The DLVHEX system. KI - Künstliche Intelligenz 32(2–3), 187–189 (2018)

    Article  Google Scholar 

  4. Fournier-Viger, P., et al.: The SPMF open-source data mining library version 2. In: Berendt, B. (ed.) ECML PKDD 2016. LNCS (LNAI), vol. 9853, pp. 36–40. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46131-1_8

    Chapter  Google Scholar 

  5. Fournier-Viger, P., Lin, J.W., Nkambou, R., Vo, B., Tseng, V.: High-Utility Pattern Mining. Springer, Heidelberg (2019)

    Google Scholar 

  6. Gan, W., Lin, C., Fournier-Viger, P., Chao, H., Tseng, V., Yu, P.: A survey of utility-oriented pattern mining. IEEE Trans. Knowl. Data Eng. 33(4), 1306–1327 (2021)

    Google Scholar 

  7. Gan, W., Lin, J.C.W., Chao, H.C., Fujita, H., Yu, P.: Correlated utility-based pattern mining. Inf. Sci. 504, 470–486 (2019)

    Article  MathSciNet  Google Scholar 

  8. Gan, W., Lin, J.C., Fournier-Viger, P., Chao, H., Yu, P.S.: HUOPM: high-utility occupancy pattern mining. IEEE Trans. Cybern. 50(3), 1195–1208 (2020)

    Article  Google Scholar 

  9. Gebser, M., Guyet, T., Quiniou, R., Romero, J., Schaub, T.: Knowledge-based sequence mining with ASP. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9–15 July 2016, pp. 1497–1504. IJCAI/AAAI Press (2016)

    Google Scholar 

  10. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theor. Pract. Log. Program. 19(1), 27–82 (2019)

    Article  MathSciNet  Google Scholar 

  11. Guyet, T., Moinard, Y., Quiniou, R., Schaub, T.: Efficiency analysis of ASP encodings for sequential pattern mining tasks. In: Pinaud, B., Guillet, F., Cremilleux, B., de Runz, C. (eds.) Advances in Knowledge Discovery and Management. SCI, vol. 732, pp. 41–81. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-65406-5_3

    Chapter  Google Scholar 

  12. Hong, T.P., Lee, C.H., Wang, S.L.: Effective utility mining with the measure of average utility. Expert Syst. Appl. 38(7), 8259–8265 (2011)

    Article  Google Scholar 

  13. Järvisalo, M.: Itemset mining as a challenge application for answer set enumeration. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 304–310. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20895-9_35

    Chapter  Google Scholar 

  14. Lin, J.C., Gan, W., Fournier-Viger, P., Hong, T., Chao, H.: FDHUP: fast algorithm for mining discriminative high utility patterns. Knowl. Inf. Syst. 51(3), 873–909 (2017)

    Article  Google Scholar 

  15. Lin, J.C.W., Gan, W., Fournier-Viger, P., Hong, T.P., Tseng, V.S.: Efficient algorithms for mining high-utility itemsets in uncertain databases. Knowl. Based Syst. 96, 171–187 (2016)

    Article  Google Scholar 

  16. Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, Maui, HI, USA, 29 October–02 November 2012, pp. 55–64. ACM (2012)

    Google Scholar 

  17. Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 689–695. Springer, Heidelberg (2005). https://doi.org/10.1007/11430919_79

    Chapter  Google Scholar 

  18. Paramonov, S., Stepanova, D., Miettinen, P.: Hybrid asp-based approach to pattern mining. Theor. Pract. Log. Program. 19(4), 505–535 (2019)

    Article  MathSciNet  Google Scholar 

  19. Tseng, V.S., Shie, B., Wu, C., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772–1786 (2013)

    Article  Google Scholar 

  20. Zida, S., Fournier-Viger, P., Lin, J.C.-W., Wu, C.-W., Tseng, V.S.: EFIM: a highly efficient algorithm for high-utility itemset mining. In: Sidorov, G., Galicia-Haro, S.N. (eds.) MICAI 2015. LNCS (LNAI), vol. 9413, pp. 530–546. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-27060-9_44

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Francesco Cauteruccio .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cauteruccio, F., Terracina, G. (2021). An Answer Set Programming Based Framework for High-Utility Pattern Mining Extended with Facets and Advanced Utility Functions. In: Moschoyiannis, S., Peñaloza, R., Vanthienen, J., Soylu, A., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2021. Lecture Notes in Computer Science(), vol 12851. Springer, Cham. https://doi.org/10.1007/978-3-030-91167-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-91167-6_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-91166-9

  • Online ISBN: 978-3-030-91167-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics