{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T08:05:44Z","timestamp":1778054744035,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540748267","type":"print"},{"value":"9783540748274","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74827-4_151","type":"book-chapter","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T23:35:16Z","timestamp":1189553716000},"page":"1214-1221","source":"Crossref","is-referenced-by-count":6,"title":["Data Mining of Time-Series Medical Data by Formal Concept Analysis"],"prefix":"10.1007","author":[{"given":"Kenji","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"Okubo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Haraguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susumu","family":"Kunifuji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"151_CR1","doi-asserted-by":"publisher","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)"},{"key":"151_CR2","unstructured":"Haraguchi, M., Okubo, Y.: An extended branchand-bound search algorithm for finding top-n formal concepts of documents. In: Proc. of the 4th Workshop on Learning with Logics and Logics for Learning, pp. 41\u201347 (2006)"},{"key":"151_CR3","volume-title":"Active Mining","year":"2002","unstructured":"Motoda, H. (ed.): Active Mining. IOS Press, Amsterdam, Holland (2002)"},{"key":"151_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"E. Tomita","year":"2003","unstructured":"Tomita, E., Seki, T.: An efficient branch and bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 278\u2013289. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74827-4_151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T13:44:13Z","timestamp":1550929453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74827-4_151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540748267","9783540748274"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74827-4_151","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}