Mining vague association rules

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In many online shopping applications, traditional Association Rule (AR) mining has limitations as it only deals with the items that are sold but ignores the items that are almost sold. For example, those items that are put into the basket but not checked out. We say that those almost sold items carry hesitation information since customers are hesitating to buy them. The hesitation information of items is valuable knowledge for the design of good selling strategies. We apply vague set theory in the context of AR mining as to incorporate the hesitation information into the ARs. We define the concepts of attractiveness and hesitation of an item, which represent the overall information of a customer's intent on an item. Based on these two concepts, we propose the notion of Vague Association Rules (VARs) and devise an efficient algorithm to mine the VARs. Our experiments show that our algorithm is efficient and the VARs capture more specific and richer information than traditional ARs. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Lu, A., Ke, Y., Cheng, J., & Ng, W. (2007). Mining vague association rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4443 LNCS, pp. 891–897). Springer Verlag. https://doi.org/10.1007/978-3-540-71703-4_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free