{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T09:51:53Z","timestamp":1656237113903},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,6,2]],"date-time":"2013-06-02T00:00:00Z","timestamp":1370131200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10115-013-0656-4","type":"journal-article","created":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T07:13:43Z","timestamp":1370070823000},"page":"639-671","source":"Crossref","is-referenced-by-count":4,"title":["An approach of support approximation to discover frequent patterns from concept-drifting data streams based on concept learning"],"prefix":"10.1007","volume":"40","author":[{"given":"Chao-Wei","family":"Li","sequence":"first","affiliation":[]},{"given":"Kuen-Fang","family":"Jea","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,2]]},"reference":[{"key":"656_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large data bases. Santiago de Chile, Chile, pp 487\u2013499"},{"key":"656_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on management of data, Washington, DC, USA, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"656_CR3","doi-asserted-by":"crossref","unstructured":"Babcock B, Babu S, Datar M, Motwani R, Widom J (2002) Models and issues in data stream systems. In: Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems. Madison, WI, USA, pp 1\u201316","DOI":"10.1145\/543613.543615"},{"key":"656_CR4","unstructured":"Branke J (1995) Evolutionary algorithms for neural network design and training. In: Proceedings of the 1st Nordic workshop on genetic algorithms and its applications. Vaasa, Finland, pp 145\u2013163"},{"issue":"4","key":"656_CR5","first-page":"753","volume":"20","author":"JH Chang","year":"2004","unstructured":"Chang JH, Lee WS (2004) A sliding window method for finding recently frequent itemsets over online data streams. J Inf Sci Eng 20(4):753\u2013762","journal-title":"J Inf Sci Eng"},{"issue":"8","key":"656_CR6","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.is.2005.04.001","volume":"31","author":"JH Chang","year":"2006","unstructured":"Chang JH, Lee WS (2006) Finding recently frequent itemsets adaptively over online transactional data streams. Inf Syst 31(8):849\u2013869","journal-title":"Inf Syst"},{"issue":"1","key":"656_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M Charikar","year":"2004","unstructured":"Charikar M, Chen K, Farach-Colton M (2004) Finding frequent items in data streams. Theor Comput Sci 312(1):3\u201315","journal-title":"Theor Comput Sci"},{"issue":"1","key":"656_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0092-4","volume":"16","author":"J Cheng","year":"2008","unstructured":"Cheng J, Ke Y, Ng W (2008) A survey on algorithms for mining frequent itemsets over data streams. Knowl Inf Syst 16(1):1\u201327","journal-title":"Knowl Inf Syst"},{"key":"656_CR9","doi-asserted-by":"crossref","unstructured":"Dai W, Yang Q, Xue GR, Yu Y (2008) Self-taught clustering. In: Proceedings of the 25th international conference on machine learning. Helsinki, Finland, pp 200\u2013207","DOI":"10.1145\/1390156.1390182"},{"issue":"1","key":"656_CR10","first-page":"59","volume":"3","author":"G Dematos","year":"1996","unstructured":"Dematos G, Boyd MS, Kermanshahi B, Kohzadi N, Kaastra I (1996) Feedforward versus recurrent neural networks for forecasting monthly Japanese yen exchange rates. Asia Pac Financ Markets 3(1):59\u201375","journal-title":"Asia Pac Financ Markets"},{"key":"656_CR11","unstructured":"Gaber MM, Zaslavsky A, Krishnaswamy S (2010) Data stream mining. In: Data mining and knowledge discovery handbook, Springer 2010, pp 759\u2013787"},{"key":"656_CR12","unstructured":"Giannella C, Han J, Pei J, Yan X, Yu PS (2004) Mining frequent patterns in data streams at multiple time granularities. In: Data mining: next generation challenges and future directions. MIT Press, Cambridge, pp 191\u2013212"},{"key":"656_CR13","volume-title":"Neural network design","author":"MT Hagan","year":"1996","unstructured":"Hagan MT, Demuth HB, Beale MH (1996) Neural network design, 1st edn. PWS Publishing Company, Boston","edition":"1"},{"key":"656_CR14","unstructured":"Hallas M, Dorffner G (1998) A comparative study on feedforward and recurrent neural networks in time series prediction using gradient descent learning. In: Proceedings of the 14th European meetings on cybernetics and systems research. Vienna, Austria, pp 644\u2013647"},{"key":"656_CR15","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2011","unstructured":"Han J, Kamber M, Pei J (2011) Data mining: concepts and techniques, 3rd edn. Morgan Kaufmann, San Francisco","edition":"3"},{"issue":"1","key":"656_CR16","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 J, Yin Y (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"},{"issue":"5","key":"656_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K Hornik","year":"1989","unstructured":"Hornik K, Stinchcombe M, White H (1989) Multilayer feedforward networks are universal approximators. Neural Netw. 2(5):359\u2013366","journal-title":"Neural Netw."},{"issue":"1","key":"656_CR18","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.datak.2007.10.003","volume":"65","author":"KF Jea","year":"2008","unstructured":"Jea KF, Chang MY (2008) Discovering frequent itemsets by support approximation and itemset clustering. Data Knowl. Eng. 65(1):90\u2013107","journal-title":"Data Knowl. Eng."},{"issue":"10","key":"656_CR19","doi-asserted-by":"crossref","first-page":"12323","DOI":"10.1016\/j.eswa.2009.04.053","volume":"36","author":"KF Jea","year":"2009","unstructured":"Jea KF, Li CW (2009) Discovering frequent itemsets over transactional data streams through an efficient and stable approximate approach. Expert Syst. Appl. 36(10):12323\u201312331","journal-title":"Expert Syst. Appl."},{"key":"656_CR20","doi-asserted-by":"crossref","unstructured":"Jiang N, Gruenwald L (2006) CFI-Stream: mining closed frequent itemsets in data streams. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining. Philadelphia, PA, USA, pp 592\u2013597","DOI":"10.1145\/1150402.1150473"},{"key":"656_CR21","unstructured":"Jin R, Agrawal G (2005) An algorithm for in-core frequent itemset mining on streaming data. In: Proceedings of the 5th international conference on data mining. Houston, Texas, USA, pp 210\u2013217"},{"issue":"1","key":"656_CR22","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"RM Karp","year":"2003","unstructured":"Karp RM, Shenker S, Papadimitriou CH (2003) A simple algorithm for finding frequent elements in streams and bags. ACM Trans Database Syst 28(1):51\u201355","journal-title":"ACM Trans Database Syst"},{"key":"656_CR23","unstructured":"Leung CKS, Khan QI (2006) DSTree: a tree structure for the mining of frequent sets from data streams. In: Proceedings of the 6th international conference on data mining. Hong Kong, China, pp 928\u2013932"},{"issue":"10","key":"656_CR24","doi-asserted-by":"crossref","first-page":"13386","DOI":"10.1016\/j.eswa.2011.04.167","volume":"38","author":"CW Li","year":"2011","unstructured":"Li CW, Jea KF (2011) An adaptive approximation method to discover frequent itemsets over sliding-window-based data streams. Expert Syst Appl 38(10):13386\u201313404","journal-title":"Expert Syst Appl"},{"issue":"2","key":"656_CR25","doi-asserted-by":"crossref","first-page":"1466","DOI":"10.1016\/j.eswa.2007.11.061","volume":"36","author":"HF Li","year":"2009","unstructured":"Li HF, Lee SY (2009) Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Syst Appl 36(2):1466\u20131477","journal-title":"Expert Syst Appl"},{"issue":"1","key":"656_CR26","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10115-007-0112-4","volume":"17","author":"HF Li","year":"2008","unstructured":"Li HF, Shan MK, Lee SY (2008) DSM-FI: an efficient algorithm for mining frequent itemsets in data streams. Knowl Inf Syst 17(1):79\u201397","journal-title":"Knowl Inf Syst"},{"key":"656_CR27","doi-asserted-by":"crossref","unstructured":"Lin CH, Chiu DY, Wu YH, Chen ALP (2005) Mining frequent itemsets from data streams with a time-sensitive sliding window. In: Proceedings of the 5th SIAM international conference on data mining. Newport Beach, California, pp 68\u201379","DOI":"10.1137\/1.9781611972757.7"},{"issue":"4","key":"656_CR28","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02128670","volume":"10","author":"N Linial","year":"1990","unstructured":"Linial N, Nisan N (1990) Approximate inclusion-exclusion. Combinatorica 10(4):349\u2013365","journal-title":"Combinatorica"},{"key":"656_CR29","doi-asserted-by":"crossref","unstructured":"Manku GS, Motwani R (2002) Approximate frequency counts over data streams. In: Proceedings of the 28th international conference on very large data bases, Hong Kong, China, pp 346\u2013357","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"05","key":"656_CR30","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1109\/TKDE.2009.156","volume":"22","author":"LL Minku","year":"2010","unstructured":"Minku LL, White AP, Yao X (2010) The impact of diversity on online ensemble learning in the presence of concept drift. IEEE Trans Knowl Data Eng 22(05):730\u2013742","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"656_CR31","unstructured":"Narasimhamurthy A, Kuncheva LI (2007) A framework for generating data to simulate changing environments. In: Proceedings of the 25th IASTED international multi-conference on artificial intelligence and applications. Innsbruck, Austria, pp 384\u2013389"},{"issue":"10","key":"656_CR32","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/TKDE.2009.191","volume":"22","author":"SJ Pan","year":"2010","unstructured":"Pan SJ, Yang Q (2010) A survey on transfer learning. IEEE Trans.Knowl Data Eng 22(10):1345\u20131359","journal-title":"IEEE Trans.Knowl Data Eng"},{"key":"656_CR33","doi-asserted-by":"crossref","unstructured":"Park JS, Chen MS, Yu PS (1995) An effective hash-based algorithm for mining association rules. In: Proceedings of the 1995 ACM SIGMOD international conference on management of data, San Jose, California, pp 175\u2013186","DOI":"10.1145\/223784.223813"},{"key":"656_CR34","doi-asserted-by":"crossref","unstructured":"Raina R, Battle A, Lee H, Packer B, Ng AY (2007) Self-taught learning: transfer learning from unlabeled data. In: Proceedings of the 24th international conference on machine learning. Corvallis, Oregon, USA, pp 759\u2013766","DOI":"10.1145\/1273496.1273592"},{"key":"656_CR35","doi-asserted-by":"crossref","unstructured":"Ramamurthy S, Bhatnagar R (2007) Tracking recurrent concept drift in streaming data using ensemble classifiers. In: Proceedings of the 6th international conference on machine learning and applications. Washington, DC, USA, pp 404\u2013409","DOI":"10.1109\/ICMLA.2007.109"},{"issue":"6088","key":"656_CR36","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart DE, Hinton GE, Williams RJ (1986) Learning representations by back-propagating errors. Nature 323(6088):533\u2013536","journal-title":"Nature"},{"issue":"1","key":"656_CR37","doi-asserted-by":"crossref","first-page":"49","DOI":"10.3233\/IDA-2007-11104","volume":"11","author":"C Silvestri","year":"2007","unstructured":"Silvestri C, Orlando S (2007) Approximate mining of frequent patterns on streams. Intell Data Anal 11(1):49\u201373","journal-title":"Intell Data Anal"},{"issue":"22","key":"656_CR38","doi-asserted-by":"crossref","first-page":"3843","DOI":"10.1016\/j.ins.2009.07.012","volume":"179","author":"SK Tanbeer","year":"2009","unstructured":"Tanbeer SK, Ahmed CF, Jeong BS, Lee YK (2009) Sliding window-based frequent pattern mining over data streams. Inf Sci 179(22):3843\u20133865","journal-title":"Inf Sci"},{"issue":"1","key":"656_CR39","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/s10618-009-0129-2","volume":"19","author":"ET Wang","year":"2009","unstructured":"Wang ET, Chen ALP (2009) A novel hash-based approach for mining frequent itemsets over data streams requiring less memory space. Data Min Knowl Discov 19(1):132\u2013172","journal-title":"Data Min Knowl Discov"},{"key":"656_CR40","doi-asserted-by":"crossref","unstructured":"Wang H, Fan W, Yu PS, Han J (2003) Mining concept-drifting data streams using ensemble classifiers. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining. Washington, DC, USA, pp 226\u2013235","DOI":"10.1145\/956750.956778"},{"key":"656_CR41","doi-asserted-by":"crossref","unstructured":"Wang P, Wang H, Wu X, Wang W, Shi B (2005) On reducing classifier granularity in mining concept-drifting data streams. In: Proceedings of the 5th international conference on data mining. Houston, Texas, USA, pp 474\u2013481","DOI":"10.1109\/ICDM.2005.108"},{"issue":"14","key":"656_CR42","doi-asserted-by":"crossref","first-page":"1986","DOI":"10.1016\/j.ins.2005.11.003","volume":"176","author":"JX Yu","year":"2006","unstructured":"Yu JX, Chong Z, Lu H, Zhang Z, Zhou A (2006) A false negative approach to mining frequent itemsets from high speed transactional data streams. Inf Sci 176(14):1986\u20132015","journal-title":"Inf Sci"},{"key":"656_CR43","doi-asserted-by":"crossref","unstructured":"Zadrozny B (2004) Learning and evaluating classifiers under sample selection bias. In: Proceedings of the 21st international conference on machine learning, Banff, Alberta, Canada, pp 114","DOI":"10.1145\/1015330.1015425"},{"key":"656_CR44","doi-asserted-by":"crossref","unstructured":"Zhu Y, Shasha D (2002) StatStream: statistical monitoring of thousands of data streams in real time. In: Proceedings of 28th international conference on very large data bases. Hong Kong, China, pp 358\u2013369","DOI":"10.1016\/B978-155860869-6\/50039-1"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0656-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0656-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0656-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T15:48:01Z","timestamp":1645631281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0656-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,2]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["656"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0656-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,2]]}}}