Skip to main content

Summarizing Frequent Itemsets via Pignistic Transformation

  • Conference paper
  • 1434 Accesses

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

Abstract

Since the proposal of the well-known Apriori algorithm and the subsequent establishment of the area known as Frequent Itemset Mining, most of the scientific contribution of the data mining area have been focused on the study of methods that improve its efficiency and its applicability in new domains. The interest in the extraction of this sort of patterns lies in its expressiveness and syntactic simplicity. However, due to the large quantity of frequent patterns that are generally obtained, the evaluation process, necessary for obtaining useful knowledge, it is difficult to be achieved in practice. In this paper we present a formal method to summarize the whole set of mined frequent patterns into a single probability distribution in the framework of the Transferable Belief Model (TBM). The probability function is obtained applying the Pignistic Transformation on the patterns, obtaining a compact model that synthesizes the regularities present in the dataset and serves as a basis for the knowledge discovery and decision making processes.

In this work, we also present a real case study by describing an application of our proposal in the field of Neuroscience. In particular, our main goal is focused on the behavioral characterization, via pignistic distribution on attentional cognitive variables, of group of children pre-diagnosed with one of the three types of ADHD (Attention Deficit Hyperactivity Disorder).

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afrati, F., Gionis, A., Mannila, H.: Approximating a collection of frequent sets. In: Proc. of the 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 12–19 (2004)

    Google Scholar 

  2. Bayardo, R.J.: Efficiently mining long patterns from databases. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 1998), pp. 85–93 (1998)

    Google Scholar 

  3. Calders, T., Goethals, B.: Non-derivable itemset mining. Data Mining and Knowledge Discovery 14(1), 171–206 (2007)

    Article  MathSciNet  Google Scholar 

  4. DeGroot, M.H.: Optimal Statistical Decisions. McGraw-Hill, New York (1970)

    MATH  Google Scholar 

  5. Dong, G., Li, J.: Efficient mining of emerging patterns: Discovering trends and differences. In: Proc. of the 5th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 43–52 (1999)

    Google Scholar 

  6. Guil, F., Palacios, F., Campos, M., Marín, R.: On the evaluation of mined frequent sequences. an evidence theory-based method. In: Proc. of the 3rd Int. Conf. on Health Informatics (HEALTHINF 2010), pp. 263–268 (2010)

    Google Scholar 

  7. Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The weka data mining software: An update. SIGKDD Explorations 11(1), 10–18 (2009)

    Article  Google Scholar 

  8. Jin, R., Abu-Ata, M., Xiang, Y., Ruan, N.: Effective and efficient itemset pattern summarization: regression-based approaches. In: Proc. of the 14th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2008), pp. 399–407 (2008)

    Google Scholar 

  9. Lin, D.-I., Kedem, Z.M.: Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol. 1377, pp. 105–119. Springer, Heidelberg (1998)

    Google Scholar 

  10. McBurnett, K., Pfiffner, L., Willcutt, E., Tamm, L., Lerner, M., Ottolini, Y., Furman, M.: Experimental cross-validation of dsm-iv types of adhd. Journal of the American Academy of Child and Adolescent Psychiatry 38, 17–24 (1999)

    Article  Google Scholar 

  11. Mitchell, W.G., Chavez, J.M., Baker, S.A., Guzman, B.L., Azen, S.P.: Reaction time, impulsivity, and attention in hyperactive children and controls: a video game technique. Journal of Child Neurology 5, 195–204 (1990)

    Article  Google Scholar 

  12. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proc. of the 7th Int. Conf. on Database Theory, pp. 398–416 (1999)

    Google Scholar 

  13. Posner, M.I.: Chronometric Explorations of the Mind. Lawrence Erlbaum Associates (1976)

    Google Scholar 

  14. Posner, M.I., Petersen, S.E.: The attention system of the human brain. Annual Review of Neuroscience 13, 25–42 (1990)

    Article  Google Scholar 

  15. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufman Publishers (1993)

    Google Scholar 

  16. Rueda, M.R., Fan, J., McCandlis, B.D., Halparin, J.D., Gruber, D.B., Lercar, L.P., Posner, M.I.: Development of attention networks in chilhood. Neuropsychologia 42, 1029–1040 (2004)

    Article  Google Scholar 

  17. Smets, P., Kennes, R.: The transferable belief model. Artificial Intelligence 66, 191–234 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  18. Smets, P.: Decision making in the tbm: the neccessity of the pignistic trasformation. Int. Journal of Approximate Reasoning 38, 133–147 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Wang, C., Parthasarathy, S.: Summarizing itemset patterns using probabilistic models. In: Proc. of the 12th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2006), pp. 730–735 (2006)

    Google Scholar 

  20. Yan, X., Cheng, H., Han, J., Xin, D.: Summarizing itemset patterns: a profile-based approach. In: Proc. of the 11th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2005), pp. 314–323 (2005)

    Google Scholar 

  21. Zhao, Z., Qian, J., Cheng, J., Lu, N.: Frequent itemsets summarization based on neural network. In: Proc. of the 2nd IEEE Int. Conf. on Computer Science and Information Technology, pp. 496–499 (2009)

    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

Guil-Reyes, F., Daza-Gonzalez, M.T. (2011). Summarizing Frequent Itemsets via Pignistic Transformation. In: Antunes, L., Pinto, H.S. (eds) Progress in Artificial Intelligence. EPIA 2011. Lecture Notes in Computer Science(), vol 7026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24769-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24769-9_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24768-2

  • Online ISBN: 978-3-642-24769-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics