IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v3y2018i3idhcseit1833754.html

Association Rule Mining Approach for Customer Relationship Management

Author

Listed:
  • Tamanna Kachwala
  • L. K. Sharma

Abstract

The customer relationship management is the main goal of every business organization. In this competitive business scenario, every activity starts and ends with the customer. The increasing competition and dynamic environment, every firms needs to identify, anticipate and satisfy consumers to maximize profit. The association rule mining algorithms are using to work out data mining problem in a trendy way. Along with the large variety of existing approaches, it is constantly challenging to select the best possible algorithm for rule based mining task. Generally, empirical methods for evaluating algorithms of association rule mining are based completely on quantitative measures such as correlation between minimum support, a number of rules or frequent item sets and data processing time. In this paper, we are evaluating best rules found by applying the Apriori algorithm of association rule sets. We show that observing rule overlapping, support and confidence in two compared rule sets help evaluate algorithm quality or the measure uniformity of source datasets.

Suggested Citation

  • Tamanna Kachwala & L. K. Sharma, 2018. "Association Rule Mining Approach for Customer Relationship Management," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 3(3), pages 1991-1995, April.
  • Handle: RePEc:jbh:ijsrcs:v3:y2018:i3:id:hcseit1833754
    Note: Article URL: https://ijsrcseit.com/CSEIT1833754
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1833754
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT1833754.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:jbh:ijsrcs:v3:y2018:i3:id:hcseit1833754. 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: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    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.