Abstract
A large database, such as POS data, could give us many insights about customer behavior. Many techniques and measures have been proposed to extract interesting rules. As the study of Association rule mining has proceeded, the rules about items that are not bought together at the same transaction have been regarded as important. Although this concept, Negative Association rule mining, is quite useful, it is difficult for the user to analyze the interestingness of Negative Association rules because we would get them too many. To settle this issue, Indirect Association rule mining has proposed.
In this paper, we propose a new framework of Indirect Association rule via a mediator and a new measure μ based on measures P A and P D due to Zhang to mine Negative Association rules effectively without the domain knowledge. The μ measure has the advantage over the IS measure that is proposed with the first framework of Indirect Association rule mining, and satisfies all of the well-known properties for a good measure. Finally, we are going to analyze the retail data and present interpretations for derived Indirect Association rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., USA, May 26–28, pp. 207–216 (1993)
Bayardo Jr., R.J., Agrawal, R.: Mining the Most Interesting Rules. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, August 15-18, pp. 145–154 (1999)
Brin, S., Motwani, R., Silvertein, C.: Beyond market baskets: Generalizing association rules to correlations. In: Proceedings of 1997 ACM-SIGMOD International Conference on Management of Data, Tucson, AZ (1997)
Liu, B., Hsu, W., Ma, Y.: Mining Association Rules with Multiple Minimum Supports. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, August 15–18, pp. 337–341 (1999)
Savasere, A., Omiecinski, E., Navathe, S.: Mining for Strong Negative Associations in a Large Database of Customer Transactions. In: Proceedings of the Fourteenth International Conference on Data Engineering, Orlando, Florida, USA, February 23–27, pp. 494–502 (1998)
Tan, P.N., Kumar, V.: Interestingness Measures for Association Patterns: A perspective, Technical Report # TR00-036, Department of Computer Science, University of Minnesota (2000)
Tan, P.-N., Kumar, V., Srivastava, J.: Indirect Association: Mining Higher Order Dependencies in Data. In: Zighed, D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS, vol. 1910, pp. 632–637. Springer, Heidelberg (2000)
Tan, P.N., Kumar, V., Srivastava, J.: Selecting the Right Interestingness Measure for Association Patterns. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23–26, pp. 32–41 (2002)
Tan, P.N.: Discovery of Indirect Association and Its Applications, Dr. Thesis, University of Minnesota (July 2002)
Zhang, T.: Association Rules. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol. 1805, pp. 245–256. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamano, S., Sato, M. (2004). Mining Indirect Association Rules. In: Perner, P. (eds) Advances in Data Mining. ICDM 2004. Lecture Notes in Computer Science(), vol 3275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30185-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30185-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24054-9
Online ISBN: 978-3-540-30185-1
eBook Packages: Computer ScienceComputer Science (R0)