Mining Generalised Emerging Patterns

  • Xiaoyuan Qian
  • James Bailey
  • Christopher Leckie
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4304)


Emerging Patterns (EPs) are a data mining model that is useful as a means of discovering distinctions inherently present amongst a collection of datasets. However, current EP mining algorithms do not handle attributes whose values are asscociated with taxonomies (is-a hierarchies). Current EP mining techniques are restricted to using only the leaf-level attribute-values in a taxonomy. In this paper, we formally introduce the problem of mining generalised emerging patterns. Given a large data set, where some attributes are hierarchical, we find emerging patterns that consist of items at any level of the taxonomies. Generalised EPs are more concise and interpretable when used to describe some distinctive characteristics of a class of data. They are also considered to be more expressive because they include items at higher levels of the hierarchies, which have larger supports than items at the leaf level. We formulate the problem of mining generalised EPs, and present an algorithm for this task. We demonstrate that the discovered generalised patterns, which contain items at higher levels in the hierarchies, have greater support than traditional leaf-level EPs according to our experimental results based on ten benchmark datasets.


Association Rule Mining Association Rule Positive Instance Negative Instance Average Support 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blake, C.L., Murphy, P.M.: UCI Machine Learning RepositoryGoogle Scholar
  2. 2.
    Fan, H., Ramamohanarao, K.: Efficient mining of emerging patterns: Discovering trends and differences. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, Springer, Heidelberg (2002)Google Scholar
  3. 3.
    Li, J., Dong, G., Zhang, X.: Discovering jumping emerging patterns and experiments on real datasets. In: IDC 1999 (1999)Google Scholar
  4. 4.
    Dong, G., Li, J.: Efficient mining of emerging patterns: Discovering trends and differences. In: KDD 1999, pp. 43–52 (1999)Google Scholar
  5. 5.
    Wirth, R., Hipp, J., Myka, A., Guntzer, U.: A new algorithm for faster mining of generalised association rules. In: Żytkow, J.M. (ed.) PKDD 1998. LNCS, vol. 1510, pp. 74–82. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  6. 6.
    Manoukian, T., Bailey, J., Ramamohanarao, K.: Fast algorithms for mining emerging patterns. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, Springer, Heidelberg (2002)Google Scholar
  7. 7.
    Li, J.: Mining emerging patterns to construct accurate and efficient classifiers. PhD Thesis, The University of Melbourne (2001)Google Scholar
  8. 8.
    Li, Y., Sweeney, L.: Learning robust rules from data. Carnegie Mellon University, Computer Science Tech Report CMU ISRI 04-107, CMU-CALD-04-100 (February 2004)Google Scholar
  9. 9.
    Imielinski, T., Agrawal, R., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD 1993, pp. 207–216 (1993)Google Scholar
  10. 10.
    Agrawal, R., Srikant, R.: Mining generalised association rules. In: VLDB 1995 (1995)Google Scholar
  11. 11.
    Webb, G.: Efficient search for association rules. In: KDD 2000, pp. 99–107 (2000)Google Scholar
  12. 12.
    Zhang, S., Wu, X., Zhang, C.: Efficient mining of both positive and negative association rules. ACM Trans. Inf. Syst. 22(3), 381–405 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xiaoyuan Qian
    • 1
  • James Bailey
    • 1
  • Christopher Leckie
    • 1
  1. 1.Department of Computer Science and Software EngineeringUniversity of MelbourneAustralia

Personalised recommendations