Abstract
In the past, many algorithms have been developed to efficiently mine the high-utility itemsets from a single data source, which is not a realistic scenario since the data may be distributed into varied branches, and the discovered information should be integrated together for making the effective decision. In this paper, we focus on developing an efficient algorithm for synthesizing the mined high-utility itemsets from different sources. A baseline algorithm is first designed and two criteria are then developed to verify whether the designed algorithm is efficient to generate the same number of the high-utility itemsets as the batch-processed algorithm. Experiments are then shown that the designed algorithm has good performance for rule synthesization.
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
Agrawal, R. Srikant, R.: Fast algorithms for mining association rules in large databases. In: The International Conference on Very Large Data Bases, pp. 487–499 (1994)
Agrawal, R., Shafer, J.C.: Parallel mining of association rules. IEEE Trans. Knowl. Data Eng. 8(6), 962–969 (1996)
Adhikari, A.: Synthesizing global exceptional patterns in different data sources. J. Intell. Syst. 21(3), 293–323 (2012)
Fournier-Viger, P., Lin, J.C.W., Gomariz, A., Gueniche, T., Soltani, A., Deng, Z., Lam, H.T.: The SPMF open-source data mining library version 2. In: The Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 36–40 (2016)
Fournier-Viger, P., Lin, J.C.W., Duong, Q.H., Dam, T.L.: FHM +: faster high-utility itemset mining using length upper-bound reduction. The International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, pp. 115–127 (2016)
Gan, W., Lin, J.C.W., Chao, H.C., Zhan, J.: Data mining in distributed environment: a survey. Wiley Interdiscip. Rev.: Data Min. Knowl. Discov. 7(6), 1–19 (2017)
Gan, W., Lin, J.C.W., Fournier-Viger, P., Chao, H.C., Tseng, V.S., Yu, P.: A survey of utility-oriented pattern mining, https://arxiv.org/pdf/1805.10511.pdf (2018)
Gan, W., Lin, J.C.W., Fournier-Viger, P., Chao, H.C., Hong, T.P., Fujita, H.: A survey of incremental high-utility itemset mining. Wiley Interdiscip. Rev.: Data Min. Knowl. Discov. 8(2), 1–23 (2018)
Gan, W., Lin, J.C.W., Fournier-Viger, P., Chao, H.C., Fujita, H.: Extracting non-redundant correlated purchase behaviors by utility measure. Knowl.-Based Syst. 143, 30–41 (2018)
Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)
Liu, Y., Liao, W.K., Choundhary A.: A fast high utility itemsets mining algorithm. In: The International Workshop on Utility-based Data Mining, pp. 90–99 (2005)
Lin, J.C.W., Gan, W., Hong, T.P., Zhang, B.: An incremental high-utility mining algorithm with transaction insertion. Sci. World J. 161564, 15 pages (2015)
Lin, J.C.W., Ren, S., Fournier-Viger, P.: MEMU: more efficient algorithm to mine high average-utility patterns with multiple minimum average-utility thresholds. IEEE Access 14(8), 7593–7609 (2018)
Otey, M.E., Parthasarathy, S., Wang, C., Veloso, A., Meira, W.: Parallel and disctributed methods for incremental frequent itemset mining. IEEE Trans. Syst. Man Cybern. Part B: Cybern. 36(6), 2439–2450 (2004)
Ozkural, E., Ucar, B., Aykanat, C.: Parallel frequent item set mining with selective item replication. IEEE Trans. Parallel Distrib. Syst. 22(10), 1632–1640 (2011)
Sohrabi, M.K., Barforoush, A.A.: Parallel frequent itemset mining using systolic arrays. Knowl.-Based Syst. 37, 462–471 (2013)
Wu, X., Zhang, S.: Synthesizing high-frequency rules from different data sources. IEEE Trans. Knowl. Data Eng. 15(2), 353–367 (2003)
Yao, H., Hamilton, H.J.: Mining itemset utilities from transaction databases. Data Knowl. Eng. 59(3), 603–626 (2006)
Zhong, N., Yao, Y.Y.Y., Ohshima, M.: Peculiarity oriented multidatabase mining. IEEE Trans. Knowl. Data Eng. 15(4), 952–960 (2003)
Zhang, S., Zhang, C., Wu, X.: Knowledge Discovery in Multiple Databases. Springer, London (2004)
Zhang, B., Lin, J.C.W., Shao, Y., Fournier-Viger, P., Djenouri, Y.: Maintenance of discovered high average-utility itemsets in dynamic databases. Appl. Sci. 8(5), 1–19 (2018)
Acknowledgements
This research was partially supported by the Shenzhen Technical Project under JCYJ20170307151733005 and KQJSCX20170726103424709 and by the National Natural Science Foundation of China (NSFC) under grant No. 61503092.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Lin, J.Cw., Li, Y., Fournier-Viger, P., Tang, L. (2019). Mining High Utility Itemsets from Multiple Databases. In: Zhao, Y., Wu, TY., Chang, TH., Pan, JS., Jain, L. (eds) Advances in Smart Vehicular Technology, Transportation, Communication and Applications. VTCA 2018. Smart Innovation, Systems and Technologies, vol 128. Springer, Cham. https://doi.org/10.1007/978-3-030-04585-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-04585-2_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04584-5
Online ISBN: 978-3-030-04585-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)