{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:01:50Z","timestamp":1778601710838,"version":"3.51.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T00:00:00Z","timestamp":1424131200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s13042-015-0337-6","type":"journal-article","created":{"date-parts":[[2015,2,16]],"date-time":"2015-02-16T16:01:29Z","timestamp":1424102489000},"page":"441-453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["TDUP: an approach to incremental mining of frequent itemsets with three-way-decision pattern updating"],"prefix":"10.1007","volume":"8","author":[{"given":"Yao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Heng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Bin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Min","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,17]]},"reference":[{"key":"337_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB conference, pp 487\u2013499"},{"key":"337_CR2","unstructured":"Vo B, Le T, Coenen F, Hong TP (2014) Mining frequent itemsets using the n-list and subsume concepts. Int J Mach Learn Cybern, pp 1\u201313"},{"key":"337_CR3","unstructured":"Duan L, Street WN (2014) Speeding up maximal fully-correlated itemsets search in large databases. Int J Mach Learn Cybern, pp 1\u201311"},{"key":"337_CR4","doi-asserted-by":"crossref","first-page":"6297","DOI":"10.12733\/jics20104994","volume":"11","author":"Y Li","year":"2014","unstructured":"Li Y, Zhang ZH, Chen WB, Min F (2014) Mining high utility itemsets with discount strategies. Inf Comput Sci 11:6297\u20136307","journal-title":"Inf Comput Sci"},{"key":"337_CR5","unstructured":"Kopa M, D\u2019Ecclesia RL, Tichy T (2012) Financial modeling"},{"key":"337_CR6","unstructured":"Higgins RC, Reimers M (2007) Analysis for financial management. McGraw-Hill, Irwin"},{"issue":"2","key":"337_CR7","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/846183.846185","volume":"1","author":"KM Ahmed","year":"2000","unstructured":"Ahmed KM, El-Makky NM, Taha Y (2000) A note on beyond market baskets: generalizing association rules to correlations. ACM SIGKDD Explor Newsl 1(2):46\u201348","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"337_CR8","unstructured":"Berry MJ, Linoff GS (2004) Data mining techniques: for marketing, sales, and customer relationship management. Wiley"},{"key":"337_CR9","doi-asserted-by":"crossref","unstructured":"Min F, Zhu W (2012) Granular association rule mining through parametric rough sets. In: brain informatics. Springer, pp 320\u2013331","DOI":"10.1007\/978-3-642-35139-6_30"},{"key":"337_CR10","doi-asserted-by":"crossref","unstructured":"Min F, Hu QH, Zhu W (2014) Feature selection with test cost constraint. Int J Approax Reason 55(1)","DOI":"10.1016\/j.ijar.2013.04.003"},{"key":"337_CR11","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.ins.2013.06.057","volume":"250","author":"XB Yang","year":"2013","unstructured":"Yang XB, Qi YS, Song XN, Yang JY (2013) Test cost sensitive multigranulation rough set: model and minimal cost selection. Inf Sci 250:184\u2013199","journal-title":"Inf Sci"},{"key":"337_CR12","unstructured":"Wikipedia: big data. http:\/\/en.wikipedia.org\/wiki\/Big\\_data#cite\\_note-15"},{"key":"337_CR13","doi-asserted-by":"crossref","unstructured":"Chang CC, Li YC, Lee JS (2005) An efficient algorithm for incremental mining of association rules. In: IEEE research issues in data engineering: stream data mining and applications, pp 3\u201310","DOI":"10.1109\/RIDE.2005.6"},{"key":"337_CR14","doi-asserted-by":"crossref","unstructured":"Cheung DW, Han J, Ng VT, Wong CY (1996) Maintenance of discovered association rules in large databases: an incremental updating approach. In: Proceedings of the twelfth international conference, data engineering, pp 106\u2013114","DOI":"10.1109\/ICDE.1996.492094"},{"key":"337_CR15","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases, pp 487\u2013499"},{"key":"337_CR16","first-page":"1","volume":"7413","author":"YY Yao","year":"2012","unstructured":"Yao YY (2012) An outline of a theory of three-way decisions. Comput Sci 7413:1\u201317","journal-title":"Comput Sci"},{"key":"337_CR17","unstructured":"Jia XY, Shang L, Zhou XZ, Liang JY, Miao DQ, Wang GY, Li TR, Zhang YP (eds) (2012) Theory of three-way decisions and application (in chinese). Nanjing University Press"},{"key":"337_CR18","unstructured":"Liu D, Li TR, Miao DQ, Wang GY, Liang JY (eds) (2013) Three-way decisions and granular computing (in chinese). Science Press"},{"issue":"1","key":"337_CR19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.ijar.2013.03.018","volume":"55","author":"H Yu","year":"2014","unstructured":"Yu H, Liu ZG, Wang GY (2014) An automatic method to determine the number of clusters using decision-theoretic rough set. Int J Approx Reason 55(1):101\u2013115","journal-title":"Int J Approx Reason"},{"key":"337_CR20","unstructured":"Mohamed MH, Darwieesh MM (2013) Efficient mining frequent itemsets algorithms. Int J Mach Learn Cybern, pp 1\u201311"},{"key":"337_CR21","unstructured":"Pei J, Han JW, Lakshmanan LV (2001) Mining frequent itemsets with convertible constraints. In: Proceedings of 17th international conference, data engineering, pp 433\u2013442"},{"key":"337_CR22","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"RC Agarwal","year":"2001","unstructured":"Agarwal RC, Aggarwal CC, Prasad V (2001) A tree projection algorithm for generation of frequent itemsets. J Parallel Distrib Comput 61:350\u2013371","journal-title":"J Parallel Distrib Comput"},{"key":"337_CR23","doi-asserted-by":"crossref","unstructured":"Cheung W, Zaiane OR (2003) Incremental mining of frequent patterns without candidate generation or support constraint. In: IEEE Proceedings of seventh international symposium applications database engineering, pp 111\u2013116","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"337_CR24","doi-asserted-by":"crossref","unstructured":"Shan S, Wang X, Sui M (2010) Mining association rules: a continuous incremental updating technique. In: International conference web information systems and mining (WISM), 1:62\u201366","DOI":"10.1109\/WISM.2010.39"},{"key":"337_CR25","first-page":"642","volume":"5589","author":"YY Yao","year":"2009","unstructured":"Yao YY (2009) Three-way decision: an interpretation of rules in rough set theory. Comput Sci 5589:642\u2013649","journal-title":"Comput Sci"},{"issue":"1","key":"337_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/18756891.2011.9727759","volume":"4","author":"HX Li","year":"2011","unstructured":"Li HX, Zhou XZ (2011) Risk decision making based on decision-theoretic rough set: a three-way view decision model. Int J Comput Intell Syst 4(1):1\u201311","journal-title":"Int J Comput Intell Syst"},{"key":"337_CR27","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.ijar.2013.02.010","volume":"55","author":"XY Jia","year":"2014","unstructured":"Jia XY, Tang ZM, Liao WH, Shang L (2014) On an optimization representation of decision-theoretic rough set models. Int J Approx Reason 55:156\u2013166","journal-title":"Int J Approx Reason"},{"key":"337_CR28","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.ins.2009.09.021","volume":"180","author":"YY Yao","year":"2010","unstructured":"Yao YY (2010) Three-way decisions with probabilistic rough sets. Inf Sci 180:341\u2013353","journal-title":"Inf Sci"},{"key":"337_CR29","doi-asserted-by":"crossref","unstructured":"Goethals B, Le Page W, Mampaey M (2010) Mining interesting sets and rules in relational databases. In: Proceedings of the ACM symposium on applied computing, ACM, pp 997\u20131001","DOI":"10.1145\/1774088.1774299"},{"key":"337_CR30","doi-asserted-by":"crossref","unstructured":"Han JW, Pei J, Yin YW (2000) Mining frequent patterns without candidate generation. In: ACM SIGMOD record, ACM, 29:1\u201312","DOI":"10.1145\/342009.335372"},{"key":"337_CR31","doi-asserted-by":"crossref","unstructured":"Cheung D, Lee S, Kao B (1997) A general incremental technique for maintaining discovered association rules. In: Proceedings of 5th international conference on database systems for advanced applications, pp 185\u2013194","DOI":"10.1142\/9789812819536_0020"},{"key":"337_CR32","unstructured":"Thomas S, Bodagala S, Alsabti K, Ranka S (1997) An efficient algorithm for the incremental updation of association rules in large databases. In: Proceedings of 3rd international conference on data mining and knowledge discovery, pp 263\u2013266"},{"key":"337_CR33","doi-asserted-by":"crossref","unstructured":"Veloso AA, Jr Meira W, de Carvalho MB, P\u00f4ssas B, Parthasarathy S, Zaki MJ (2002) Mining frequent itemsets in evolving databases. In: Proceedings of 2nd SIAM international conference on data mining","DOI":"10.1137\/1.9781611972726.29"},{"key":"337_CR34","doi-asserted-by":"crossref","unstructured":"Ayan N, Tansel A, Arkun E (1999) An efficient algorithm to update large itemsets with early pruning. In: Proceeding KDD proceedings of the fifth ACM SIGKDD international conference on knowledge discovery and data mining, pp 287\u2013291","DOI":"10.1145\/312129.312252"},{"key":"337_CR35","doi-asserted-by":"crossref","unstructured":"Lee CH, Lin CR, Chen MS (2001) Sliding-window filtering: an efficient algorithm for incremental mining. In: Proceeding CIKM proceedings of the tenth international conference on information and knowledge management, pp 263\u2013270","DOI":"10.1145\/502585.502630"},{"key":"337_CR36","doi-asserted-by":"crossref","unstructured":"Chang C, Li Y, Lee J (2005) An efficient algorithm for incremental mining of association rules. In: 15th international workshop on research issues in data engineering: stream data mining and applications. RIDE-SDMA, pp 3\u201310","DOI":"10.1109\/RIDE.2005.6"},{"key":"337_CR37","doi-asserted-by":"crossref","unstructured":"Yu H, Wang Y, Jiao P (2014) A three-way decisions approach to density-based overlapping clustering. In: Transactions on rough sets XVIII, pp 92\u2013109","DOI":"10.1007\/978-3-662-45909-6_6"},{"key":"337_CR38","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.ins.2014.02.054","volume":"276","author":"DC Liang","year":"2014","unstructured":"Liang DC, Liu D (2014) Systematic studies on three-way decisions with interval-valued decision-theoretic rough sets. Inf Sci 276:186\u2013203","journal-title":"Inf Sci"},{"key":"337_CR39","unstructured":"UCI: mushroom data set. http:\/\/www.cs.sfu.ca\/wangk\/ucidata\/dataset\/mushroom"},{"key":"337_CR40","unstructured":"UCI: nursery and kdd\\_internet\\_usage data set. http:\/\/repository.seasr.org\/Datasets\/UCI\/arff\/"},{"key":"337_CR41","unstructured":"Olave M, Rajkovic V, Bohanec M (1989) An application for admission in public school systems. Expert Syst Public Adm, pp 145\u2013160"},{"key":"337_CR42","unstructured":"Zupan B, Bohanec M, Bratko I, Demsar J (1997) Machine learning by function decomposition. In: ICML, pp 421\u2013429"},{"key":"337_CR43","unstructured":"Duch W, Adamczak R, Grabczewski K et al (1997) Extraction of crisp logical rules using constrained backpropagation networks"},{"key":"337_CR44","doi-asserted-by":"crossref","unstructured":"Liu HW, Liu L, Zhang HJ (2008) Feature selection using mutual information: an experimental study. In: PRICAI: trends in artificial intelligence. Springer, pp 235\u2013246","DOI":"10.1007\/978-3-540-89197-0_24"},{"key":"337_CR45","unstructured":"Ceglar A, Roddick JF, Powers DM (2007) Curio: a fast outlier and outlier cluster detection algorithm for large datasets. In: Proceedings of the 2nd international workshop on Integrating artificial intelligence and data mining, vol 84. Australian Computer Society, Inc., pp 39\u201347"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0337-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-015-0337-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0337-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0337-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T23:42:46Z","timestamp":1566344566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-015-0337-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,17]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["337"],"URL":"https:\/\/doi.org\/10.1007\/s13042-015-0337-6","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,17]]}}}