Abstract
Many large organizations transact from multiple branches. Many of them possess multiple data sources. The number of multi-branch companies as well as the number of branches of a multi-branch company is increasing over time. Thus, it is important and timely to study data mining carried out on multiple data sources. A global exceptional pattern describes interesting individuality and specificity of few branches. Therefore, it is interesting to identify such patterns.
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, Ramachandrarao P, Pedrycz W (2010a) Developing multi-database mining applications. Springer, London
Adhikari A, Rao PR (2008a) Mining conditional patterns in a database. Pattern Recogn Lett 29(10):1515–1523
Adhikari A, Rao PR (2008b) Efficient clustering of databases induced by local patterns. Decis Support Syst 44(4):925–943
Adhikari A, Rao PR (2008c) Synthesizing heavy association rules from different real data sources. Pattern Recogn Lett 29(1):59–71
Adhikari A, Rao PR, Prasad B, Adhikari J (2010b) Mining multiple large data sources. Int Arab J Inf Technol 7(3):241–249
Adhikari J, Rao PR, Pedrycz W (2011) Mining icebergs in time-stamped databases. In: Proceedings of the Indian international conferences on artificial intelligence, pp. 639–658
Adamo J-M (2001) Data mining for association rules and sequential patterns: sequential and parallel algorithms. Springer, Berlin
Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD conference on management of data, pp. 207–216
Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the international conference on very large data bases, pp. 487–499
Chattratichat J, Darlington J, Ghanem M, Guo Y, Hüning H, Köhler M, Sutiwaraphun J, To HW, Yang D (1997) Large scale data mining: Challenges, and responses. In: Proceedings of the third international conference on knowledge discovery and data mining, pp. 143–146
Cheung D, Ng V, Fu A, Fu Y (1996) Efficient mining of association rules in distributed databases. IEEE Trans Knowl Data Eng 8(6):911–922
FIMI (2004) http://fimi.cs.helsinki.fi/src/
Frequent Itemset Mining Dataset Repository. http://fimi.cs.helsinki.fi/data/
Galambos J, Simonelli I (1996) Bonferroni-type inequalities with applications. Springer, Berlin
Greenfield A (2006) Everyware: the dawning age of ubiquitous computing, 1st edition. New Riders Publishing, New Jersey
Han J, Pei J, Yiwen Y (2000) Mining frequent patterns without candidate generation. In: Proceedings ACM SIGMOD conference on management of data, pp. 1–12
Jaroszewicz S, Simovici DA (2002) Support approximations using Bonferroni-type inequalities. In: Proceedings of the sixth european conference on principles of data mining and knowledge discovery, pp. 212–223
Kargupta H, Han J, Yu PS, Motwani R, Kumar V (2008) Next generation of data mining. Springer, Berlin
Pavlov D, Mannila H, Smyth P (2000) Probabilistic models for query approximation with large sparse binary data sets. In: Proceedings of the sixteenth conference on uncertainty in artificial intelligence, pp. 465–472
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
Wang K, Zhou S, He Y (2001) Hierarchical classification of real life documents. In: Proceedings of the 1st (SIAM) international conference on data mining, pp. 1–16
Wilkinson B (2009) Grid computing: techniques and applications. CRC Press, Boca Raton
Wu X, Zhang S (2003) Synthesizing high-frequency rules from different data sources. IEEE Trans Knowl Data Eng 14(2):353–367
Wu X, Zhang C, Zhang S (2004) Efficient mining of both positive and negative association rules. ACM Trans Inf Syst 22(3):381–405
Wu X, Zhang C, Zhang S (2005a) Database classification for multi-database mining. Inf Syst 30(1):71–88
Wu X, Wu Y, Wang Y, Li Y (2005b) 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
Zhang C, Zhang S (2002) Association rule mining: models and algorithms. Springer, Berlin
Zhang S, Wu X, Zhang C (2003) Multi-database mining. IEEE Comput Intel Bulletin 2(1):5–13
Zhang C, Liu M, Nie W, Zhang S (2004a) Identifying global exceptional patterns in multi-database mining. IEEE Comput Intel Bull 3(1):19–24
Zhang S, Zhang C, Wu X (2004b) Knowledge discovery in multiple databases. Springer, Berlin
Zhang S, Zhang C, Yu JX (2004c) An efficient strategy for mining exceptions in multi-databases. Inf Sci 165(1-2):1–20
Zhang S, Wu X (2011) Fundamentals of association rules in data mining and knowledge discovery. Wiley Interdisc Rew: Data Min Knowl Disc 1(2):97–116
Zhao F, Guibas L (2004) Wireless sensor networks: an information processing approach. Morgan Kaufmann, Los Altos
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Adhikari, A., Adhikari, J., Pedrycz, W. (2014). Synthesizing Global Exceptional Patterns in Different Data Sources. In: Data Analysis and Pattern Recognition in Multiple Databases. Intelligent Systems Reference Library, vol 61. Springer, Cham. https://doi.org/10.1007/978-3-319-03410-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-03410-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03409-6
Online ISBN: 978-3-319-03410-2
eBook Packages: EngineeringEngineering (R0)