{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T06:12:30Z","timestamp":1781763150339,"version":"3.54.5"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Intelligent Information Systems"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1023\/a:1026482903537","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T16:45:40Z","timestamp":1068137140000},"page":"61-73","source":"Crossref","is-referenced-by-count":30,"title":["Borders: An Efficient Algorithm for Association Generation in Dynamic Databases"],"prefix":"10.1007","volume":"12","author":[{"given":"Yonatan","family":"Aumann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronen","family":"Feldman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Orly","family":"Lipshtat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heikki","family":"Manilla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"206545_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, A., Imielinski, T., and Swami, A. (1993). Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD Conference on Management of Data (pp. 207\u2013216).","DOI":"10.1145\/170036.170072"},{"key":"206545_CR2","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, I. (1995). Fast Discovery of Association Rules. In U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy (Eds.), Advances in Knowledge Discovery and Data Mining (pp. 307\u2013328). AAAI Press."},{"key":"206545_CR3","unstructured":"Agrawal, A. and Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the VLDB Conference. Santiago, Chile."},{"key":"206545_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R. and Srikant, R. (1995). Mining sequential patterns. Proc. of the Int'l Conference on Data Engineering (ICDE). Taipei, Taiwan.","DOI":"10.1109\/ICDE.1995.380415"},{"key":"206545_CR5","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Han, J., Ng, V., and Wong, C.Y. (1996). Maintenance of discovered association rules in large databases: An incremental updating techniques. Proc. 12th IEEE International Conference on Data Engineering (ICDE-96). New Orleans, Louisiana, U.S.A.","DOI":"10.1109\/ICDE.1996.492094"},{"key":"206545_CR6","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Lee, S.D., and Kao, B. (1997). A general incremental technique for updating discovered association rules. Proc. International Conference On Database Systems for Advanced Applications (DASFAA-97). Melbourne, Australia.","DOI":"10.1142\/9789812819536_0020"},{"key":"206545_CR7","unstructured":"Fayyad, U., Piatetsky-Shapiro, G., Smyth, P., and Uthurusamy, R. (1995). Advances in Knowledge Discovery and Data Mining, AAAI Press."},{"key":"206545_CR8","unstructured":"Feldman, R., Amir, A., Aumann, Y., Zilberstein, A., and Hirsh, H. (1997). Incremental algorithms for association generation. In Proceedings of the 1st Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD97). Singapore."},{"key":"206545_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, R., Fresko, M., Kinar, Y., Liphstat, O., Schler, Y., Rajman, M., and Zamir, O. (1998). Text Mining at the Term Level. Department of computer science technical report. Bar Ilan University.","DOI":"10.1007\/BFb0094806"},{"key":"206545_CR10","doi-asserted-by":"crossref","unstructured":"Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., and Verkamo, A. (1994). Finding interesting rules from large sets of discovered association rules. In Proceedings of the 3rd International Conference on Information and Knowledge Management.","DOI":"10.1145\/191246.191314"},{"issue":"3","key":"206545_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H. and Toivonen, H. (1997). Levelwise Search and Borders of Theories in Knowledge Discovery, Data Mining and Knowledge Discovery, 1(3), 241\u2013258.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"206545_CR12","unstructured":"Mannila, H., Toivonen, H., and Verkamo, A. (1994). Efficient algorithms for discovering association rules. In Proceedings of KDD94: AAAI Workshop on Knowledge Discovery in Databases (pp. 181\u2013192)."},{"key":"206545_CR13","unstructured":"Savasere, A., Omiecinski, E., Navathe, S. (1995). An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st VLDB Conference. Zurich, Switzerland."},{"key":"206545_CR14","doi-asserted-by":"crossref","unstructured":"Srikant, R. and Agrawal, R. (1996). Mining quantitative association rules in large relational tables. In Proceedings of the ACM SIGMOD Conference on Management of Data. Montreal, Canada.","DOI":"10.1145\/233269.233311"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026482903537.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026482903537\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026482903537.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:19:01Z","timestamp":1749219541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026482903537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["206545"],"URL":"https:\/\/doi.org\/10.1023\/a:1026482903537","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}