{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:43Z","timestamp":1725512023547},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797203"},{"type":"electronic","value":"9783540797210"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79721-0_63","type":"book-chapter","created":{"date-parts":[[2008,5,12]],"date-time":"2008-05-12T10:22:49Z","timestamp":1210587769000},"page":"460-466","source":"Crossref","is-referenced-by-count":0,"title":["An Approach for Constructing Concept Lattices"],"prefix":"10.1007","author":[{"given":"Yutian","family":"Zhong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keyun","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengjiang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"63_CR1","unstructured":"Birkhoff, B.: (revised edition): Lattice Theory, vol. 25. American Mathematical Society Colloquium Publ., Providence, RI (1973)"},{"key":"63_CR2","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 the lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. Reidel, Boston (1982)"},{"key":"63_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-94-009-2639-4_2","volume-title":"Algorithms and order","author":"R. Wille","year":"1989","unstructured":"Wille, R.: Lattices in data analysis: how to draw them with a computer. In: Algorithms and order, pp. 33\u201358. Kluwer Acad. Publ., Dordrecht (1989)"},{"issue":"6-9","key":"63_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0898-1221(92)90120-7","volume":"23","author":"R. Wille","year":"1992","unstructured":"Wille, R.: Concepe lattices and conceptual knowledge systems. Comput. Math. Apll.\u00a023(6-9), 493\u2013515 (1992)","journal-title":"Comput. Math. Apll."},{"volume-title":"Two basic algorithms in concept analysis","year":"1984","key":"63_CR5","unstructured":"Ganter, B. (ed.): Two basic algorithms in concept analysis. Technische Hochschule, Darmstadt (1984)"},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R. (eds.): Formal Concept Analysis. Mathematical Foundations. Springer, Berlin (1999)","DOI":"10.1007\/978-3-642-59830-2"},{"issue":"2","key":"63_CR7","first-page":"243","volume":"23","author":"E.M. Norris","year":"1978","unstructured":"Norris, E.M.: An algorithm for computing the maximal rectangles in a binary relation. Rev. Roumaine Math. Pures Appl.\u00a023(2), 243\u2013250 (1978)","journal-title":"Rev. Roumaine Math. Pures Appl."},{"key":"63_CR8","first-page":"31","volume":"96","author":"J.P. Bordat","year":"1986","unstructured":"Bordat, J.P.: Calcul pratique du treillis de Galois d\u2019une correspondance. Mat. Sci. Hum.\u00a096, 31\u201347 (1986)","journal-title":"Mat. Sci. Hum."},{"issue":"2","key":"63_CR9","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":"63_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0020-0190(99)00108-8","volume":"71","author":"L. Nourine","year":"1999","unstructured":"Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Inform. Process. Lett.\u00a071, 199\u2013204 (1999)","journal-title":"Inform. Process. Lett."},{"key":"63_CR11","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/S0012-365X(02)00349-7","volume":"256","author":"P. Valtchev","year":"2002","unstructured":"Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards constructing Galois (concept) lattices. Discrete Mathematics\u00a0256, 801\u2013829 (2002)","journal-title":"Discrete Mathematics"},{"key":"63_CR12","series-title":"Lecture Notes in Artificial Intelligence","first-page":"107","volume-title":"Rough Sets and Knowledge Technology","author":"J. Jingyu","year":"2006","unstructured":"Jingyu, J., Keyun, Q., Zheng, P.: Reduction-based approaches towards constructing Galois (concept) lattices. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS (LNAI), vol.\u00a04062, pp. 107\u2013113. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79721-0_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:29:40Z","timestamp":1619508580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79721-0_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797203","9783540797210"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79721-0_63","relation":{},"subject":[]}}