{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:41:31Z","timestamp":1767339691716},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,10]],"date-time":"2018-11-10T00:00:00Z","timestamp":1541808000000},"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":["Pattern Anal Applic"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10044-018-0759-3","type":"journal-article","created":{"date-parts":[[2018,11,10]],"date-time":"2018-11-10T13:26:15Z","timestamp":1541856375000},"page":"113-134","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Rare association rule mining from incremental databases"],"prefix":"10.1007","volume":"23","author":[{"given":"Anindita","family":"Borah","sequence":"first","affiliation":[]},{"given":"Bhabesh","family":"Nath","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,10]]},"reference":[{"key":"759_CR1","doi-asserted-by":"crossref","unstructured":"Adda M, Wu L, Feng Y (2007) Rare itemset mining. In: Sixth international conference on machine learning and applications, ICMLA, IEEE, pp 73\u201380","DOI":"10.1109\/ICMLA.2007.106"},{"key":"759_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: ACM sigmod record, vol 22. ACM, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"759_CR3","unstructured":"Agrawal R, Srikant R et\u00a0al (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large data bases, VLDB, vol 1215, pp 487\u2013499"},{"issue":"1","key":"759_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1026482903537","volume":"12","author":"Y Aumann","year":"1999","unstructured":"Aumann Y, Feldman R, Lipshtat O, Manilla H (1999) Borders: an efficient algorithm for association generation in dynamic databases. J Intell Inf Syst 12(1):61\u201373","journal-title":"J Intell Inf Syst"},{"key":"759_CR5","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1016\/j.procs.2015.07.391","volume":"57","author":"U Bhatt","year":"2015","unstructured":"Bhatt U, Patel P (2015) A novel approach for finding rare items based on multiple minimum support framework. Proc Comput Sci 57:1088\u20131095","journal-title":"Proc Comput Sci"},{"key":"759_CR6","doi-asserted-by":"crossref","unstructured":"Borah A, Nath B (2017) Mining patterns from data streams: an overview. In: International conference on I-SMAC (IoT in social, mobile, analytics and cloud) (I-SMAC), IEEE, pp 371\u2013376","DOI":"10.1109\/I-SMAC.2017.8058373"},{"key":"759_CR7","doi-asserted-by":"crossref","unstructured":"Borah A, Nath B (2017) Mining rare patterns using hyper-linked data structure. In: International conference on pattern recognition and machine intelligence. Springer, pp 467\u2013472","DOI":"10.1007\/978-3-319-69900-4_59"},{"issue":"3\u20134","key":"759_CR8","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1504\/IJKEDM.2017.091018","volume":"4","author":"A Borah","year":"2017","unstructured":"Borah A, Nath B (2017) Rare association rule mining: a systematic review. Int J Knowl Eng Data Min 4(3\u20134):204\u2013258","journal-title":"Int J Knowl Eng Data Min"},{"key":"759_CR9","doi-asserted-by":"crossref","unstructured":"Borah A, Nath B (2018) Fp-tree and its variants: towards solving the pattern mining challenges. In: Proceedings of first international conference on smart system, innovations and computing. Springer, pp 535\u2013543","DOI":"10.1007\/978-981-10-5828-8_51"},{"key":"759_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.eswa.2018.07.010","volume":"113","author":"A Borah","year":"2018","unstructured":"Borah A, Nath B (2018) Identifying risk factors for adverse diseases using dynamic rare association rule mining. Expert Syst Appl 113:233\u2013263","journal-title":"Expert Syst Appl"},{"key":"759_CR11","doi-asserted-by":"crossref","unstructured":"Borah A, Nath B (2019) Performance analysis of tree-based approaches for pattern mining. In: Computational intelligence in data mining. Springer, pp 435\u2013448","DOI":"10.1007\/978-981-10-8055-5_39"},{"key":"759_CR12","doi-asserted-by":"crossref","unstructured":"Cheung DW, Han J, Ng VT, Wong C (1996) Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of the twelfth international conference on data engineering, IEEE, pp 106\u2013114","DOI":"10.1109\/ICDE.1996.492094"},{"key":"759_CR13","doi-asserted-by":"crossref","unstructured":"Cheung DWL, Lee SD, Kao B et al (1997) A general incremental technique for maintaining discovered association rules. In: DASFAA, vol 6, pp 185\u2013194","DOI":"10.1142\/9789812819536_0020"},{"key":"759_CR14","doi-asserted-by":"crossref","unstructured":"Cheung W, Zaiane OR (2003) Incremental mining of frequent patterns without candidate generation or support constraint. In: Proceedings of seventh international database engineering and applications symposium, IEEE, pp 111\u2013116","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"759_CR15","unstructured":"Ezeife CI, Su Y (2002) Mining incremental association rules with generalized fp-tree. In: Conference of the Canadian society for computational studies of intelligence. Springer, pp 147\u2013160"},{"key":"759_CR16","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: ACM sigmod record, vol 29. ACM, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"issue":"1","key":"759_CR17","doi-asserted-by":"publisher","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, 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"},{"issue":"4","key":"759_CR18","doi-asserted-by":"publisher","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"},{"key":"759_CR19","doi-asserted-by":"crossref","unstructured":"Kiran RU, Krishna\u00a0Re P (2009) An improved multiple minimum support based approach to mine rare association rules. In: IEEE symposium on computational intelligence and data mining, CIDM\u201909, IEEE, pp 340\u2013347","DOI":"10.1109\/CIDM.2009.4938669"},{"issue":"1","key":"759_CR20","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ijar.2004.11.006","volume":"40","author":"YC Lee","year":"2005","unstructured":"Lee YC, Hong TP, Lin WY (2005) Mining association rules with multiple minimum supports using maximum constraints. Int J Approx Reason 40(1):44\u201354","journal-title":"Int J Approx Reason"},{"issue":"3","key":"759_CR21","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"CKS Leung","year":"2007","unstructured":"Leung CKS, Khan QI, Li Z, Hoque T (2007) Cantree: a canonical-order tree for incremental frequent-pattern mining. Knowl Inf Syst 11(3):287\u2013311","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"759_CR22","doi-asserted-by":"publisher","first-page":"9498","DOI":"10.1016\/j.eswa.2008.03.014","volume":"36","author":"CW Lin","year":"2009","unstructured":"Lin CW, Hong TP, Lu WH (2009) The pre-fufp algorithm for incremental mining. Expert Syst Appl 36(5):9498\u20139505","journal-title":"Expert Syst Appl"},{"key":"759_CR23","doi-asserted-by":"crossref","unstructured":"Liu B, Hsu W, Ma Y (1999) Mining association rules with multiple minimum supports. In: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 337\u2013341","DOI":"10.1145\/312129.312274"},{"key":"759_CR24","doi-asserted-by":"crossref","unstructured":"Szathmary L, Napoli A, Valtchev P (2007) Towards rare itemset mining. In: 19th IEEE international conference on tools with artificial intelligence, ICTAI 2007, IEEE, vol\u00a01, pp 305\u2013312","DOI":"10.1109\/ICTAI.2007.30"},{"key":"759_CR25","doi-asserted-by":"crossref","unstructured":"Troiano L, Scibelli G, Birtolo C (2009) A fast algorithm for mining rare itemsets. In: 2009 Ninth international conference on intelligent systems design and applications, IEEE, pp 1149\u20131155","DOI":"10.1109\/ISDA.2009.55"},{"key":"759_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-23544-3_21","volume-title":"International conference on data warehousing and knowledge discovery","author":"S Tsang","year":"2011","unstructured":"Tsang S, Koh YS, Dobbie G (2011) RP-Tree: rare pattern tree mining. In: International conference on data warehousing and knowledge discovery. Springer, Berlin, pp 277\u2013288"},{"key":"759_CR27","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-47887-6_34","volume-title":"Pacific-Asia conference on knowledge discovery and data mining","author":"K Wang","year":"2002","unstructured":"Wang K, Tang L, Han Liu, J (2002) Top down fp-growth for association rule mining. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, pp 334\u2013340"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-018-0759-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-018-0759-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-018-0759-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T15:09:19Z","timestamp":1581001759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-018-0759-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,10]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["759"],"URL":"https:\/\/doi.org\/10.1007\/s10044-018-0759-3","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,10]]},"assertion":[{"value":"16 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}