{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:57:19Z","timestamp":1740175039020,"version":"3.37.3"},"reference-count":43,"publisher":"Zhejiang University Press","issue":"9","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Fundamental Research Funds for the Central Universities, China","award":["2412015KJ005"],"award-info":[{"award-number":["2412015KJ005"]}]},{"name":"the Twelfth Five-Year Plan Project of the Education Department of Jilin Province, China","award":["557"],"award-info":[{"award-number":["557"]}]},{"name":"the Thirteenth Five-Year Plan for Scientific Research of the Education Department of Jilin Province, China","award":["JJKH20191197KJ"],"award-info":[{"award-number":["JJKH20191197KJ"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Frontiers Inf Technol Electronic Eng"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1631\/fitee.1800467","type":"journal-article","created":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T12:01:05Z","timestamp":1571400065000},"page":"1234-1245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A non-group parallel frequent pattern mining algorithm based on conditional patterns"],"prefix":"10.1631","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5632-7596","authenticated-orcid":false,"given":"Zhe-jun","family":"Kuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5053-2935","authenticated-orcid":false,"given":"Dong-dai","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-peng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"635","published-online":{"date-parts":[[2019,10,18]]},"reference":[{"key":"1431_CR1","unstructured":"Agrawal R, Srikant R, 1994. Fast algorithms for mining association rules in large databases. Proc Int Conf on Very Large Data Bases, p.487\u2013499."},{"issue":"3","key":"1431_CR2","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"RC Agarwal","year":"2002","unstructured":"Agarwal RC, Aggarwal CC, Prasad VVV, 2002. A tree projection algorithm for generation of frequent item sets. J Parall Distrib Comput, 61(3):350\u2013371. \n                    https:\/\/doi.org\/10.1006\/jpdc.2000.1693","journal-title":"J Parall Distrib Comput"},{"key":"1431_CR3","unstructured":"Bauer M, Bruveris M, Charon N, et al., 2018. A relaxed approach for curve matching with elastic metrics. \n                    https:\/\/arxiv.gg363.site\/abs\/1803.10893"},{"issue":"8","key":"1431_CR4","doi-asserted-by":"publisher","first-page":"880","DOI":"10.14778\/3204028.3204032","volume":"11","author":"L Berti-\u00c9quille","year":"2018","unstructured":"Berti-\u00c9quille L, Harmouch H, Naumann F, et al., 2018. Discovery of genuine functional dependencies from relational data with missing values. Proc VLDB Endowm, 11(8):880\u2013892. \n                    https:\/\/doi.org\/10.14778\/3204028.3204032","journal-title":"Proc VLDB Endowm"},{"key":"1431_CR5","doi-asserted-by":"publisher","unstructured":"Caruccio L, Deufemia V, Polese G, 2016. On the discovery of relaxed functional dependencies. Proc 20th Int Database Engineering & Applications Symp, p.53\u201361. \n                    https:\/\/doi.org\/10.1145\/2938503.2938519","DOI":"10.1145\/2938503.2938519"},{"key":"1431_CR6","doi-asserted-by":"publisher","unstructured":"Caruccio L, Deufemia V, Polese G, 2017. Evolutionary mining of relaxed dependencies from big data collections. Proc 7th Int Conf on Web Intelligence, Mining and Semantics, Article 5. \n                    https:\/\/doi.org\/10.1145\/3102254.3102259","DOI":"10.1145\/3102254.3102259"},{"key":"1431_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-030-01391-2_17","volume-title":"Lecture Notes in Computer Science","author":"Loredana Caruccio","year":"2018","unstructured":"Caruccio L, Polese G, Tortora G, 2018. Dependency-based query\/view synchronization upon schema evolutions. Int Conf on Conceptual Modeling, p.91\u2013105. \n                    https:\/\/doi.org\/10.1007\/978-3-030-01391-2_17"},{"issue":"2","key":"1431_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s11704-013-3903-7","volume":"7","author":"JC Chen","year":"2013","unstructured":"Chen JC, Chen YG, Du XY, et al., 2013. Big data challenge: a data management perspective. Front Comput Sci, 7(2):157\u2013164. \n                    https:\/\/doi.org\/10.1007\/s11704-013-3903-7","journal-title":"Front Comput Sci"},{"key":"1431_CR9","doi-asserted-by":"crossref","unstructured":"Cong S, Han J, Padua D, 2005. Parallel mining of closed sequential patterns. Proc 11th ACM SIGKDD Int Conf on Knowledge Discovery in Data Mining, p.562\u2013567.","DOI":"10.1145\/1081870.1081937"},{"key":"1431_CR10","doi-asserted-by":"publisher","unstructured":"Deng LL, Lou YS, 2015. Improvement and research of FP-growth algorithm based on distributed spark. Proc Int Conf on Cloud Computing and Big Data, p.105\u2013108. \n                    https:\/\/doi.org\/10.1109\/CCBD.2015.15","DOI":"10.1109\/CCBD.2015.15"},{"key":"1431_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-03915-7_26","volume-title":"Advances in Intelligent Data Analysis VIII","author":"Lisa Di-Jorio","year":"2009","unstructured":"di-Jorio L, Laurent A, Teisseire M, 2009. Mining frequent gradual itemsets from large databases. Int Symp on Intelligent Data Analysis, p.297\u2013308. \n                    https:\/\/doi.org\/10.1007\/978-3-642-03915-7_26"},{"issue":"3","key":"1431_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10619-006-0445-0","volume":"20","author":"M El-Hajj","year":"2006","unstructured":"El-Hajj M, Za\u00efane OR, 2006. Parallel bifold: large-scale parallel pattern mining with constraints. Distrib Parall Datab, 20(3):225\u2013243. \n                    https:\/\/doi.org\/10.1007\/s10619-006-0445-0","journal-title":"Distrib Parall Datab"},{"issue":"7","key":"1431_CR13","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1631\/FITEE.1601786","volume":"18","author":"KS Ge","year":"2017","unstructured":"Ge KS, Su HY, Li DS, et al., 2017. Efficient parallel implementation of a density peaks clustering algorithm on graphics processing unit. Front Inform Technol Electron Eng, 18(7):915\u2013927. \n                    https:\/\/doi.org\/10.1631\/FITEE.1601786","journal-title":"Front Inform Technol Electron Eng"},{"issue":"2","key":"1431_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"JW Han","year":"2000","unstructured":"Han JW, Pei J, Yin YW, 2000. Mining frequent patterns without candidate generation. ACM SIGMOD Rec, 29(2):1\u201312. \n                    https:\/\/doi.org\/10.1145\/335191.335372","journal-title":"ACM SIGMOD Rec"},{"issue":"2","key":"1431_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","volume":"42","author":"Y Huhtala","year":"1999","unstructured":"Huhtala Y, K\u00e4rkk\u00e4inen J, Porkka P, et al., 1999. Tane: an efficient algorithm for discovering functional and approximate dependencies. Comput J, 42(2):100\u2013111. \n                    https:\/\/doi.org\/10.1093\/comjnl\/42.2.100","journal-title":"Comput J"},{"issue":"7","key":"1431_CR16","doi-asserted-by":"publisher","first-page":"759","DOI":"10.14778\/3192965.3192968","volume":"11","author":"S Kruse","year":"2018","unstructured":"Kruse S, Naumann F, 2018. Efficient discovery of approximate dependencies. Proc VLDB Endowm, 11(7):759\u2013772. \n                    https:\/\/doi.org\/10.14778\/3192965.3192968","journal-title":"Proc VLDB Endowm"},{"key":"1431_CR17","doi-asserted-by":"publisher","unstructured":"Li HY, Wang Y, Zhang D, et al., 2008. PFP: parallel FP-growth for query recommendation. Proc ACM Conf on Recommender Systems, p.107\u2013114. \n                    https:\/\/doi.org\/10.1145\/1454008.1454027","DOI":"10.1145\/1454008.1454027"},{"key":"1431_CR18","doi-asserted-by":"publisher","unstructured":"Li N, Zeng L, He Q, et al., 2012. Parallel implementation of Apriori algorithm based on MapReduce. Proc. 13th ACIS Int Conf on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing, p.236\u2013241. \n                    https:\/\/doi.org\/10.1109\/SNPD.2012.31","DOI":"10.1109\/SNPD.2012.31"},{"key":"1431_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.future.2015.05.009","volume":"52","author":"KW Lin","year":"2015","unstructured":"Lin KW, Chung SH, 2015. A fast and resource efficient mining algorithm for discovering frequent patterns in distributed computing environments. Fut Gener Comput Syst, 52:49\u201358. \n                    https:\/\/doi.org\/10.1016\/j.future.2015.05.009","journal-title":"Fut Gener Comput Syst"},{"key":"1431_CR20","doi-asserted-by":"publisher","unstructured":"Lin MY, Lee PY, Hsueh SC, 2012. Apriori-based frequent itemset mining algorithms on MapReduce. Proc 6th Int Conf on Ubiquitous Information Management and Communication, Article 26. \n                    https:\/\/doi.org\/10.1145\/2184751.2184842","DOI":"10.1145\/2184751.2184842"},{"key":"1431_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-319-22849-5_27","volume-title":"Lecture Notes in Computer Science","author":"Junqiang Liu","year":"2015","unstructured":"Liu JQ, Wu YS, Zhou QF, et al., 2015. Parallel Eclat for opportunistic mining of frequent itemsets. Int Conf on Database and Expert Systems Applications, p.401\u2013415. \n                    https:\/\/doi.org\/10.1007\/978-3-319-22849-5_27"},{"key":"1431_CR22","unstructured":"Lucchese C, Orlando S, Perego R, et al., 2004. WebDocs: a real-life huge transactional dataset. Proc IEEE ICDM Workshop on Frequent Itemset Mining Implementations."},{"key":"1431_CR23","doi-asserted-by":"publisher","unstructured":"Mandros P, Boley M, Vreeken J, 2017. Discovering reliable approximate functional dependencies. Proc 23rd ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining, p.355\u2013363. \n                    https:\/\/doi.org\/10.1145\/3097983.3098062","DOI":"10.1145\/3097983.3098062"},{"key":"1431_CR24","doi-asserted-by":"publisher","unstructured":"Riondato M, DeBrabant JA, Fonseca R, et al., 2012. PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce. Proc 21st ACM Int Conf on Information and Knowledge Management, p.85\u201394. \n                    https:\/\/doi.org\/10.1145\/2396761.2396776","DOI":"10.1145\/2396761.2396776"},{"issue":"8","key":"1431_CR25","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1631\/FITEE.1500441","volume":"18","author":"A Siddiqa","year":"2017","unstructured":"Siddiqa A, Karim A, Gani A, 2017. Big data storage technologies: a survey. Front Inform Technol Electron Eng, 18(8):1040\u20131070. \n                    https:\/\/doi.org\/10.1631\/FITEE.1500441","journal-title":"Front Inform Technol Electron Eng"},{"key":"1431_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0014140","volume-title":"Advances in Database Technology \u2014 EDBT '96","author":"Ramakrishnan Srikant","year":"1996","unstructured":"Srikant R, Agrawal R, 1996. Mining sequential patterns: generalizations and performance improvements. Int Conf on Extending Database Technology, p.1\u201317. \n                    https:\/\/doi.org\/10.1007\/BFb0014140"},{"issue":"3","key":"1431_CR27","doi-asserted-by":"publisher","first-page":"462752","DOI":"10.1155\/2015\/462752","volume":"11","author":"F Wang","year":"2015","unstructured":"Wang F, Hu L, Zhou J, et al., 2015. A survey from the perspective of evolutionary process in the Internet of Things. Int J Distrib Sen Networks, 11(3):462752. \n                    https:\/\/doi.org\/10.1155\/2015\/462752","journal-title":"Int J Distrib Sen Networks"},{"key":"1431_CR28","doi-asserted-by":"publisher","unstructured":"Wang J, Han J, 2004. BIDE: efficient mining of frequent closed sequences. Proc 20th Int Conf on Data Engineering, p.79\u201390. \n                    https:\/\/doi.org\/10.1109\/ICDE.2004.1319986","DOI":"10.1109\/ICDE.2004.1319986"},{"key":"1431_CR29","unstructured":"Xia D, Zhou Y, Rong Z, et al., 2013. IPFP: an improved parallel FP-growth algorithm for frequent itemsets mining. Proc 59th ISI World Statistics Congress, p.4034\u20134039."},{"issue":"2","key":"1431_CR30","first-page":"459","volume":"5","author":"D Xia","year":"2014","unstructured":"Xia D, Rong Z, Zhou Y, 2014. A novel parallel algorithm for frequent itemsets mining in massive small files datasets. ICIC Expr Lett Part B, 5(2):459\u2013466.","journal-title":"ICIC Expr Lett Part B"},{"key":"1431_CR31","doi-asserted-by":"publisher","unstructured":"Yang Q, Du FY, Zhu X, et al., 2016. Improved balanced parallel FP-growth with MapReduce. Joint Int Conf on Artificial Intelligence and Computer Engineering and Int Conf on Network and Communication Security, p.1\u20135. \n                    https:\/\/doi.org\/10.12783\/dtcse\/aice-ncs2016\/5681","DOI":"10.12783\/dtcse\/aice-ncs2016\/5681"},{"key":"1431_CR32","doi-asserted-by":"publisher","unstructured":"Yang XY, Liu Z, Fu Y, 2010. MapReduce as a programming model for association rules algorithm on Hadoop. Proc 3rd Int Conf on Information Sciences and Interaction Sciences, p.99\u2013102. \n                    https:\/\/doi.org\/10.1109\/ICICIS.2010.5534718","DOI":"10.1109\/ICICIS.2010.5534718"},{"key":"1431_CR33","doi-asserted-by":"publisher","unstructured":"Yu KM, Zhou JY, Hsiao WC, 2007. Load balancing approach parallel algorithm for frequent pattern mining. Proc Int Conf on Parallel Computing Technologies, p.623\u2013631. \n                    https:\/\/doi.org\/10.1007\/978-3-540-73940-1_63","DOI":"10.1007\/978-3-540-73940-1_63"},{"issue":"3","key":"1431_CR34","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ, 2000. Scalable algorithms for association mining. IEEE Trans Know Data Eng, 12(3):372\u2013390. \n                    https:\/\/doi.org\/10.1109\/69.846291","journal-title":"IEEE Trans Know Data Eng"},{"issue":"3","key":"1431_CR35","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1006\/jpdc.2000.1695","volume":"61","author":"MJ Zaki","year":"2001","unstructured":"Zaki MJ, 2001a. Parallel sequence mining on shared-memory machines. J Parall Distrib Comput, 61(3):401\u2013426.","journal-title":"J Parall Distrib Comput"},{"issue":"1\u20132","key":"1431_CR36","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki MJ, 2001b. SPADE: an efficient algorithm for mining frequent sequences. Mach Learn, 42(1\u20132):31\u201360. \n                    https:\/\/doi.org\/10.1023\/A:1007652502315","journal-title":"Mach Learn"},{"key":"1431_CR37","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.diin.2016.03.002","volume":"17","author":"XL Zhang","year":"2016","unstructured":"Zhang XL, Breitinger F, Baggili I, 2016. Rapid Android parser for investigating DEX files (RAPID). Dig Investig, 17:28\u201339. \n                    https:\/\/doi.org\/10.1016\/j.diin.2016.03.002","journal-title":"Dig Investig"},{"key":"1431_CR38","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.cose.2017.07.011","volume":"70","author":"XL Zhang","year":"2017","unstructured":"Zhang XL, Baggili I, Breitinger F, 2017. Breaking into the vault: privacy, security and forensic analysis of Android vault applications. Comput Secur, 70:516\u2013531. \n                    https:\/\/doi.org\/10.1016\/j.cose.2017.07.011","journal-title":"Comput Secur"},{"key":"1431_CR39","doi-asserted-by":"publisher","unstructured":"Zhang ZG, Ji GL, Tang MM, 2013. MREclat: an algorithm for parallel mining frequent itemsets. Proc Int Conf on Advanced Cloud and Big Data, p.177\u2013180. \n                    https:\/\/doi.org\/10.1109\/CBD.2013.22","DOI":"10.1109\/CBD.2013.22"},{"issue":"8","key":"1431_CR40","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1631\/FITEE.1500487","volume":"17","author":"YX Zhao","year":"2016","unstructured":"Zhao YX, Zhang WX, Li DS, et al., 2016. Pegasus: a distributed and load-balancing fingerprint identification system. Front Inform Technol Electron Eng, 17(8):766\u2013780. \n                    https:\/\/doi.org\/10.1631\/FITEE.1500487","journal-title":"Front Inform Technol Electron Eng"},{"key":"1431_CR41","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.sbspro.2014.07.254","volume":"138","author":"XF Zheng","year":"2014","unstructured":"Zheng XF, Wang S, 2014. Study on the method of road transport management information data mining based on pruning Eclat algorithm and MapReduce. Proc Soc Behav Sci, 138:757\u2013766. \n                    https:\/\/doi.org\/10.1016\/j.sbspro.2014.07.254","journal-title":"Proc Soc Behav Sci"},{"key":"1431_CR42","doi-asserted-by":"publisher","unstructured":"Zhou L, Zhong ZY, Chang J, et al., 2010. Balanced parallel FP-growth with MapReduce. Proc. IEEE Youth Conf on Information, Computing and Telecommunications, p.243\u2013246. \n                    https:\/\/doi.org\/10.1109\/YCICT.2010.5713090","DOI":"10.1109\/YCICT.2010.5713090"},{"issue":"1","key":"1431_CR43","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1631\/FITEE.1601883","volume":"18","author":"YT Zhuang","year":"2017","unstructured":"Zhuang YT, Wu F, Chen C, et al., 2017. Challenges and opportunities: from big data to knowledge in AI 2.0. Front Inform Technol Electron Eng, 18(1):3\u201314. \n                    https:\/\/doi.org\/10.1631\/FITEE.1601883","journal-title":"Front Inform Technol Electron Eng"}],"container-title":["Frontiers of Information Technology & Electronic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.1800467.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1631\/FITEE.1800467\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.1800467.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T23:07:29Z","timestamp":1602889649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1631\/FITEE.1800467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":43,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1431"],"URL":"https:\/\/doi.org\/10.1631\/fitee.1800467","relation":{},"ISSN":["2095-9184","2095-9230"],"issn-type":[{"type":"print","value":"2095-9184"},{"type":"electronic","value":"2095-9230"}],"subject":[],"published":{"date-parts":[[2019,9]]},"assertion":[{"value":"5 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Zhe-jun KUANG, Hang ZHOU, Dong-dai ZHOU, Jin-peng ZHOU, and Kun YANG declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethics guidelines"}}]}}