Skip to main content
SpringerLink
Log in

Quantitative Redundancy in Partial Implications

  • Conference paper
  • First Online:
Formal Concept Analysis (ICFCA 2015)

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

Included in the following conference series:

Abstract

We survey the different properties of an intuitive notion of redundancy, as a function of the precise semantics given to the notion of partial implication.

J.L. Balcázar—Partially supported by project BASMATI (TIN2011-27479-C04-04) of Programa Nacional de Investigación (Ministerio de Ciencia e Innovación, Spain) and grant 2014SGR 890 (MACDA) from AGAUR, Generalitat de Catalunya.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Aggarwal, C.C., Han, J. (eds.): Frequent Pattern Mining. Springer, Switzerland (2014)

    MATH  Google Scholar 

  2. Aggarwal, C.C., Yu, P.S.: A new approach to online generation of association rules. IEEE Trans. Knowl. Data Eng. 13(4), 527–540 (2001)

    Article  Google Scholar 

  3. Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) SIGMOD Conference, pp. 207–216. ACM Press (1993)

    Google Scholar 

  4. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Piatetsky-Shapiro, G., Frawley, W. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI/MIT Press, Menlo Park (1996)

    Google Scholar 

  5. Atserias, A., Balcázar, J.L.: Entailment among probabilistic implications. Accepted for presentation at LICS (2015)

    Google Scholar 

  6. Balcázar, J.L.: Two measures of objective novelty in association rule mining. In: Theeramunkong, T., Nattee, C., Adeodato, P.J.L., Chawla, N., Christen, P., Lenca, P., Poon, J., Williams, G. (eds.) New Frontiers in Applied Data Mining. LNCS, vol. 5669, pp. 76–98. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Balcázar, J.L.: Redundancy, deduction schemes, and minimum-size bases for association rules. Logical Methods Comput. Sci. 6(2), 1–33 (2010)

    Article  Google Scholar 

  8. Balcázar, J.L.: Formal and computational properties of the confidence boost of association rules. TKDD 7(4), 19 (2013)

    Article  Google Scholar 

  9. Balcázar, J.L., Dogbey, F.: Evaluation of association rule quality measures through feature extraction. In: Tucker, A., Höppner, F., Siebes, A., Swift, S. (eds.) IDA 2013. LNCS, vol. 8207, pp. 68–79. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  10. Balcázar, J.L., Tîrnăucă, C., Zorrilla, M.: Mining educational data for patterns with negations and high confidence boost. Taller de Minería de Datos TAMIDA (2010). http://personales.unican.es/tirnaucac

  11. Balcázar, J. L., Tîrnăucă, C., Zorrilla, M.E.: Filtering association rules with negations on the basis of their confidence boost. KDIR (2010). http://personales.unican.es/tirnaucac

  12. Bayardo, R., Agrawal, R., Gunopulos, D.: Constraint-based rule mining in large, dense databases. In: ICDE, pp. 188–197 (1999)

    Google Scholar 

  13. Borgelt, C.: Efficient implementations of Apriori and Eclat. In: Goethals, B., Zaki, M.J.(eds.) FIMI, CEUR Workshop Proceedings, vol. 90 (2003). CEUR-WS.org

  14. Gallo, A., De Bie, T., Cristianini, N.: MINI: mining informative non-redundant itemsets. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 438–445. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  16. Geng, L., Hamilton, H.J.: Interestingness measures for data mining: a survey. ACM Comput. Surv. 38(3), 1–32 (2006)

    Article  Google Scholar 

  17. Guigues, J., Duquenne, V.: Familles minimales d’implications informatives resultants d’un tableau de données binaires. Math. Sci. Hum. 95, 5–18 (1986)

    MathSciNet  Google Scholar 

  18. Hájek, P., Holeňa, M., Rauch, J.: The GUHA method and its meaning for data mining. J. Comput. Syst. Sci. 76(1), 34–48 (2010)

    Article  MATH  Google Scholar 

  19. Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation:a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)

    Article  MathSciNet  Google Scholar 

  20. Jaroszewicz, S., Scheffer, T., Simovici, D.A.: Scalable pattern mining with bayesian networks as background knowledge. Data Min. Knowl. Discov. 18(1), 56–100 (2009)

    Article  MathSciNet  Google Scholar 

  21. Kryszkiewicz, M.: Representative association rules. In: Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol. 1394, pp. 198–209. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  22. Kryszkiewicz, M.: Representative association rules and minimum condition maximum consequence association rules. In: Żytkow, J.M., Quafafou, M. (eds.) PKDD 1998. LNCS, vol. 1510, pp. 361–369. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  23. Kryszkiewicz, M.: Closed set based discovery of representative association rules. In: Hoffmann, F., Adams, N., Fisher, D., Guimarães, G., Hand, D.J. (eds.) IDA 2001. LNCS, vol. 2189, pp. 350–359. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  24. Lavrač, N., Flach, P.A., Zupan, B.: Rule evaluation measures: a unifying view. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 174–185. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  25. Lenca, P., Meyer, P., Vaillant, B., Lallich, S.: On selecting interestingness measures for association rules: user oriented description and multiple criteria decision aid. Eur. J. Oper. Res. 184(2), 610–626 (2008)

    Article  MATH  Google Scholar 

  26. Liu, B., Hsu, W., Ma, Y.: Pruning and summarizing the discovered associations. In: Proceeding of the Knowledge Discovery in Databases, pp. 125–134 (1999)

    Google Scholar 

  27. Luxenburger, M.: Implications partielles dans un contexte. Mathématiques et Sciences Humaines 29, 35–55 (1991)

    MathSciNet  Google Scholar 

  28. Megiddo, N., Srikant, R.: Discovering predictive association rules. In: Proceeding of the Knowledge Discovery in Databases, pp. 274–278 (1998)

    Google Scholar 

  29. Mutter, S., Hall, M., Frank, E.: Using classification to evaluate the output of confidence-based association rule mining. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 538–549. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  30. Padmanabhan, B., Tuzhilin, A.: Small is beautiful: discovering the minimal set of unexpected patterns. In: Proceeding of the Knowledge Discovery in Databases, pp. 54–63 (2000)

    Google Scholar 

  31. Phan-Luong, V.: The representative basis for association rules. In: Cercone, V., Lin, T.Y., Wu, X. (eds.) Proceeding of the 2001 IEEE International Conference on Data Mining (ICDM), pp. 639–640. IEEE Computer Society (2001)

    Google Scholar 

  32. Piatetsky-Shapiro, G.: Discovery, analysis, and presentation of strong rules. In: Proceeding of the Knowledge Discovery in Databases, pp. 229–248 (1991)

    Google Scholar 

  33. Shah, D., Lakshmanan, L., Ramamritham, K., Sudarshan, S.: Interestingness and pruning of mined patterns. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (1999)

    Google Scholar 

  34. Silverstein, C., Brin, S., Motwani, R.: Beyond market baskets: generalizing association rules to dependence rules. Data Min. Knowl. Discov. 2(1), 39–68 (1998)

    Article  Google Scholar 

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

    Article  Google Scholar 

  36. Toivonen, H., Klemettinen, M., Ronkainen, P., Hätönen, K., Mannila, H.: Pruning and grouping discovered association rules. In: ECML1995 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases, pp. 47–52 (1995)

    Google Scholar 

  37. Vreeken, J., van Leeuwen, M., Siebes, A.: Krimp: mining itemsets that compress. Data Min. Knowl. Discov. 23(1), 169–214 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  38. Webb, G.I.: Efficient search for association rules. In: Ramakrishnan, R., Stolfo, S.J., Bayardo, R.J., Parsa, I. (eds.) Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, USA, 20–23 August 2000, pp. 99–107. ACM (2000)

    Google Scholar 

  39. Webb, G.I.: Discovering significant patterns. Mach. Learn. 68(1), 1–33 (2007)

    Article  Google Scholar 

  40. Webb, G.I.: Self-sufficient itemsets: an approach to screening potentially interesting associations between items. TKDD 4(1), 1–20 (2010)

    Article  Google Scholar 

  41. Yin, X., Han, J.: CPAR: classification based on predictive association rules. In: Barbará, D., Kamath, C. (eds.) Proceedings of the Third SIAM International Conference on Data Mining, San Francisco, CA, USA, 1–3 May 2003, pp. 331–335. SIAM (2003)

    Google Scholar 

  42. Zaki, M.J.: Mining non-redundant association rules. Data Min. Knowl. Discov. 9(3), 223–248 (2004)

    Article  MathSciNet  Google Scholar 

  43. Zaki, M.J., Wagner Meira, J.: Data Mining and Analysis: Fundamental Concepts and Algorithms. Cambridge University Press, New York (2014)

    Google Scholar 

  44. Zorrilla, M.E., García-Sáiz, D., Balcázar, J.L.: Towards parameter-free data mining: mining educational data with yacaree. In: Pechenizkiy, M., Calders, T., Conati, C., Ventura, S., Romero, C., Stamper, J.C. (eds.) EDM, pp. 363–364 (2011). www.educationaldatamining.org

Download references

Author information

Authors and Affiliations

  1. LARCA Research Group, Department of Computer Science, Universitat Politècnica de Catalunya, Barcelona, Spain

    José L. Balcázar

Authors
  1. José L. Balcázar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to José L. Balcázar .

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Barcelona, Spain

    Jaume Baixeries

  2. Babeş-Bolyai University, Cluj-Napoca, Romania

    Christian Sacarea

  3. Departamento de Matemática Aplicada, Universidad de Málaga, Malaga, Spain

    Manuel Ojeda-Aciego

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Balcázar, J.L. (2015). Quantitative Redundancy in Partial Implications. In: Baixeries, J., Sacarea, C., Ojeda-Aciego, M. (eds) Formal Concept Analysis. ICFCA 2015. Lecture Notes in Computer Science(), vol 9113. Springer, Cham. https://doi.org/10.1007/978-3-319-19545-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19545-2_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19544-5

  • Online ISBN: 978-3-319-19545-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation