{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:07:22Z","timestamp":1751342842409,"version":"3.41.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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 Combinatorial Optimization"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1023\/a:1009889601723","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"81-94","source":"Crossref","is-referenced-by-count":2,"title":["Medical Surveillance, Frequent Sets, and Closure Operations"],"prefix":"10.1007","volume":"5","author":[{"given":"Alan P.","family":"Sprague","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen E.","family":"Brossette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"314552_CR1","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo, \u201cFast discovery of association rules,\u201d in U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy (Eds.), Advances in Knowledge Discovery and Data Mining, AAAI Press, 1996, pp. 307-328."},{"key":"314552_CR2","unstructured":"R. Agrawal and R. Srikant, \u201cFast algorithms for mining association rules,\u201d in Proc. 20th VLDB Conf., 1994."},{"key":"314552_CR3","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1145\/2157.322404","volume":"30","author":"G. Ausiello","year":"1983","unstructured":"G. Ausiello, A. D'Atri, and D. Sacca, \u201cGraph algorithms for functional dependency manipulation,\u201d J. Assn. Comput. Mach., vol. 30, pp. 752-766, 1983.","journal-title":"J. Assn. Comput. Mach."},{"key":"314552_CR4","unstructured":"R. Bayardo, \u201cBrute-force mining of high-confidence classification rules,\u201d in Proc. Third Intl. Conf. Knowledge Discovery Data Mining, 1997, pp. 123-126."},{"key":"314552_CR5","doi-asserted-by":"crossref","unstructured":"R. Bayardo, \u201cEfficiently mining long patterns from databases,\u201d in Proc. ACM SIGMOD Conf. Mgmt. Data, 1998, pp. 85-93.","DOI":"10.1145\/276304.276313"},{"key":"314552_CR6","unstructured":"G. Birkhoff, Lattice Theory, Amer. Math. Soc., 1967."},{"key":"314552_CR7","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J.D. Ullman, and S. Tsur, \u201cDynamic itemset counting and implication rules for market basket data,\u201d in Proc. ACM SIGMOD Conf. Mgmt. Data, 1997, pp. 255-264.","DOI":"10.1145\/253262.253325"},{"key":"314552_CR8","unstructured":"S.E. Brossette, W.T. Jones, A.P. Sprague, and S.A. Moser, \u201cAdata mining system for infection control surveillance,\u201d Methods of Information in Medicine, accepted."},{"key":"314552_CR9","doi-asserted-by":"crossref","unstructured":"S.E. Brossette and A.P. Sprague, \u201cFrequent sets in the presence of clones: An example from medical surveillance,\u201d in Discrete Problems with Medical Applications, J. Wang (Ed.), Amer. Math. Soc., pp. 165-169, 2000.","DOI":"10.1090\/dimacs\/055\/12"},{"key":"314552_CR10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1136\/jamia.1998.0050373","volume":"5","author":"S.E. Brossette","year":"1998","unstructured":"S.E. Brossette, A.P. Sprague, J.M. Hardin, K.B. Waites, W.T. Jones, and S.A. Moser, \u201cAssociation rules and data mining in hospital infection control and public health surveillance,\u201d J. Amer. Medical Informatics Assn., vol. 5, pp. 373-381, 1998.","journal-title":"J. Amer. Medical Informatics Assn."},{"key":"314552_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(86)90092-7","volume":"48","author":"W. Marek","year":"1986","unstructured":"W. Marek and H. Rasiowa, \u201cApproximating sets with equivalence relations,\u201d Theor. Computer Sci., vol. 48, pp. 145-152, 1986.","journal-title":"Theor. Computer Sci."},{"key":"314552_CR12","unstructured":"C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1982."},{"key":"314552_CR13","unstructured":"J. Pfaltz and R. Jamison, \u201cClosure systems and their structure,\u201d in Proceedings of the Workshop on Relational Methods in Computer Science, Elsevier, 2000."},{"key":"314552_CR14","unstructured":"A. Savasere, E. Omiecinski, and S. Navathe, \u201cAn efficient algorithm for mining association rules in large databases,\u201d in Proc. Intl. Conf. Very Large Data Bases, 1995, pp. 432-444."},{"key":"314552_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0195-6698(86)80033-6","volume":"7","author":"P. Vaterlind","year":"1986","unstructured":"P. Vaterlind, \u201cClutters and semimatroids,\u201d Eur. J. Combinatorics, vol. 7, pp. 271-282, 1986.","journal-title":"Eur. J. Combinatorics"},{"key":"314552_CR16","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1006\/aima.1994.1069","volume":"108","author":"M. Wild","year":"1994","unstructured":"M. Wild, \u201cA theory of finite closure spaces based on implications,\u201d Advances in Math., vol. 108, pp. 118-139, 1994.","journal-title":"Advances in Math."},{"key":"314552_CR17","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1109\/32.9058","volume":"14","author":"C.C. Yang","year":"1988","unstructured":"C.C. Yang, G. Li, and P. Ng, \u201cAn improved algorithm based on subset closures for synthesizing a relational database scheme,\u201d IEEE Trans. Software Engg., vol. 14, pp. 1731-1737, 1988.","journal-title":"IEEE Trans. Software Engg."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009889601723.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009889601723\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009889601723.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:12:07Z","timestamp":1751281927000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009889601723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["314552"],"URL":"https:\/\/doi.org\/10.1023\/a:1009889601723","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}