{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:49:50Z","timestamp":1725572990931},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245254"},{"type":"electronic","value":"9783540322627"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32262-7_12","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T20:48:08Z","timestamp":1292878088000},"page":"176-191","source":"Crossref","is-referenced-by-count":21,"title":["Formal Concept Analysis Constrained by Attribute-Dependency Formulas"],"prefix":"10.1007","author":[{"given":"Radim","family":"B\u011blohl\u00e1vek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladim\u00edr","family":"Sklen\u00e1\u0159","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"12_CR1","first-page":"283","volume":"33","author":"R. B\u011blohl\u00e1vek","year":"2004","unstructured":"B\u011blohl\u00e1vek, R., Sklen\u00e1\u0159, V., Zacpal, J.: Formal concept analysis with hierarchically ordered attributes. Int. J. General Systems\u00a033(4), 283\u2013294 (2004)","journal-title":"Int. J. General Systems"},{"key":"12_CR2","unstructured":"B\u011blohl\u00e1vek, R., Sklen\u00e1\u0159, V., Zacpal, J.: Concept lattices constrained by equivalence relations. In: Proc. CLA 2004, Ostrava, Czech Republic, pp. 58\u201366 (2004)"},{"key":"12_CR3","volume-title":"Automatische Klassifikation","author":"H.H. Bock","year":"1974","unstructured":"Bock, H.H.: Automatische Klassifikation. Vandenhoeck & Ruprecht, G\u00f6ttingen (1974)"},{"key":"12_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58625-5","volume-title":"Knowledge Spaces","author":"J.-P. Diognon","year":"1999","unstructured":"Diognon, J.-P., Falmagne, J.-C.: Knowledge Spaces. Springer, Berlin (1999)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Everitt, B.S.: Cluster Analysis, Arnold, E. (ed.) 4th edn. (2001)","DOI":"10.1007\/978-1-4757-3285-6_20"},{"key":"12_CR6","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, Berlin (1999)"},{"key":"12_CR7","volume-title":"Proceedings of ICCS 2001","author":"W. Ganter","year":"2001","unstructured":"Ganter, W.: Contextual attribute logic. In: Tepfenhart, W., Cyre, W. (eds.) Proceedings of ICCS 2001. Springer, Heidelberg (2001)"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","volume":"11","author":"R. Godin","year":"1995","unstructured":"Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence\u00a011(2), 246\u2013267 (1995)","journal-title":"Computational Intelligence"},{"key":"12_CR9","volume-title":"Rough Sets, Fuzzy Sets, and Knowledge Discovery. Proc. of the Intern. Workshop RSKD 1993","author":"R.E. Kent","year":"1994","unstructured":"Kent, R.E.: Rough concept analysis. In: Ziarko, W.P. (ed.) Rough Sets, Fuzzy Sets, and Knowledge Discovery. Proc. of the Intern. Workshop RSKD 1993. Springer, London (1994)"},{"key":"12_CR10","volume-title":"The Theory of Relational Databases","author":"D. Maier","year":"1983","unstructured":"Maier, D.: The Theory of Relational Databases. Computer Science Press, Rockville (1983)"},{"key":"12_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-24651-0_31","volume-title":"Concept Lattices","author":"F.J. Merwe Van der","year":"2004","unstructured":"Van der Merwe, F.J., Obiedkov, S., Kourie, D.G.: AddIntent: A new incremental lattice construction algorithm. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol.\u00a02961, pp. 372\u2013385. Springer, Heidelberg (2004)"},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1090\/S0002-9947-1944-0010555-7","volume":"55","author":"O. Ore","year":"1944","unstructured":"Ore, O.: Galois connections. Trans. Amer. Math. Soc.\u00a055, 493\u2013513 (1944)","journal-title":"Trans. Amer. Math. Soc."},{"key":"12_CR13","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)"},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. Reidel, Dordrecht (1982)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32262-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:34:58Z","timestamp":1605760498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32262-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245254","9783540322627"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32262-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}