Abstract
Though frequent itemsets and association rules express interesting association among items of frequently occurring itemsets in a database, there may exist other types of interesting associations among the items. A critical analysis of frequent itemsets would provide more insight about a database. In this paper, we introduce the notion of conditional pattern in a database. Conditional patterns are interesting and useful for solving many problems. We propose an algorithm for mining conditional patterns in a database. Experiments are conducted on three real datasets. The results of the experiments show that conditional patterns store significant nuggets of knowledge about a database.
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
References
Adhikari A, Rao PR (2007) A framework for synthesizing arbitrary Boolean expressions induced by frequent itemsets. In: Proceedings of 3rd Indian international conference on artificial intelligence, pp 5–23
Adhikari A, Rao PR (2008) Mining conditional patterns in a database. Pattern Recogn Lett 29(10):1515–1523
Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of 20th very large databases (VLDB) conference, pp 487–499
Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD conference management of data, pp 207–216
Antonie M-L, Zaïane OR (2004) Mining positive and negative association rules: an approach for confined rules. In: Proceedings of PKDD, pp 27–38
Feller W (1968) An introduction to probability theory and its applications, vol 1, 3rd edn. Wiley, New York
FIMI (2004) http://fimi.cs.helsinki.fi/src/
Frequent itemset mining dataset repository (2004) http://fimi.cs.helsinki.fi/data
Han J, Pei J, Yiwen Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD conference management of data, pp 1–12
Hilderman RJ, Hamilton HJ (1999) Knowledge discovery and interestingness measures: a survey. In: Technical report CS-99-04, Department of Computer Science, University of Regina
Hong SJ, Weiss SM (2001) Advances in predictive models for data mining. Pattern Recogn Lett 22(1):55–61
Savasere A, Omiecinski E, Navathe S (1995) An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21st international conference on very large data bases, pp 432–443
Tan P-N, Kumar V, Srivastava J (2002) Selecting the right interestingness measure for association patterns. In: Proceedings of SIGKDD conference, pp 32–41
Viswanath P, Murty MN, Bhatnagar S (2006) Partition based pattern synthesis technique with efficient algorithms for nearest neighbor classification. Pattern Recogn Lett 27(14):1714–1724
Wu X, Wu Y, Wang Y. Li Y (2005) Privacy-aware market basket data set generation: a feasible approach for inverse frequent set mining. In: Proceedings of SIAM international conference on data mining, pp 103–114
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Adhikari, A., Adhikari, J. (2015). Synthesizing Conditional Patterns in a Database. In: Advances in Knowledge Discovery in Databases. Intelligent Systems Reference Library, vol 79. Springer, Cham. https://doi.org/10.1007/978-3-319-13212-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-13212-9_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13211-2
Online ISBN: 978-3-319-13212-9
eBook Packages: EngineeringEngineering (R0)