Abstract
Correlated patterns are an important class of regularities that exist in a database. The all-confidence measure has been widely used to discover the patterns in real-world applications. This paper theoretically analyzes the all-confidence measure, and shows that, although the measure satisfies the null-invariant property, mining correlated patterns involving both frequent and rare items with a single minimum all-confidence (minAllConf) threshold value causes the “rare item problem” if the items’ frequencies in a database vary widely. The problem involves either finding very short length correlated patterns involving rare items at a high minAllConf threshold, or generating a huge number of patterns at a low minAllConf threshold. The cause for the problem is that the single minAllConf threshold was not sufficient to capture the items’ frequencies in a database effectively. The paper also introduces an alternative model of correlated patterns using the concept of multiple minAllConf thresholds. The proposed model facilitates the user to specify a different minAllConf threshold for each pattern to reflect the varied frequencies of items within it. Experiment results show that the proposed model is very effective.
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., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD, pp. 207–216 (1993)
Weiss, G.M.: Mining with rarity: a unifying framework. ACM SIGKDD Explorations Newsletter 6(1), 7–19 (2004)
Omiecinski, E.R.: Alternative interest measures for mining associations in databases. IEEE Trans. on Knowl. and Data Eng. 15, 57–69 (2003)
Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: generalizing association rules to correlations. SIGMOD Rec. 26, 265–276 (1997)
Tan, P.N., Kumar, V., Srivasta, J.: Selecting the right interestingness measure for association patterns. In: KDD, pp. 32–41 (2002)
Wu, T., Chen, Y., Han, J.: Re-examination of interestingness measures in pattern mining: a unified framework. Data Mining Knolwedge Discovery 21, 371–397 (2010)
Surana, A., Kiran, R.U., Reddy, P.K.: Selecting a Right Interestingness Measure for Rare Association Rules. In: COMAD, pp. 115–124 (2010)
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)
Kim, S., Barsky, M., Han, J.: Efficient mining of top correlated patterns based on null-invariant measures. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011, Part II. LNCS, vol. 6912, pp. 177–192. Springer, Heidelberg (2011)
Lee, Y.K., Kim, W.Y., Cao, D., Han, J.: CoMine: efficient mining of correlated patterns. In: ICDM, pp. 581–584 (2003)
Uday Kiran, R., Kitsuregawa, M.: Efficient Discovery of Correlated Patterns in Transactional Databases Using Items’ Support Intervals. In: Liddle, S.W., Schewe, K.-D., Tjoa, A.M., Zhou, X. (eds.) DEXA 2012, Part I. LNCS, vol. 7446, pp. 234–248. Springer, Heidelberg (2012)
Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: KDD, pp. 337–341 (1999)
Pei, J., Han, J., Lakshmanan, L.V.: Pushing convertible constraints in frequent itemset mining. Data Mining and Knowledge Discovery 8, 227–251 (2004)
Brijs, T., Goethals, B., Swinnen, G., Vanhoof, K., Wets, G.: A data mining framework for optimal product selection in retail supermarket data: the generalized PROFSET model. In: KDD, pp. 300–304 (2000)
Zheng, Z., Kohavi, R., Mason, L.: Real world performance of association rule algorithms. In: KDD, pp. 401–406 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiran, R.U., Kitsuregawa, M. (2013). Mining Correlated Patterns with Multiple Minimum All-Confidence Thresholds. In: Li, J., et al. Trends and Applications in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science(), vol 7867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40319-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-40319-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40318-7
Online ISBN: 978-3-642-40319-4
eBook Packages: Computer ScienceComputer Science (R0)