Abstract
Association mining cannot find such type of patterns, “the conditional probability that a customer purchasing A is likely to also purchase B is not only greater than the given threshold, but also much greater than the probability that a customer purchases only B. In other words, the sale of A can increase the likelihood of the sale of B.” Such kind of patterns are both associated and correlated. Therefore, in this paper, we combine association with correlation in the mining process to discover both associated and correlated patterns. A new interesting measure corr-confidence is proposed for rationally evaluating the correlation relationships. This measure not only has proper bounds for effectively evaluating the correlation degree of patterns, but also is suitable for mining long patterns. Our experimental results show that the mining combined association with correlation is quite a valid approach to discovering both associated and correlated patterns.
Chapter PDF
Similar content being viewed by others
References
Liu, B., Hsu, W., Ma, Y.: Pruning and Summarizing the Discovered Association. In: Proc. 1999 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD 1999), pp. 15–18 (1999)
Brin, S., Motwani, R., Silverstein, C.: Beyond Market Basket: Generalizing Association Rules to Correlations. In: Proc. 1997 ACM SIGMOD Int. Conf. Management of Data (SIGMOD 1997), pp. 265–276 (1997)
Liu, H., Lu, H., Feng, L., Hussain, F.: Efficient Search of Reliable Exceptions. In: Zhong, N., Zhou, L. (eds.) PAKDD 1999. LNCS (LNAI), vol. 1574, pp. 194–204. Springer, Heidelberg (1999)
Mills, F.: Statistical Methods, Pitman (1955)
Omiecinski, E.: Alternative interesting measures for mining associations. IEEE Trans. Knowledge and Data Engineering (15), 57–69 (2003)
Tan, P.-N., Kumar, V., Srivastava, J.: Selecting the Right Interestingness Measure for Association Patterns. In: Proc. 2002 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD 2002), pp. 32–41 (2002)
Piatetsky-Shapiro, G.: Discovery, Analysis and Presentation of Strong Rules. In: Knowledge Discovery in Databases, pp. 229–248. AAAI/MIT Press (1991)
Reynolds, H.T.: The Analysis of Cross-Classifications. The Free Press, New York (1977)
Kim, W.-Y., Lee, Y.-K., Han, J.: CCMine: Efficient Mining of Confidence-Closed Correlated Patterns. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 569–579. Springer, Heidelberg (2004)
Lee, Y.-K., Kim, W.-Y., Cai, Y.D., Han, J.: CoMine: Efficient Mining of Correlated Patterns. In: Proc. 2003 Int. Conf. Data Mining (ICDM 2003), pp. 581–584 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, Z., Wu, Z., Wang, C., Feng, Y. (2006). Mining Both Associated and Correlated Patterns. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758549_66
Download citation
DOI: https://doi.org/10.1007/11758549_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34385-1
Online ISBN: 978-3-540-34386-8
eBook Packages: Computer ScienceComputer Science (R0)