Skip to main content

GRAANK: Exploiting Rank Correlations for Extracting Gradual Itemsets

  • Conference paper
Book cover Flexible Query Answering Systems (FQAS 2009)

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

Included in the following conference series:

Abstract

Gradual dependencies of the form the more A, the more B offer valuable information that linguistically express relationships between variations of the attributes. Several formalisations and automatic extraction algorithms have been proposed recently. In this paper, we first present an overview of these methods. We then propose an algorithm that combines the principles of several existing approaches and benefits from efficient computational properties to extract frequent gradual itemsets.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Galichet, S., Dubois, D., Prade, H.: Imprecise specification of ill-known functions using gradual rules. Int. Journal of Approximate Reasoning 35, 205–222 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bouchon-Meunier, B., Dubois, D., Godó, L., Prade, H.: Fuzzy sets and possibility theory in approximate and plausible reasoning. In: Bezdek, J., Dubois, D., Prade, H. (eds.) Fuzzy sets in approximate reasoning and information systems, pp. 15–190. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  3. Dubois, D., Prade, H.: Gradual inference rules in approximate reasoning. Information Sciences 61(1-2), 103–122 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hüllermeier, E.: Association rules for expressing gradual dependencies. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 200–211. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Berzal, F., Cubero, J.C., Sanchez, D., Vila, M.A., Serrano, J.M.: An alternative approach to discover gradual dependencies. Int. Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (IJUFKS) 15(5), 559–570 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Di Jorio, L., Laurent, A., Teisseire, M.: Fast extraction of gradual association rules: a heuristic based method. In: Proc. of the IEEE/ACM Int. Conf. on Soft Computing as a Transdisciplinary Science and Technology, CSTST 2008 (2008)

    Google Scholar 

  7. Di Jorio, L., Laurent, A., Teisseire, M.: Mining frequent gradual itemsets from large databases. In: Proc. of the Int. Conf. on Intelligent Data Analysis, IDA 2009 (2009)

    Google Scholar 

  8. Fiot, C., Masseglia, F., Laurent, A., Teisseire, M.: Ted and Eva: Expressing temporal tendencies among quantitative variables using fuzzy sequential patterns. In: Fuzz’IEEE (2008)

    Google Scholar 

  9. Fiot, C., Masseglia, F., Laurent, A., Teisseire, M.: Evolution patterns and gradual trends. Int. Journal of Intelligent Systems (2009)

    Google Scholar 

  10. Molina, C., Serrano, J.M., Sánchez, D., Vila, M.: Measuring variation strength in gradual dependencies. In: Proc. of the European Conf. EUSFLAT 2007, pp. 337–344 (2007)

    Google Scholar 

  11. Kendall, M., Babington Smith, B.: The problem of m rankings. The annals of mathematical statistics 10(3), 275–287 (1939)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laurent, A., Lesot, MJ., Rifqi, M. (2009). GRAANK: Exploiting Rank Correlations for Extracting Gradual Itemsets. In: Andreasen, T., Yager, R.R., Bulskov, H., Christiansen, H., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 2009. Lecture Notes in Computer Science(), vol 5822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04957-6_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04957-6_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04956-9

  • Online ISBN: 978-3-642-04957-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics