{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:39:44Z","timestamp":1725489584400},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540737285"},{"type":"electronic","value":"9783540737292"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73729-2_17","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T06:31:26Z","timestamp":1187591486000},"page":"174-184","source":"Crossref","is-referenced-by-count":3,"title":["Trees in Concept Lattices"],"prefix":"10.1007","author":[{"given":"Radim","family":"Belohlavek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"De Baets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Outrata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vilem","family":"Vychodil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","DOI":"10.1142\/1930","volume-title":"Clustering and Classification","author":"P. Arabie","year":"1996","unstructured":"Arabie, P., Hubert, L.J., DeSoete, G.: Clustering and Classification. World Scientific, Singapore (1996)"},{"key":"17_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/978-3-540-32262-7_12","volume-title":"Formal Concept Analysis","author":"R. Belohlavek","year":"2005","unstructured":"Belohlavek, R., Sklenar, V.: Formal concept analysis constrained by attribute-dependency formulas. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol.\u00a03403, pp. 176\u2013191. Springer, Heidelberg (2005)"},{"key":"17_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11787181_10","volume-title":"Conceptual Structures: Inspiration and Application","author":"R. Belohlavek","year":"2006","unstructured":"Belohlavek, R., Vychodil, V.: Formal concept analysis with constraints by closure operators. In: Sch\u00e4rfe, H., Hitzler, P., \u00d8hrstr\u00f8m, P. (eds.) ICCS 2006. LNCS (LNAI), vol.\u00a04068, pp. 131\u2013143. Springer, Heidelberg (2006)"},{"key":"17_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/0470011297","volume-title":"Concept Data Analysis. Theory and Applications","author":"C. Carpineto","year":"2004","unstructured":"Carpineto, C., Romano, G.: Concept Data Analysis. Theory and Applications. J.\u00a0Wiley, Chichester (2004)"},{"key":"17_CR5","volume-title":"Cluster Analysis","author":"B.S. Everitt","year":"2001","unstructured":"Everitt, B.S., Landau, S., Leese, M.: Cluster Analysis, 4th edn. Oxford University Press, New York (2001)","edition":"4"},{"key":"17_CR6","unstructured":"Ganter, B.: Begriffe und Implikationen, manuscript (1998)"},{"key":"17_CR7","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)"},{"key":"17_CR8","unstructured":"Gratzer, G.A.: General Lattice Theory. 2nd edn. Birkhauser (1998)"},{"key":"17_CR9","unstructured":"Grimaldi, R.P.: Discrete and Combinatorial Mathematics, 5th edn. Pearson Education (2002)"},{"key":"17_CR10","first-page":"5","volume":"95","author":"J.-L. Guigues","year":"1986","unstructured":"Guigues, J.-L., Duquenne, V.: Familles minimales d\u2019implications informatives resultant d\u2019un tableau de donn\u00e9es binaires. Math. Sci. Humaines\u00a095, 5\u201318 (1986)","journal-title":"Math. Sci. Humaines"},{"issue":"2\/3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S.O. Kuznetsov","year":"2002","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intelligence\u00a014(2\/3), 189\u2013216 (2002)","journal-title":"J. Exp. Theor. Artif. Intelligence"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","first-page":"152","volume-title":"Conceptual Structures: Logical, Linguistic, and Computational Issues","author":"C. Lindig","year":"2000","unstructured":"Lindig, C.: Fast concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol.\u00a01867, pp. 152\u2013161. Springer, Heidelberg (2000)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"M.J. Zaki","year":"2004","unstructured":"Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery\u00a09, 223\u2013248 (2004)","journal-title":"Data Mining and Knowledge Discovery"}],"container-title":["Lecture Notes in Computer Science","Modeling Decisions for Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73729-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T21:10:55Z","timestamp":1550869855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73729-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540737285","9783540737292"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73729-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}