Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/1783823.1783921guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Mining vague association rules

Published: 09 April 2007 Publication History

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.

References

[1]
Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In Buneman, P., Jajodia, S., eds.: SIGMOD Conference, ACM Press (1993) 207-216.
[2]
Gau, W.L., Danied, J.B.: Vague sets. IEEE Transactions on Systems, Man, and Cybernetics 23 (1993) 610-614.
[3]
Zadeh, L.A.: Fuzzy sets. Information and Control 8 (1965) 338-353.
[4]
Lu, A., Ng, W.: Managing merged data by vague functional dependencies. In Atzeni, P., Chu, W.W., Lu, H., Zhou, S., Ling, T.W., eds.: ER. Volume 3288 of Lecture Notes in Computer Science., Springer (2004) 259-272.
[5]
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, O., eds.: ER. Volume 3716 of Lecture Notes in Computer Science., Springer (2005) 401-416.
[6]
NLANR: (http://www.ircache.net/)
[7]
IBM Quest Data Mining Project. The Quest retail transaction data generator. http://www. almaden.ibm.com/software/quest/ (1996).

Cited By

View all
  • (2013)Model-based probabilistic frequent itemset miningKnowledge and Information Systems10.1007/s10115-012-0561-237:1(181-217)Online publication date: 1-Oct-2013
  • (2010)Accelerating probabilistic frequent itemset miningProceedings of the 19th ACM international conference on Information and knowledge management10.1145/1871437.1871494(429-438)Online publication date: 26-Oct-2010
  • (2010)Mining uncertain data with probabilistic guaranteesProceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining10.1145/1835804.1835841(273-282)Online publication date: 25-Jul-2010
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
DASFAA'07: Proceedings of the 12th international conference on Database systems for advanced applications
April 2007
1126 pages
ISBN:9783540717027
  • Editors:
  • Ramamohanarao Kotagiri,
  • P. Radha Krishna,
  • Mukesh Mohania,
  • Ekawit Nantajeewarawat

Sponsors

  • NECTEC: National Electronics and Computer Technology Center
  • DBSJ: Database Society of Japan
  • Korea Info Sci Society: Korea Information Science Society
  • SiPA: Software Industry Promotion Agency
  • IBM: IBM

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 09 April 2007

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2013)Model-based probabilistic frequent itemset miningKnowledge and Information Systems10.1007/s10115-012-0561-237:1(181-217)Online publication date: 1-Oct-2013
  • (2010)Accelerating probabilistic frequent itemset miningProceedings of the 19th ACM international conference on Information and knowledge management10.1145/1871437.1871494(429-438)Online publication date: 26-Oct-2010
  • (2010)Mining uncertain data with probabilistic guaranteesProceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining10.1145/1835804.1835841(273-282)Online publication date: 25-Jul-2010
  • (2007)Mining hesitation information by vague association rulesProceedings of the 26th international conference on Conceptual modeling10.5555/1784489.1784496(39-55)Online publication date: 5-Nov-2007

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media