{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:57:01Z","timestamp":1760709421102,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T00:00:00Z","timestamp":1506988800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503092"],"award-info":[{"award-number":["61503092"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10115-017-1103-8","type":"journal-article","created":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T05:04:17Z","timestamp":1507093457000},"page":"165-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Exploiting highly qualified pattern with frequency and weight occupancy"],"prefix":"10.1007","volume":"56","author":[{"given":"Wensheng","family":"Gan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han-Chieh","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,3]]},"reference":[{"unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. International conference on very large data bases, pp 487\u2013499","key":"1103_CR1"},{"issue":"1","key":"1103_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei YYJ, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"doi-asserted-by":"crossref","unstructured":"Tang L, Zhang L, Luo P, Wang M (2012) Incorporating occupancy into frequent pattern mining for high quality pattern recommendation. 21st ACM international conference on information and knowledge management, pp 75\u201384","key":"1103_CR3","DOI":"10.1145\/2396761.2396775"},{"doi-asserted-by":"crossref","unstructured":"Koh YS, Ravana SD (2016) Unsupervised rare pattern mining: a survey. ACM Trans Knowl Discov Data 10(4), Article 45","key":"1103_CR4","DOI":"10.1145\/2898359"},{"issue":"12","key":"1103_CR5","doi-asserted-by":"crossref","first-page":"15143","DOI":"10.1016\/j.eswa.2011.05.090","volume":"38","author":"CW Lin","year":"2011","unstructured":"Lin CW, Hong TP (2011) Temporal data mining with up-to-date pattern trees. Expert Syst Appl 38(12):15143\u201315150","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1103_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"doi-asserted-by":"crossref","unstructured":"Fournier Viger P, Lin JCW, Vo B, Chi TT, Zhang J, Le HB (2017) A survey of itemset mining. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery","key":"1103_CR7","DOI":"10.1002\/widm.1207"},{"doi-asserted-by":"crossref","unstructured":"Geng L, Hamilton HJ (2006) Interestingness measures for data mining: a survey. ACM Comput Surv 38(3), Article 9","key":"1103_CR8","DOI":"10.1145\/1132960.1132963"},{"issue":"1","key":"1103_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","volume":"15","author":"ER Omiecinski","year":"2003","unstructured":"Omiecinski ER (2003) Alternative interest measures for mining associations in databases. IEEE Trans Knowl Data Eng 15(1):57\u201369","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1103_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf L, Besson J, Robardet C, Boulicaut JF (2009) Closed patterns meet n-ary relations. ACM Trans Knowl Discov Data 3(1):3","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"3","key":"1103_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K Gouda","year":"2005","unstructured":"Gouda K, Zaki MJ (2005) Genmax: an efficient algorithm for mining maximal frequent itemsets. Data Min Knowl Disc 11(3):223\u2013242","journal-title":"Data Min Knowl Disc"},{"issue":"3","key":"1103_CR12","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.aei.2015.06.002","volume":"29","author":"JCW Lin","year":"2015","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Hong TP, Tseng VS (2015) Efficient algorithms for mining up-to-date high-utility patterns. Adv Eng Inf 29(3):648\u2013661","journal-title":"Adv Eng Inf"},{"doi-asserted-by":"crossref","unstructured":"Cai CH, Fu AWC, Cheng CH, Kwong WW (1998) Mining association rules with weighted items. International database engineering and applications symposium, pp 68\u201377","key":"1103_CR13","DOI":"10.1109\/IDEAS.1998.694360"},{"issue":"2","key":"1103_CR14","doi-asserted-by":"crossref","first-page":"413","DOI":"10.3233\/IDA-150723","volume":"19","author":"GC Lan","year":"2015","unstructured":"Lan GC, Hong TP, Lee HY, Lin CW (2015) Tightening upper bounds for mining weighted frequent itemsets. Intell Data Anal 19(2):413\u2013429","journal-title":"Intell Data Anal"},{"issue":"1","key":"1103_CR15","first-page":"232","volume":"41","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Hong TP, Tseng VS (2016) Weighted frequent itemset mining over uncertain databases. Appl Intell 41(1):232\u2013250","journal-title":"Appl Intell"},{"doi-asserted-by":"crossref","unstructured":"Nguyen H, Vo B, Nguyen M, Pedrycz W (2016) An efficient algorithm for mining frequent weighted itemsets using interval word segments. Appl Intell 1\u201313","key":"1103_CR16","DOI":"10.1007\/s10489-016-0799-6"},{"doi-asserted-by":"crossref","unstructured":"Wang W, Yang J, Yu PS (2000) Efficient mining of weighted association rules (WAR). ACM SIGKDD international conference on knowledge discovery and data mining, pp 211\u2013225","key":"1103_CR17","DOI":"10.1145\/347090.347149"},{"doi-asserted-by":"crossref","unstructured":"Tao F, Murtagh F, Farid M (2003) Weighted association rule mining using weighted support and significance framework. ACM SIGKDD international conference on knowledge discovery and data mining, pp 661\u2013666","key":"1103_CR18","DOI":"10.1145\/956750.956836"},{"doi-asserted-by":"crossref","unstructured":"Yun U, Leggett J (2005) WFIM: weighted frequent itemset mining with a weight range and a minimum weight. SIAM international conference on data mining, pp 636\u2013640","key":"1103_CR19","DOI":"10.1137\/1.9781611972757.76"},{"issue":"4","key":"1103_CR20","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1016\/j.eswa.2012.08.065","volume":"40","author":"B Vo","year":"2013","unstructured":"Vo B, Coenen F, Le B (2013) A new method for mining frequent weighted itemsets based on WIT-trees. Expert Syst Appl 40(4):1256\u20131264","journal-title":"Expert Syst Appl"},{"key":"1103_CR21","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.engappai.2015.06.009","volume":"45","author":"JCW Lin","year":"2015","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Hong TP (2015) RWFIM: recent weighted frequent itemsets mining. Eng Appl Artif Intell 45:18\u201332","journal-title":"Eng Appl Artif Intell"},{"doi-asserted-by":"crossref","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Hong TP (2016) Efficient algorithms for mining recent weighted frequent itemsets in temporal transactional databases. The 31st annual ACM symposium on applied computing, pp 861\u2013866","key":"1103_CR22","DOI":"10.1145\/2851613.2851648"},{"key":"1103_CR23","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.engappai.2017.03.004","volume":"61","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Chao HC, Wu JMT, Zhan J (2017) Extracting recent weighted-based patterns from uncertain temporal databases. Eng Appl Artif Intell 61:161\u2013172","journal-title":"Eng Appl Artif Intell"},{"unstructured":"Pei J, Han J, Lakshmanan L (2001) Mining frequent itemsets with convertible constraints. 17th international conference on data engineering, pp 433\u2013442","key":"1103_CR24"},{"issue":"4","key":"1103_CR25","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TKDE.2007.190723","volume":"20","author":"K Sun","year":"2008","unstructured":"Sun K, Bai F (2008) Mining weighted association rules without preassigned weights. IEEE Trans Knowl Data Eng 20(4):489\u2013495","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"1103_CR26","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/TKDE.2013.69","volume":"26","author":"L Cagliero","year":"2014","unstructured":"Cagliero L, Garza P (2014) Infrequent weighted itemset mining using frequent pattern growth. IEEE Trans Knowl Data Eng 26(4):903\u2013915","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1103_CR27","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.engappai.2014.01.004","volume":"30","author":"KJ Yang","year":"2014","unstructured":"Yang KJ, Hong TP, Lan GC, Chen YM (2014) A two-phase approach for mining weighted partial periodic patterns. Eng Appl Artif Intell 30:225\u2013234","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"1103_CR28","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10489-014-0530-4","volume":"41","author":"GC Lan","year":"2014","unstructured":"Lan GC, Hong TP, Lee HY (2014) An efficient approach for finding weighted sequential patterns from sequence databases. Appl Intell 41(2):439\u2013452","journal-title":"Appl Intell"},{"doi-asserted-by":"crossref","unstructured":"Baralis E, Cagliero L, Fiori A, Garza P (2015) MWI-sum: a multilingual summarizer based on frequent weighted itemsets. ACM Trans Inf Syst 34(1), Article 5","key":"1103_CR29","DOI":"10.1145\/2809786"},{"unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L(1998) Pruning closed itemset lattices for association rules. International conference on advanced databases, pp 177\u2013196","key":"1103_CR30"},{"unstructured":"Rymon R (1992) Search through systematic set enumeration. Technical Reports (CIS), p 297","key":"1103_CR31"},{"issue":"10","key":"1103_CR32","doi-asserted-by":"crossref","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"ZH Deng","year":"2014","unstructured":"Deng ZH, Lv SL (2014) Fast mining frequent itemsets using Nodesets. Expert Syst Appl 41(10):4505\u20134512","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1103_CR33","doi-asserted-by":"crossref","first-page":"2424","DOI":"10.1016\/j.eswa.2007.04.009","volume":"34","author":"TP Hong","year":"2008","unstructured":"Hong TP, Lin CW, Wu YL (2008) Incrementally fast updated frequent pattern trees. Expert Syst Appl 34(4):2424\u20132435","journal-title":"Expert Syst Appl"},{"issue":"13","key":"1103_CR34","doi-asserted-by":"crossref","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"ZH Deng","year":"2015","unstructured":"Deng ZH, Lv SL (2015) PrePost+: an efficient N-lists-based algorithm for mining frequent itemsets via Children\u2013Parent Equivalence pruning. Expert Syst Appl 42(13):5424\u20135432","journal-title":"Expert Syst Appl"},{"doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The SPMF open-source data mining library version 2. Joint European conference on machine learning and knowledge discovery in databases, pp 36\u201340","key":"1103_CR35","DOI":"10.1007\/978-3-319-46131-1_8"},{"doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1994) Quest synthetic data generator. http:\/\/www.Almaden.ibm.com\/cs\/quest\/syndata.htm","key":"1103_CR36","DOI":"10.1145\/191843.191972"},{"unstructured":"Zaharia M, Chowdhury M, Das T, Dave A, Ma J (2012) Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. The 9th USENIX conference on networked systems design and implementation, p 2","key":"1103_CR37"},{"issue":"3","key":"1103_CR38","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/j.aei.2015.05.003","volume":"29","author":"JCW Lin","year":"2015","unstructured":"Lin JCW, Gan W, Hong TP (2015) A fast updated algorithm to maintain the discovered high-utility itemsets for transaction modification. Adv Eng Inf 29(3):562\u2013574","journal-title":"Adv Eng Inf"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1103-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1103-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1103-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T02:52:43Z","timestamp":1570157563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1103-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,3]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1103"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1103-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2017,10,3]]}}}