{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:55Z","timestamp":1740122635127,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T00:00:00Z","timestamp":1617926400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T00:00:00Z","timestamp":1617926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10489-021-02357-8","type":"journal-article","created":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T23:09:21Z","timestamp":1617923361000},"page":"8629-8640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Mining colossal patterns with length constraints"],"prefix":"10.1007","volume":"51","author":[{"given":"Tuong","family":"Le","sequence":"first","affiliation":[]},{"given":"Thanh-Long","family":"Nguyen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1882-6877","authenticated-orcid":false,"given":"Bao","family":"Huynh","sequence":"additional","affiliation":[]},{"given":"Hung","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Vaclav","family":"Snasel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,9]]},"reference":[{"key":"2357_CR1","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.ins.2020.02.073","volume":"524","author":"A Telikani","year":"2020","unstructured":"Telikani A, Gandomi A, Shahbahrami A (2020) A survey of evolutionary computation for association rule mining. Inf Sci 524:318\u2013352","journal-title":"Inf Sci"},{"key":"2357_CR2","doi-asserted-by":"publisher","first-page":"105742","DOI":"10.1016\/j.knosys.2020.105742","volume":"196","author":"Y Shao","year":"2020","unstructured":"Shao Y, Liu B, Wang S, Li G (2020) Software defect prediction based on correlation weighted class association rule mining. Knowl Based Syst 196:105742","journal-title":"Knowl Based Syst"},{"key":"2357_CR3","doi-asserted-by":"publisher","first-page":"130133","DOI":"10.1109\/ACCESS.2019.2939960","volume":"7","author":"M Alibasa","year":"2019","unstructured":"Alibasa M, Calvo R, Yacef K (2019) Sequential pattern mining suggests wellbeing supportive behaviors. IEEE Access 7:130133\u2013130143","journal-title":"IEEE Access"},{"key":"2357_CR4","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.engappai.2018.06.009","volume":"74","author":"B Huynh","year":"2018","unstructured":"Huynh B, Trinh C, Huynh H, Van T, Vo B, Sn\u00e1sel V (2018) An efficient approach for mining sequential patterns using multiple threads on very large databases. Eng Appl of AI 74:242\u2013251","journal-title":"Eng Appl of AI"},{"key":"2357_CR5","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Yang Y, Yang P, Lin J, Yun U (2020) TKE: Mining Top-K frequent Episodes, in IEA\/AIE 2020: 832\u2013845","DOI":"10.1007\/978-3-030-55789-8_71"},{"issue":"6","key":"2357_CR6","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/TKDE.2019.2897311","volume":"32","author":"J Smedt","year":"2020","unstructured":"Smedt J, Deeva G, Weerdt J (2020) Mining behavioral sequence constraints for classification. IEEE Trans Knowl Data Eng 32(6):1130\u20131142","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"2357_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11277-019-06709-z","volume":"110","author":"H Zou","year":"2020","unstructured":"Zou H (2020) Clustering algorithm and its application in data mining. Wirel Pers Commun 110(1):21\u201330","journal-title":"Wirel Pers Commun"},{"key":"2357_CR8","first-page":"197","volume":"4","author":"I Astrova","year":"2020","unstructured":"Astrova I, Koschel A, Lee S (2020) Using market basket analysis to find semantic duplicates in ontology. ICCSA 4:197\u2013211","journal-title":"ICCSA"},{"key":"2357_CR9","doi-asserted-by":"crossref","unstructured":"Hagen M, Stein B (2018) Weblog analysis, in Encyclopedia of Social Network Analysis and Mining. 2nd Ed.","DOI":"10.1007\/978-1-4939-7131-2_129"},{"issue":"1","key":"2357_CR10","first-page":"205:1","volume":"20","author":"M Littmann","year":"2019","unstructured":"Littmann M, Goldberg T, Seitz S, Bod\u00e9n M, Rost B (2019) Detailed prediction of protein sub-nuclear localization. BMC Bioinformatics 20(1):205:1\u2013205:15","journal-title":"BMC Bioinformatics"},{"key":"2357_CR11","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.compeleceng.2018.12.001","volume":"73","author":"M Dessouky","year":"2019","unstructured":"Dessouky M, Taha E, Dessouky M, Eltholth A, Hassan E, El-Samie F (2019) Non-parametric spectral estimation techniques for DNA sequence analysis and exon region prediction. Comput Electric Eng 73:334\u2013348","journal-title":"Comput Electric Eng"},{"key":"2357_CR12","doi-asserted-by":"crossref","unstructured":"Kumar D, Sharma D (2019) Deep learning in gene expression modeling, in Handbook of Deep Learning Applications, pp. 363\u2013383","DOI":"10.1007\/978-3-030-11479-4_17"},{"issue":"1","key":"2357_CR13","doi-asserted-by":"publisher","first-page":"248:1","DOI":"10.1186\/s12859-018-2211-5","volume":"19","author":"J Bachman","year":"2018","unstructured":"Bachman J, Gyori B, Sorger P (2018) FamPlex: a resource for entity recognition and relationship resolution of human protein families and complexes in biomedical text mining. BMC Bioinform 19(1):248:1\u2013248:14","journal-title":"BMC Bioinform"},{"key":"2357_CR14","doi-asserted-by":"publisher","first-page":"108400","DOI":"10.1109\/ACCESS.2019.2933044","volume":"7","author":"N Deng","year":"2019","unstructured":"Deng N, Chen X, Li D, Xiong C (2019) Frequent patterns mining in DNA sequence. IEEE Access 7:108400\u2013108410","journal-title":"IEEE Access"},{"key":"2357_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.engappai.2018.10.010","volume":"77","author":"J Lin","year":"2019","unstructured":"Lin J, Yang L, Fournier-Viger P, Hong T (2019) Mining of skyline patterns by considering both frequent and utility constraints. Eng Appl AI 77:229\u2013238","journal-title":"Eng Appl AI"},{"key":"2357_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.knosys.2012.03.003","volume":"33","author":"M Sohrabi","year":"2012","unstructured":"Sohrabi M, Barforoush A (2012) Efficient colossal pattern mining in high dimensional datasets. Knowl-Based Syst 33:41\u201352","journal-title":"Knowl-Based Syst"},{"key":"2357_CR17","doi-asserted-by":"crossref","unstructured":"Zhu F, Yan X, Han J, Yu P, Cheng H (2007) Mining colossal frequent patterns by core pattern fusion. ICDE\u201907, pp. 706\u2013715","DOI":"10.1109\/ICDE.2007.367916"},{"key":"2357_CR18","first-page":"304","volume":"6","author":"M Dabbiru","year":"2010","unstructured":"Dabbiru M, Shashi M (2010) An efficient approach to colossal pattern mining. Int J Comput Sci Network Security 6:304\u2013312","journal-title":"Int J Comput Sci Network Security"},{"key":"2357_CR19","doi-asserted-by":"crossref","unstructured":"Prasanna K, Seetha M (2015) A doubleton pattern mining approach for discovering colossal patterns from biological dataset. Int J Comput Appl 119(21)","DOI":"10.5120\/21364-4386"},{"key":"2357_CR20","first-page":"412","volume":"54","author":"K Prasanna","year":"2015","unstructured":"Prasanna K, Seetha M (2015) Efficient and accurate discovery of colossal pattern sequences from biological datasets: A doubleton pattern mining strategy (DPMine). IMCIP 54:412\u2013421","journal-title":"IMCIP"},{"key":"2357_CR21","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.knosys.2017.01.034","volume":"122","author":"T Nguyen","year":"2017","unstructured":"Nguyen T, Vo B, Sn\u00e1sel V (2017) Efficient algorithms for mining colossal patterns in high dimensional databases. Knowl-Based Syst 122:75\u201389","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"2357_CR22","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10115-018-1161-6","volume":"57","author":"T Van","year":"2018","unstructured":"Van T, Vo B, Le B (2018) Mining sequential patterns with itemset constraints. Knowl Inf Syst 57(2):311\u2013330","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"2357_CR23","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1007\/s10489-017-1123-9","volume":"48","author":"T Le","year":"2018","unstructured":"Le T, Nguyen A, Huynh B, Vo B, Pedrycz W (2018) Mining constrained inter-sequence patterns: a novel approach to cope with item constraints. Appl Intell 48(5):1327\u20131343","journal-title":"Appl Intell"},{"key":"2357_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.knosys.2016.03.025","volume":"103","author":"D Nguyen","year":"2016","unstructured":"Nguyen D, Nguyen L, Vo B, Pedrycz W (2016) Efficient mining of class association rules with the itemset constraint. Knowl-Based Syst 103:73\u201388","journal-title":"Knowl-Based Syst"},{"key":"2357_CR25","doi-asserted-by":"crossref","unstructured":"Bessiere C, Lazaar N, Lebbah Y, M. M. (2018) Users constraints in itemset mining, CoRR abs\/1801.00345","DOI":"10.1007\/978-3-319-98334-9_35"},{"key":"2357_CR26","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ins.2015.05.006","volume":"320","author":"D Nguyen","year":"2015","unstructured":"Nguyen D, Nguyen L, Vo B, Hong T (2015) A novel method for constrained class association rule mining. Inf Sci 320:107\u2013125","journal-title":"Inf Sci"},{"key":"2357_CR27","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.eswa.2016.10.028","volume":"69","author":"B Vo","year":"2017","unstructured":"Vo B, Le T, Pedrycz W, Nguyen G, Baik S (2017) Mining erasable itemsets with subset and superset itemset constraints. Expert Syst Appl 69:50\u201361","journal-title":"Expert Syst Appl"},{"key":"2357_CR28","doi-asserted-by":"crossref","unstructured":"Nguyen T, Bay V, Huynh B, Snasel V, Nguyen L (2017) Constraint-based method for mining colossal patterns in high dimensional databases, in Information Systems Architecture and Technology - ISAT, Advances in Intelligent Systems and Computing, pp. 195\u2013204","DOI":"10.1007\/978-3-319-67220-5_18"},{"key":"2357_CR29","unstructured":"Zulkurnain N (2012) DisClose : discovering colossal closed itemsets from high dimensional datasets via a compact row-tree. University of Manchester"},{"key":"2357_CR30","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ins.2018.08.009","volume":"496","author":"M Vanahalli","year":"2019","unstructured":"Vanahalli M, Patil N (2019) An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets. Inf Sci 496:343\u2013362","journal-title":"Inf Sci"},{"key":"2357_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2018.07.025","volume":"161","author":"FM Zaki","year":"2018","unstructured":"Zaki FM, Zulkurnain N (2018) RARE: mining colossal closed itemset in high dimensional data. Knowl-Based Syst 161:1\u201311","journal-title":"Knowl-Based Syst"},{"key":"2357_CR32","first-page":"891","volume":"1","author":"M Vanahalli","year":"2018","unstructured":"Vanahalli M, Patil N (2018) Distributed mining of significant frequent colossal closed itemsets from long biological dataset. ISDA 1:891\u2013902","journal-title":"ISDA"},{"key":"2357_CR33","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1609\/aaai.v33i01.33011495","volume":"33","author":"A Hosseininasab","year":"2019","unstructured":"Hosseininasab A, Hoeve W-J, Cir\u00e9 A (2019) Constraint-based sequential pattern mining with decision diagrams. AAAI 33:1495\u20131502","journal-title":"AAAI"},{"issue":"S-2","key":"2357_CR34","first-page":"89","volume":"18","author":"R Abeysinghe","year":"2018","unstructured":"Abeysinghe R, Cui L (2018) Query constraint based mining of association rules for exploratory analysis of clinical datasets in the National Sleep Research Resource. BMC Med Inf Decis Making 18(S-2):89\u2013100","journal-title":"BMC Med Inf Decis Making"},{"key":"2357_CR35","doi-asserted-by":"crossref","unstructured":"Belaid M, Bessiere C, Lazaar N (2019) Constraint programming for association rules. SDM:127\u2013135","DOI":"10.1137\/1.9781611975673.15"},{"issue":"11","key":"2357_CR36","doi-asserted-by":"publisher","first-page":"3902","DOI":"10.1007\/s10489-018-1182-6","volume":"48","author":"T Van","year":"2018","unstructured":"Van T, Yoshitaka A, Le B (2018) Mining web access patterns with super-pattern constraint. Appl Intell 48(11):3902\u20133914","journal-title":"Appl Intell"},{"issue":"10","key":"2357_CR37","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1109\/LCOMM.2018.2866566","volume":"22","author":"W Song","year":"2018","unstructured":"Song W, Cai K, Zhang M, Yuen C (2018) Codes with run-length and GC-content constraints for DNA-based data storage. IEEE Commun Lett 22(10):2004\u20132007","journal-title":"IEEE Commun Lett"},{"issue":"3","key":"2357_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/IJDWM.2019070101","volume":"15","author":"K Singh","year":"2019","unstructured":"Singh K, Bhaskar Biswas B (2019) Efficient algorithm for mining high utility pattern considering length constraints. Int J Data Warehous Min 15(3):1\u201327","journal-title":"Int J Data Warehous Min"},{"issue":"11","key":"2357_CR39","doi-asserted-by":"publisher","first-page":"4094","DOI":"10.1007\/s10489-020-01778-1","volume":"50","author":"Y Wu","year":"2020","unstructured":"Wu Y, Fan J, Li Y, Guo L, Wu X (2020) NetDAP: (\u03b4, \u03b3) - approximate pattern matching with length constraints. Appl Intell 50(11):4094\u20134116","journal-title":"Appl Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02357-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02357-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02357-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T05:07:11Z","timestamp":1636434431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02357-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,9]]},"references-count":39,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["2357"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02357-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2021,4,9]]},"assertion":[{"value":"13 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}