Abstract
In the past, a SKYMINE approach was proposed to both consider the aspects of utility and frequency of the itemsets to mine the skyline frequency-utility skyline patterns (SFUPs). The SKYMINE algorithm requires, however, the amounts of computation to mine the SFUPs based on the utility-pattern (UP)-tree structure performing in a level-wise manner. In this paper, we propose more effective algorithms to mine the SFUPs based on the utility-list structure. Substantial experiments are carried to show that the proposed algorithms outperform the state-of-the-art SKYMINE to mine the SFUPs in terms of runtime and memory usage.
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
Frequent itemset mining dataset repository (2012). http://fimi.ua.ac.be/data/
Afrati, F.N., Koutris, P., Suciu, D., Ullman, J.D.: Parallel skyline queries. Theory Comput. Syst. 57(4), 1008–1037 (2015)
Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: International Conference on Very Large Data Bases, pp. 487–499 (1994)
Agrawal, R., Srikant, R.: Quest synthetic data generator (1994). http://www.Almaden.ibm.com/cs/quest/syndata.html
Ahmed, C.F., Tanbeer, S.K., Jeong, B.S., Le, Y.K.: Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans. Knowl. Data Eng. 21(12), 1708–1721 (2009)
Borzsonyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: International Conference on Data Engineering, pp. 421–430 (2001)
Chan, R., Yang, Q., Shen, Y.D.: Mining high utility itemsets. In: IEEE International Conference on Data Mining, pp. 19–26 (2003)
Chan, C.Y., Jagadish, H.V., Tan, K.L., Tung, A.K.H., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: ACM SIGMOD International Conference on Management of Data, pp. 503–514 (2006)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: International Conference on Data Engineering, pp. 717–720 (2003)
Goyal, V., Sureka, A., Patel, D.: Efficient skyline itemsets mining. In: The International C* Conference on Computer Science & Software Engineering, pp. 119–124 (2015)
Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: IEEE ICDM Workshop on Frequent Itemset Mining Implementations (2003)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGKDD International Conference on Management of Data, pp. 1–12 (2000)
Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: an online algorithm for skyline queries. In: International Conference on Very Large Data Bases, pp. 275–286 (2002)
Lin, C.W., Hong, T.P., Lu, W.H.: The pre-FUFP algorithm for incremental mining. Expert Syst. Appl. 36(5), 9498–9505 (2009)
Lin, C.W., Hong, T.P., Lu, W.H.: An effective tree structure for mining high utility itemsets. Expert Syst. Appl. 38(6), 7419–7424 (2011)
Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 689–695. Springer, Heidelberg (2005). doi:10.1007/11430919_79
Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: ACM International Conference on Information and Knowledge Management, pp. 55–64 (2012)
Microsoft, Example database foodmart of Microsoft analysis services. http://msdn.microsoft.com/en-us/library/aa217032(SQL.80).aspx
Papadias, D., Tao, Y., Seeger, B.: Progressive skyline computation in database systems. ACM Trans. Database Syst. 30(1), 41–82 (2005)
Park, J.S., Chen, M.S., Yu, P.S.: An effective hash based algorithm for mining association rules. In: ACM SIGMOD International Conference on Management of Data, pp. 175–186 (1995)
Podpecan, V., Lavrac, N., Kononenko, I.: A fast algorithm for mining utility-frequent itemsets. In: International workshop on Constraint-based Mining and Learning, pp. 9–20 (2007)
Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: International Conference on Very Large Databases, pp. 432–444 (1995)
Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient progressive skyline computation. In: International Conference on Very Large Data Bases, pp. 301–310 (2001)
Tseng, V.S., Shie, B.E., Wu, C.W., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772–1786 (2012)
Yao, H., Hamilton, H.J., Geng, L.: A unified framework for utility-based measures for mining itemsets. In: ACM SIGKDD International Conference on Utility-Based Data Mining, pp. 28–37 (2006)
Yeh, J.-S., Li, Y.-C., Chang, C.-C.: Two-phase algorithms for a novel utility-frequent mining model. In: Washio, T., et al. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4819, pp. 433–444. Springer, Heidelberg (2007). doi:10.1007/978-3-540-77018-3_43
Acknowledgment
This research was partially supported by the National Natural Science Foundation of China (NSFC) under grant No. 6150309.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Lin, J.CW. et al. (2017). A More Efficient Algorithm to Mine Skyline Frequent-Utility Patterns. In: Pan, JS., Lin, JW., Wang, CH., Jiang, X. (eds) Genetic and Evolutionary Computing. ICGEC 2016. Advances in Intelligent Systems and Computing, vol 536. Springer, Cham. https://doi.org/10.1007/978-3-319-48490-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-48490-7_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48489-1
Online ISBN: 978-3-319-48490-7
eBook Packages: EngineeringEngineering (R0)