{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:07:16Z","timestamp":1762520836407,"version":"3.30.2"},"reference-count":31,"publisher":"Informa UK Limited","issue":"2-3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1080\/09528130210164198","type":"journal-article","created":{"date-parts":[[2003,1,7]],"date-time":"2003-01-07T04:46:38Z","timestamp":1041914798000},"page":"115-142","source":"Crossref","is-referenced-by-count":48,"title":["Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory"],"prefix":"10.1080","volume":"14","author":[{"given":"Petko","family":"Valtchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rokia","family":"Missaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Godin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Meridji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Agrawal R.","year":"1995"},{"key":"CIT0002","unstructured":"Agrawal, R. and Srikant, R. Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94). Santiago, Chile. pp.487\u2013499."},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"Ayan, N., Tansel, A. and Arkun, M. An efficient algorithm to update large itemsets with early pruning. In Proceedings, KDD-99. San Diego, CA. pp.287\u2013291.","DOI":"10.1145\/312129.312252"},{"volume-title":"Ordre et Classification: Alg\u00e8bre et combinatoire","year":"1970","author":"Barbut M.","key":"CIT0004"},{"key":"CIT0005","doi-asserted-by":"crossref","unstructured":"Bayardo, R. and Agrawal, R. Mining the most interesting rules. Proceedings, KDD-99. San Diego, CA. pp.145\u2013154.","DOI":"10.1145\/312129.312219"},{"key":"CIT0006","doi-asserted-by":"crossref","unstructured":"Cheung, D. W., Han, J., Ng, V. and Wong, C. Maintenance of discovered association rules in large databases: an incremental updating technique. Proceedings. ICDE-96. New Orleans, LA. pp.106\u2013114.","DOI":"10.1109\/ICDE.1996.492094"},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"Cheung, D. W., Lee, S. D. and Kao, B. A general incremental technique for maintaining discovered association rules. Proceedings, DASFAA-97. Melbourne, Australia. pp.185\u2013194.","DOI":"10.1142\/9789812819536_0020"},{"volume-title":"Introduction to lattice and order","year":"1992","author":"Davey B. A.","key":"CIT0008"},{"key":"CIT0009","unstructured":"Feldman, R., Aumann, Y., Amir, A. and Mannila, H. Efficient algorithms for discovering frequent sets in incremental databases. Proceedings, ACM SIGMOD Workshop DMKD-97. Tucson, AZ. pp.59\u2013790."},{"key":"CIT0010","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis. Mathematical Foundations","author":"Ganter B.","year":"1999"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90195-3"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1995.tb00031.x"},{"key":"CIT0013","first-page":"5","volume":"95","author":"Guigues J.","year":"1986","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1145\/360402.360421"},{"key":"CIT0015","volume-title":"Sorting and Searching","volume":"3","author":"Knuth D. E.","year":"1998"},{"key":"CIT0016","first-page":"35","volume":"29","author":"Luxenburger M.","year":"1991","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"volume-title":"The Theory of Relational Databases","year":"1983","author":"Maier D.","key":"CIT0017"},{"key":"CIT0018","unstructured":"Mannila, H., Toivonen, H. and Verkamo, A. Efficient algorithms for discovering association rules. Proceedings, AAAI Workshop KDD-94. Seattle, WA. pp.181\u2013192."},{"key":"CIT0019","unstructured":"Pasquier, N. Extraction de bases pour les r\u00e8gles d'association \u00e0 partir des itemsets ferm\u00e9s fr\u00e9quents. Proceedings, INFORSID-00. Lyon, France. pp.56\u201377."},{"key":"CIT0020","unstructured":"Pasquier, N., Bastide, Y., Taouil, T. and Lakhal, L. Closed set based discovery of small covers for association rules. Proceedings. BDA-99. Bordeaux, France. pp.371\u2013381."},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"CIT0022","unstructured":"Pei, J., Han, J. and Mao, R. CLOSET: an efficient algorithm for mining frequent closed itemsets. Proceedings, ACM SIGMOD Workshop DMKD '00. Dallas, TX. pp.21\u201330."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(00)00021-1"},{"key":"CIT0024","doi-asserted-by":"crossref","unstructured":"Taouil, R., Pasquier, N., Bastide, Y. and Lakhal, L. Mining bases for association rules using closed sets. Proceedings, ICDE-00. San Diego, CA. pp.307","DOI":"10.1109\/ICDE.2000.839424"},{"key":"CIT0025","unstructured":"Thomas, S., Bodagala, S., Alsabti, K. and Ranka, S. An efficient algorithm for theincremental updation of association rules in large databases. Proceedings. KDD-97. New Port Beach, CA. pp.263\u2013266."},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1111\/0824-7935.00082"},{"key":"CIT0027","doi-asserted-by":"crossref","unstructured":"Valtchev, P. and Missaoui, R. Building concept (Galois) lattices from parts: generalizing the incremental methods. Proceedings, ICCS-01. Stanford, CA. vol. 2120, pp.290\u2013303.","DOI":"10.1007\/3-540-44583-8_21"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00349-7"},{"key":"CIT0029","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"Wille R.","year":"1982"},{"key":"CIT0030","doi-asserted-by":"crossref","unstructured":"Zaki, M. Generating non-redundant association rules. Proceedings, KDD-00. Boston, MA. pp.34\u201343.","DOI":"10.1145\/347090.347101"},{"key":"CIT0031","series-title":"RPI Technical Report 99-10","volume-title":"ChARM: an efficient algorithm for closed association rule mining","author":"Zaki M.","year":"1999"}],"container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/09528130210164198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T12:58:34Z","timestamp":1733921914000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/09528130210164198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["10.1080\/09528130210164198"],"URL":"https:\/\/doi.org\/10.1080\/09528130210164198","relation":{},"ISSN":["0952-813X","1362-3079"],"issn-type":[{"type":"print","value":"0952-813X"},{"type":"electronic","value":"1362-3079"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}