Skip to main content

GENCCS: A Correlated Group Difference Approach to Contrast Set Mining

  • Conference paper
Machine Learning and Data Mining in Pattern Recognition (MLDM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6871))

Abstract

Contrast set mining has developed as a data mining task which aims at discerning differences amongst groups. These groups can be patients, organizations, molecules, and even time-lines, and are defined by a selected property that distinguishes one from the other. A contrast set is a conjunction of attribute-value pairs that differ significantly in their distribution across groups. The search for contrast sets can be prohibitively expensive on relatively large datasets because every combination of attribute-values must be examined, causing a potential exponential growth of the search space. In this paper, we introduce the notion of a correlated group difference (CGD) and propose a contrast set mining technique that utilizes mutual information and all confidence to select the attribute-value pairs that are most highly correlated, in order to mine CGDs. Our experiments on real datasets demonstrate the efficiency of our approach and the interestingness of the CGDs discovered.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bay, S.D., Pazzani, M.J.: Detecting change in categorical data: mining contrast sets. In: KDD 1999: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 302–306. ACM, New York (1999)

    Google Scholar 

  2. Bay, S.D., Pazzani, M.J.: Detecting group differences: Mining contrast sets. Data Min. Knowl. Discov. 5, 213–246 (2001)

    Article  MATH  Google Scholar 

  3. Hilderman, R., Peckham, T.: A statistically sound alternative approach to mining contrast sets. In: Proceedings of the 4th Australasian Data Mining Conference (AusDM 2005), pp. 157–172 (2005)

    Google Scholar 

  4. Simeon, M., Hilderman, R.J.: Exploratory quantitative contrast set mining: A discretization approach. In: ICTAI 2007: Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence, vol. 2, pp. 124–131. IEEE Computer Society, Washington, DC, USA (2007)

    Chapter  Google Scholar 

  5. Bayardo, R.J.: Efficiently mining long patterns from databases. In: SIGMOD 1998: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 85–93. ACM, New York (1998)

    Chapter  Google Scholar 

  6. Wong, T.T., Tseng, K.L.: Mining negative contrast sets from data with discrete attributes. Expert Syst. Appl. 29(2), 401–407 (2005)

    Article  Google Scholar 

  7. Holm, S.: A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics 6, 65–70 (1979)

    MathSciNet  MATH  Google Scholar 

  8. Lin, J., Keogh, E.J.: Group SAX: Extending the notion of contrast sets to time series and multimedia data. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 284–296. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Ke, Y., Cheng, J., Ng, W.: Correlated pattern mining in quantitative databases. ACM Trans. Database Syst. 33, 14:1–14:45 (2008)

    Article  Google Scholar 

  10. Xiong, H., Shekhar, S., Tan, P.M., Kumar, V.: Taper: a two-step approach for all-strong-pairs correlation query in large databases. IEEE Transactions on Knowledge and Data Engineering 18(4), 493–508 (2006)

    Article  Google Scholar 

  11. Cover, T.M., Thomas, J.A.: Elements of information theory. Wiley-Interscience, New York (2006)

    MATH  Google Scholar 

  12. Han, J.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers Inc., San Francisco (2005)

    Google Scholar 

  13. Dunkel, B., Soparkar, N.: Data organization and access for efficient data mining. In: ICDE, pp. 522–529 (1999)

    Google Scholar 

  14. Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 326–335. ACM, New York (2003)

    Google Scholar 

  15. Gouda, K., Zaki, M.J.: Genmax: An efficient algorithm for mining maximal frequent itemsets. Data Min. Knowl. Discov. 11(3), 223–242 (2005)

    Article  MathSciNet  Google Scholar 

  16. Kralj, P., Lavrac, N., Gamberger, D., Krstacic, A.: Contrast set mining for distinguishing between similar diseases. In: Bellazzi, R., Abu-Hanna, A., Hunter, J. (eds.) AIME 2007. LNCS (LNAI), vol. 4594, pp. 109–118. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Asuncion, A., Newman, D.: UCI machine learning repository (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simeon, M., Hilderman, R. (2011). GENCCS: A Correlated Group Difference Approach to Contrast Set Mining. In: Perner, P. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 2011. Lecture Notes in Computer Science(), vol 6871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23199-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23199-5_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23198-8

  • Online ISBN: 978-3-642-23199-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics