Skip to main content

Selecting Outstanding Patterns Based on Their Neighbourhood

  • Conference paper
  • First Online:
Advances in Intelligent Data Analysis XX (IDA 2022)

Abstract

The purpose of pattern mining is to help experts understand their data. Following the assumption that an analyst expects neighbouring patterns to show similar behavior, we investigate the interestingness of a pattern given its neighborhood. We define a new way of selecting outstanding patterns, based on an order relation between patterns and a quality score. An outstanding pattern shows only small syntactic variations compared to its neighbors but deviates strongly in quality. Using several supervised quality measures, we show experimentally that only very few patterns turn out to be outstanding. We also illustrate our approach with patterns mined from molecular data.

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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://dtai.cs.kuleuven.be/CP4IM/datasets/.

  2. 2.

    We normalize the growth rate because the unnormalized growth rate can have \(\infty \) as a value, which prevents the calculation of mean and standard deviation.

  3. 3.

    We direct the interested reader to the original publication.

  4. 4.

    https://www.ebi.ac.uk/chembl/.

References

  1. Besson, J., Rigotti, C., Mitasiunaite, I., Boulicaut, J.F.: Parameter tuning for differential mining of string patterns. In: ICDM Workshops, pp. 77–86. IEEE Computer Society (2008)

    Google Scholar 

  2. Bie, T.D.: Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min. Knowl. Discov. 23(3), 407–446 (2011)

    Article  MathSciNet  Google Scholar 

  3. Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min. Knowl. Disc. 7(1), 5–22 (2003)

    Article  MathSciNet  Google Scholar 

  4. Crémilleux, B., Giacometti, A., Soulet, A.: How your supporters and opponents define your interestingness. In: Berlingerio, M., Bonchi, F., Gärtner, T., Hurley, N., Ifrim, G. (eds.) ECML PKDD 2018. LNCS (LNAI), vol. 11051, pp. 373–389. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-10925-7_23

    Chapter  Google Scholar 

  5. Dau, F., Ducrou, J., Eklund, P.: Concept similarity and related categories in searchsleuth. In: Eklund, P., Haemmerlé, O. (eds.) ICCS-ConceptStruct 2008. LNCS (LNAI), vol. 5113, pp. 255–268. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-70596-3_18

    Chapter  Google Scholar 

  6. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, Second Edition. Cambridge University Press, Cambridge (2002)

    Google Scholar 

  7. De Raedt, L., Zimmermann, A.: Constraint-based pattern set mining. In: Proceedings of the Seventh SIAM International Conference on Data Mining. SIAM (2007)

    Google Scholar 

  8. Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: Proceedings of the Fifth ACM SIGKDD, pp. 43–52 (1999)

    Google Scholar 

  9. Kane, B., Cuissart, B., Cremilleux, B.: Minimal jumping emerging patterns: computation and practical assessment. In: PAKDD (2015)

    Google Scholar 

  10. Métivier, J.P., Cuissart, B., Bureau, R., Lepailleur, A.: The pharmacophore network: a computational method for exploring structure-activity relationships from a large chemical data set. J. Med. Chem. 61(8), 3551–3564 (2018)

    Article  Google Scholar 

  11. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Buneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398–416. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-49257-7_25

    Chapter  Google Scholar 

  12. Stumpfe, D., Hu, H., Bajorath, J.: Evolving concept of activity cliffs. ACS Omega 4(11), 14360–14368 (2019)

    Article  Google Scholar 

  13. Tan, P., Kumar, V., Srivastava, J.: Selecting the right objective measure for association analysis. Inf. Syst. 29(4), 293–313 (2004)

    Article  Google Scholar 

  14. Van Leeuwen, M., Ukkonen, A.: Fast estimation of the pattern frequency spectrum. In: ECML PKDD 2014, pp. 114–129 (2014)

    Google Scholar 

  15. Vreeken, J., Tatti, N.: Interesting patterns. In: Aggarwal, C.C., Han, J. (eds.) Frequent Pattern Mining, pp. 105–134. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07821-2_5

    Chapter  Google Scholar 

  16. Webb, G.I.: Self-sufficient itemsets: an approach to screening potentially interesting associations between items. ACM Trans. Knowl. Discov. Data 4(1), 3:1–3:20 (2010)

    Google Scholar 

  17. Yan, X., Han, J.: Closegraph: mining closed frequent graph patterns. In: Proceedings of the Ninth ACM SIGKDD, pp. 286–295 (2003)

    Google Scholar 

Download references

Acknowledgements

This work was partially funded by the ANR project InvolvD (ANR-20-CE23-0023).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Etienne Lehembre .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 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

Lehembre, E. et al. (2022). Selecting Outstanding Patterns Based on Their Neighbourhood. In: Bouadi, T., Fromont, E., Hüllermeier, E. (eds) Advances in Intelligent Data Analysis XX. IDA 2022. Lecture Notes in Computer Science, vol 13205. Springer, Cham. https://doi.org/10.1007/978-3-031-01333-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-01333-1_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-01332-4

  • Online ISBN: 978-3-031-01333-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics