Abstract
Modern industries and business firms are widely using data mining applications in which the problem of Frequent Itemset Mining (FIM) has a major role. FIM problem can be solved by standard traditional algorithms like Apriori in certain transactional database and can also be solved by different exact (UApriori, UFP Growth) and approximate (Poisson Distribution based UApriori, Normal Distribution based UApriori) probabilistic frequent itemset mining algorithm in uncertain transactional database (database in which each item has its existential probability). In our algorithm it is considered that database is distributed among different locations of globe in which one location has certain transactional database, we call this location as main site and all other locations have uncertain transactional databases, we call these locations as remote sites. To the best of our knowledge no algorithm is developed yet which can calculate frequent itemsets on the combination of certain and uncertain transactional database. We introduced a novel approach for finding itemsets which are globally frequent among the combination of all uncertain transactional databases on remote site with certain database at main site.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in Proceedings of the 20th VLDB Conference, Santiago, Chile (1994), pp. 487–499
T. Bernecker, R. Cheng, H.P. Kriegel, M. Renz, F. Verhein, A. Züfle, D.W. Cheung, S.D. Lee, Wang Liang, Model-based probabilistic frequent itemset mining. Knowl. Inf. Syst. 37, 181–217 (2013)
L. Wang, R. Cheng, S.D. Lee, D.W.-L. Cheung, Accelerating probabilistic frequent itemset mining: a model-based approach, in CIKM (2010), pp. 429–438
R. Agrawal, J.C. Shafer, Parallel mining of association rules. IEEE Trans. Knowl. Data Eng. 8(6), 962–969 (1996)
E. Han, G. Karypis, V. Kumar, Scalable parallel data mining for association rules, in Proceedings 1997 ACM-SIGMOD International Conferences on Management of Data, Tucson, Arizona (1997)
E. Han, G. Karypis, V. Kumar, Scalable parallel data mining for association rules. IEEE Trans. Knowl. Data Eng. 12(3), 337–352 (2000)
M.V. Joshi, E. Han, G. Karypis, V. Kumar, Efficient parallel algorithms for mining associations, in Large-scale Parallel and Distributed Data Mining, ed. by M. Zaki, C.-T. Ho. Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (LNCS/LNAI), vol. 1759 (Springer, 2000)
D.W. Cheung, J. Han, V.T. Ng, A.W. Fu, Y. Fu, A fast distributed algorithm for mining association rules, in Proceedings of the 4th International Conferences Parallel and Distributed Information System, IEEE Computer Society Press, Los Alamitos, CA (1996), pp. 31–42
D.W. Cheung, Y. Xiao, Effect of data distribution in parallel mining of associations, in Data Mining and Knowledge Discovery, vol. 3 (Kluwer Academic Publishers, 1999), pp. 219–314
C.K. Chui, B. Kao, E. Hung, Mining frequent itemsets from uncertain data, in 11th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2007, Nanjing, China
T. Bernecker, H.-P. Kriegel, M. Renz, F. Verhein, A. Züfle, Probabilistic frequent itemset mining in uncertain databases in Proceedings of the 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD’09), Paris, France
R. Cheng, D. Kalashnikov, S. Prabhakar, Evaluating probabilistic queries over imprecise data, in SIGMOD (2003)
Q. Zhang, F. Li, K. Yi, Finding frequent items in probabilistic data, in SIGMOD (2008)
L. Sun, R. Cheng, D.W. Cheung, J. Cheng, Mining uncertain data with probabilistic guarantees, in SIGKDD (2010)
C.K. Chui, B. Kao, A decremental approach for mining frequent itemsets from uncertain data, in PAKDD (2008), pp. 64–75
Y. Tong, L. Chen, Y. Cheng, P.S. Yu, Mining frequent itemsets over uncertain databases, in VLDB’12
Y. Tong, L. Chen, P.S. Yu, UFIMT: an uncertain frequent itemset mining toolbox, in KDD’12, Beijing, China. 12–16 August 2012
Frequent Itemset Mining Implementations Repository, http://fimi.ua.ac.be/
D.W. Cheung, V.T. Ng, A.W. Fu, Y. Fu, Efficient mining of association rules in distributed databases. IEEE Trans. Knowl. Data Eng. 8(6), 911–922 (1996)
SPMF An Open-Source Data Mining Library, http://www.philippe-fournier-viger.com/spmf/index.php?link=datasets.php
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Wazir, S., Ahmad, T., Sufyan Beg, M.M. (2018). Frequent Itemset Mining for a Combination of Certain and Uncertain Databases. In: Zadeh, L., Yager, R., Shahbazova, S., Reformat, M., Kreinovich, V. (eds) Recent Developments and the New Direction in Soft-Computing Foundations and Applications. Studies in Fuzziness and Soft Computing, vol 361. Springer, Cham. https://doi.org/10.1007/978-3-319-75408-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-75408-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-75407-9
Online ISBN: 978-3-319-75408-6
eBook Packages: EngineeringEngineering (R0)