IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4419-1630-3_12.html
   My bibliography  Save this book chapter

Mining of Association Rules

In: Data Mining and Knowledge Discovery via Logic-Based Methods

Author

Listed:
  • Evangelos Triantaphyllou

    (Louisiana State University)

Abstract

Mining of sub association rules association rules from databases has attracted great interest because of its potentially very useful applications. sub association rules Association rules are derived from a type of analysis that extracts information from coincidence [ aut Blaxton, T. Blaxton and aut Westphal, C. Westphal, 1998]. Sometimes called sub market basket analysis market basket analysis, this methodology allows a data analyst to discover correlations, or co-occurrences of transactional events. In the classic example, consider the items contained in a customer’s shopping cart on any one trip to a grocery store. Chances are that the customer’s own shopping patterns tend to be internally consistent, and that he/she tends to buy certain items on certain days. There might be many examples of pairs of items that are likely to be purchased together. This is the kind of information the store manager could use to make decisions about where to place items in the store so as to increase sales. This information can be expressed in the form of sub association rules association rules. Such information may have tremendous potential on the marketing of new or existing products. This is the kind of approach used by many enterprises (such as Amazon.com for instance) to recommend new or existing products to their customers. Mining of sub association rules association rules is applicable to many more domains [ aut Bayardo Jr., R.J. Bayardo, et al., 1999]. This chapter is based on the results discussed in [ aut Yilmaz, E. Yilmaz, et al., 2003].

Suggested Citation

  • Evangelos Triantaphyllou, 2010. "Mining of Association Rules," Springer Optimization and Its Applications, in: Data Mining and Knowledge Discovery via Logic-Based Methods, chapter 0, pages 241-255, Springer.
  • Handle: RePEc:spr:spochp:978-1-4419-1630-3_12
    DOI: 10.1007/978-1-4419-1630-3_12
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-1-4419-1630-3_12. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.