{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:29:32Z","timestamp":1725892172939},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540362975"},{"type":"electronic","value":"9783540362999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11795131_16","type":"book-chapter","created":{"date-parts":[[2006,9,26]],"date-time":"2006-09-26T15:48:02Z","timestamp":1159285682000},"page":"107-113","source":"Crossref","is-referenced-by-count":6,"title":["Reduction-Based Approaches Towards Constructing Galois (Concept) Lattices"],"prefix":"10.1007","author":[{"given":"Jingyu","family":"Jin","sequence":"first","affiliation":[]},{"given":"Keyun","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Pei","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Lattice Theory","year":"1973","key":"16_CR1","unstructured":"Birkhoff, B. (ed.): Lattice Theory. American Mathematical Society Colloquium Publ., Providence, RI (1973)"},{"key":"16_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, Dordrecht, Boston (1982)"},{"key":"16_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: Wille, R., et al. (eds.) Algorithms and order, pp. 33\u201358. Kluwer Acad. Publ., Dordrecht (1989)"},{"issue":"6-9","key":"16_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."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, W.X., Wei, L., Qi, J.J.: Attribute Reduction in Concept Lattice Based on Discernibility Matrix. In: Proceedings of the Tenth International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Canada, pp. 157\u2013165 (2005)","DOI":"10.1007\/11548706_17"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Yao, Y.Y.: A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis. In: Proceedings of 4th International Conference on Rough Sets and Current Trends in Computing, Uppsala, Sweden, pp. 59\u201368 (2004)","DOI":"10.1007\/978-3-540-25929-9_6"},{"volume-title":"Two basic algorithms in concept analysis","year":"1984","key":"16_CR7","unstructured":"Ganter, B. (ed.): Two basic algorithms in concept analysis. Technische Hochschule, Darmstadt (1984)"},{"volume-title":"Formal Concept Analysis. Mathematical Foundations","year":"1999","key":"16_CR8","unstructured":"Ganter, B., Wille, R. (eds.): Formal Concept Analysis. Mathematical Foundations. Springer, Berlin (1999)"},{"issue":"2","key":"16_CR9","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":"16_CR10","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":"16_CR11","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":"16_CR12","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":"16_CR13","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"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795131_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:24:00Z","timestamp":1619508240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795131_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540362975","9783540362999"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11795131_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}