Abstract
A complete set of frequent itemset can be extremely and unexpectedly large due to redundancy when the given minimum support is low or when the transactional database is dense. To solve the problem, various concise representation strategies have been previously proposed, among which, some works undeniably well. Take Max Frequent Itemset, it has reached a high rate condensing frequent itemsets. But those existed models may consume too many resources which makes them not be suitable in some scenarios where restraints on time complex are strict but itemsets’ support is not necessary at all. For this very kind of scenarios, this paper proposes a novel concept of frequent itemset border - Grid Wall, formed by positive border together with negative border, which tells whether an itemset is frequent, recovers all frequent itemsets but ignores their support. Grid-Wall founds on bi-partition and employs divide-and-conquer strategy, which make it fast and goes one step further than MFI on concise representation of frequent itemsets.
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
Moens, S., Aksehirli, E., Goethals, B.: Frequent itemset mining for big data. In: IEEE International Conference on Big Data, pp. 111–118 (2013)
Liu, G., Li, J., Wong, L.: A new concise representation of frequent itemsets using generators and a positive border. Knowl. Inf. Syst. 17(1), 35–56 (2008)
Tseng, V.S., Wu, C., Fournier-Viger, P., Yu, P.S.: Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans. Knowl. Data Eng. 27(3), 726–739 (2015)
Liu, G., Li, J., Wong, L., et al.: Positive borders or negative borders: how to make lossless generator-based representations concise. In: SIAM International Conference on Data Mining – SDM (2006)
Hui-ling, P., Yun-xing, S.: A new FP-tree-based algorithm MMFI for mining the maximal frequent itemsets. IEEE Int. Conf. Comput. Sci. Autom. Eng. (CSAE) 2, 61–65 (2012)
Bayardo Jr., R.J.: Efficiently mining long patterns from databases. In: ACM-SIGMOD International Conference on Management of Data, vol. 27, no. 2, pp. 85–93 (1998)
Burdick, D., Calimlim, M., Flannick, J., et al.: MAFIA: a maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Eng. 17(11), 1490–1504 (2005)
Lee, G., Yun, U.: Analysis of recent maximal frequent pattern mining approaches. In: International Conference on Computer Science & Its applications, pp. 873–877 (2016)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB 1994), pp. 487–499 (1994)
Bastide, Y., Taouil, R., et al.: Mining frequent patterns with counting inference. SIGKDD Explor. 2(2), 66–75 (2000)
Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (2000)
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972–986. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44957-4_65
Kumar, A., Upadhyay, A.: An efficient algorithm to mine non redundant top K association rules. Int. J. Emerg. Trends Sci. Technol. 03(01), 3491–3500 (2016)
Hamrouni, T., Denden, I., et al.: A new concise representation of frequent patterns through disjunctive search space. In: International Conference on Concept Lattices and their Applications (CLA 2007) (2007)
Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Towards faster mining of disjunction-based concise representations of frequent patterns. Int. J. Artif. Intell. Tools 23(23), 315–335 (2014)
Acknowledgement
The work described in this paper was fully supported by a grant from the National Natural Science Foundation of China (No. 61672203).
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 paper
Cite this paper
Tian, W., Mei, J., Zhou, H., Zhao, Z. (2018). GridWall: A Novel Condensed Representation of Frequent Itemsets. In: Huang, DS., Bevilacqua, V., Premaratne, P., Gupta, P. (eds) Intelligent Computing Theories and Application. ICIC 2018. Lecture Notes in Computer Science(), vol 10954. Springer, Cham. https://doi.org/10.1007/978-3-319-95930-6_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-95930-6_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95929-0
Online ISBN: 978-3-319-95930-6
eBook Packages: Computer ScienceComputer Science (R0)