Mining Hesitation Information by Vague Association Rules

  • An Lu
  • Wilfred Ng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4801)


In many online shopping applications, such as Amazon and eBay, 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. However, there is no conceptual model that is able to capture different statuses of hesitation information. Herein, we apply and extend vague set theory in the context of AR mining. 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 the two concepts, we propose the notion of Vague Association Rules (VARs). We 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 do the traditional ARs.


Association Rule Frequent Itemset Chain Group Online Shopping Minimum Support Threshold 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: SIGMOD Conference, pp. 207–216 (1993)Google Scholar
  2. 2.
    Gau, W.-L., Buehrer, D.J.: Vague sets. IEEE Transactions on Systems, Man, and Cybernetics 23(2), 610–614 (1993)CrossRefzbMATHGoogle Scholar
  3. 3.
    Lu, A., Ng, W.: Managing merged data by vague functional dependencies. In: Atzeni, P., Chu, W., Lu, H., Zhou, S., Ling, T.-W. (eds.) ER 2004. LNCS, vol. 3288, pp. 259–272. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Lu, A., Ng, W.: Vague sets or intuitionistic fuzzy sets for handling vague data: Which one is better? In: Delcambre, L.M.L., Kop, C., Mayr, H.C., Mylopoulos, J., Pastor, Ó. (eds.) ER 2005. LNCS, vol. 3716, pp. 401–416. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Zadeh, L.A.: Fuzzy sets. Information and Control 8, 338–353 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
  7. 7.
    Brightwell, G., Winkler, P.: Counting linear extensions. Order 8, 225–242 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Pruesse, G., Ruskey, F.: Generating linear extensions fast. SIAM J. Comput. 23, 373–386 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
  10. 10.
    Data Mining Project. The Quest retail transaction data generator (1996),
  11. 11.
    Kuok, C.M., Fu, A.W., Wong, M.H.: Mining fuzzy association rules in databases. SIGMOD Record 27, 41–46 (1998)CrossRefGoogle Scholar
  12. 12.
    Au, W., Chan, K.C.C.: Mining fuzzy association rules in a bank-account database. IEEE Trans. Fuzzy Systems 11, 238–248 (2003)CrossRefGoogle Scholar
  13. 13.
    Chen, G., Wei, Q.: Fuzzy association rules and the extended mining algorithms. Inf. Sci. 147, 201–228 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Levene, M., Loizou, G.: A Guided Tour of Relational Databases and Beyond. Springer, Heidelberg (1999)CrossRefzbMATHGoogle Scholar
  15. 15.
    Lu, A., Ng, W.: Handling inconsistency of vague relations with functional dependencies. In: ER (2007)Google Scholar
  16. 16.
    Lu, A., Ke, Y., Cheng, J., Ng, W.: Mining vague association rules. In: DASFAA, pp. 891–897 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • An Lu
    • 1
  • Wilfred Ng
    • 1
  1. 1.Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong KongChina

Personalised recommendations