{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:39:47Z","timestamp":1725565187713},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220640"},{"type":"electronic","value":"9783540247753"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_78","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T19:48:20Z","timestamp":1284148100000},"page":"659-669","source":"Crossref","is-referenced-by-count":0,"title":["Conceptual Mining of Large Administrative Health Data"],"prefix":"10.1007","author":[{"given":"Tatiana","family":"Semenova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Hegland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warwick","family":"Graco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"78_CR1","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2001","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2001)"},{"key":"78_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, Dallas, Texas, USA, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"78_CR3","volume-title":"Beasley Python Essential Reference","author":"M. David","year":"2000","unstructured":"David, M.: Beasley Python Essential Reference. New Riders Publishing, Indianapolis (2000)"},{"key":"78_CR4","unstructured":"Commonwealth Department of Human Services and Health, Medicare Benefits Schedule Book. Australian Government Publishing Service, Canberra (2000)"},{"key":"78_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proceedings of the, ACM SIGMOD Conference, Washigton DC, USA (1994)","DOI":"10.1145\/170035.170072"},{"key":"78_CR6","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. IBM Almaden Research Center, San Jose, CA (1994)"},{"key":"78_CR7","doi-asserted-by":"crossref","unstructured":"Hegland, M.: Data Mining Techniques, ANU, Canberra (2000)","DOI":"10.1017\/S0962492901000058"},{"key":"78_CR8","unstructured":"Edward, B.: Episodes of Care, ProfSoft Inc., Cambridge, Massachusets, USA (1999)"},{"key":"78_CR9","unstructured":"Semenova, T., Hegland, M., Graco, W., Williams, G.: Effectiveness of Mining Association Rules in Large Health Databases. CalPoly: Technical Report No.CPSLOCSC- 01-03. In: ICDM 2001: Workshop on Integrating Data Mining and Knowledge Management, San Jose, California (2001)"},{"key":"78_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical foundations. Springer, Heidelberg (1999)"},{"issue":"95","key":"78_CR11","first-page":"5","volume":"24","author":"V. Duquenne","year":"1986","unstructured":"Duquenne, V., Guiges, J.-L.: Famille minimale d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math. et Sci.Hum.\u00a024(95), 5\u201318 (1986)","journal-title":"Math. et Sci.Hum."},{"key":"78_CR12","doi-asserted-by":"crossref","unstructured":"Pasquir, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proc. ICDT Conf., pp. 398\u2013416 (1999)","DOI":"10.1007\/3-540-49257-7_25"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24775-3_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:06:07Z","timestamp":1558289167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}