{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T03:51:25Z","timestamp":1760586685096,"version":"3.40.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T00:00:00Z","timestamp":1401408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10472-014-9418-6","type":"journal-article","created":{"date-parts":[[2014,5,29]],"date-time":"2014-05-29T20:05:33Z","timestamp":1401393933000},"page":"45-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation"],"prefix":"10.1007","volume":"72","author":[{"given":"Anne","family":"Berry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Gutierrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marianne","family":"Huchard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amedeo","family":"Napoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Sigayret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,30]]},"reference":[{"key":"9418_CR1","unstructured":"Aboud, N., Ar\u00e9valo, G., Bendavid, O., Falleri, J.-R., Haderer, N., Huchard, M., Tibermacine, C., Urtado, C., Vauttier, S.: Building hierarchical typed component directories using formal concept analysis. Submitted (2014)"},{"key":"9418_CR2","first-page":"166","volume-title":"ICFCA, Volume 4390 of Lecture Notes in Computer Science","author":"G Ar\u00e9valo","year":"2007","unstructured":"Ar\u00e9valo, G., Berry, A., Huchard, M., Perrot, G., Sigayret, A.: Performances of Galois sub-hierarchy-building algorithms. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA, Volume 4390 of Lecture Notes in Computer Science, pp 166\u2013180. Springer, Berlin (2007)"},{"key":"9418_CR3","volume-title":"Ordre et Classification \u2013 Alg\u00e8bre et Combinatoire","author":"M Barbut","year":"1970","unstructured":"Barbut, M., Monjardet, B.: Ordre et Classification \u2013 Alg\u00e8bre et Combinatoire. Hachette, Paris (1970)"},{"issue":"1\u20134","key":"9418_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10472-007-9063-4","volume":"49","author":"A Berry","year":"2007","unstructured":"Berry, A., Bordat, J.P., Sigayret, A.: A local approach to concept generation. Ann. Math. Artif. Intell. 49(1\u20134), 117\u2013136 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9418_CR5","first-page":"208","volume-title":"ICFCA, Volume 3403 of Lecture Notes in Computer Science","author":"A Berry","year":"2005","unstructured":"Berry, A., Huchard, M., McConnell, R.M., Sigayret, A., Spinrad, J.P.: Efficiently computing a linear extension of the sub-hierarchy of a concept lattice. In: Ganter, B., Godin, R. (eds.) ICFCA, Volume 3403 of Lecture Notes in Computer Science, pp 208\u2013222. Springer, Berlin (2005)"},{"key":"9418_CR6","first-page":"13","volume-title":"OOIS Workshops, Volume 2426 of Lecture Notes in Computer Science","author":"A Berry","year":"2002","unstructured":"Berry, A., Sigayret, A.: Maintaining class membership information. In: Bruel, J.-M., Bellahsene, Z. (eds.) OOIS Workshops, Volume 2426 of Lecture Notes in Computer Science, pp 13\u201323. Springer, Berlin (2002)"},{"key":"9418_CR7","first-page":"31","volume":"96","author":"JP Bordat","year":"1986","unstructured":"Bordat, J.P.: Calcul pratique du treillis de Galois d\u2019une correspondance. Math. Inform. Sci. Hum. 96, 31\u201347 (1986)","journal-title":"Math. Inform. Sci. Hum."},{"key":"9418_CR8","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: Aho, A.V. (ed.) STOC, pp. 1\u20136. ACM (1987)","DOI":"10.1145\/28395.28396"},{"key":"9418_CR9","unstructured":"Dicky, H., Dony, C., Huchard, M., Libourel, T.: Ares, un algorithme d\u2019ajout avec restructuration dans les hi\u00e9rarchies de classes. In: Proceedings of LMO\u201994, pp. 125\u2013136 (1994)"},{"key":"9418_CR10","unstructured":"Dicky, H., Dony, C., Huchard, M., Libourel, T.: ARES, adding a class and REStructuring inheritance hierarchies. In: Proceedings of BDA\u201995, pp. 25\u201342 (1995)"},{"key":"9418_CR11","doi-asserted-by":"crossref","unstructured":"Dicky, H., Dony, C., Huchard, M., Libourel, T.: On automatic class insertion with overloading. In: Anderson, L., Coplien, J. (eds.) OOPSLA, pp. 251\u2013267. ACM (1996)","DOI":"10.1145\/236338.236364"},{"key":"9418_CR12","unstructured":"Dolques, X., Le Ber, F., Huchard, M.: AOC-Posets: a scalable alternative to concept lattices for relational concept analysis. In: Proceedings of the Tenth International Conference on Concept Lattices and Their Applications (CLA 2013), pp. 129\u2013140 (2013)"},{"issue":"1\u20134","key":"9418_CR13","first-page":"195","volume":"75","author":"D Dubois","year":"2007","unstructured":"Dubois, D., Dupin de Saint Cyr Bannay, F., Prade, H.: A possibilty-theoretic view of formal concept analysis. Fundam. Inform. 75(1\u20134), 195\u2013213 (2007)","journal-title":"Fundam. Inform."},{"issue":"1\u20132","key":"9418_CR14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s11787-011-0039-0","volume":"6","author":"D Dubois","year":"2012","unstructured":"Dubois, D., Prade, H.: From Blanch\u00e9\u2019s hexagonal organization of concepts to formal concept analysis and possibility theory. Log. Universalis 6(1\u20132), 149\u2013169 (2012)","journal-title":"Log. Universalis"},{"key":"9418_CR15","unstructured":"Eschen, E.M., Pinet, N., Sigayret, A.: Consecutive-ones: handling lattice planarity efficiently. In: Proceedings of CLA 2007 (Concept Lattices and Applications), CEUR WS, vol. 331, paper 12 (2007)"},{"key":"9418_CR16","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":"9418_CR17","doi-asserted-by":"crossref","unstructured":"Godin, R., Mili, H.: Building and maintaining analysis-level class hierarchies using galois lattices. In: Proceedings of OOPSLA \u201993, vol. 28, pp. 394\u2013410 (1993)","DOI":"10.1145\/165854.165931"},{"issue":"2","key":"9418_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/(SICI)1096-9942(1998)4:2<117::AID-TAPO6>3.0.CO;2-Q","volume":"4","author":"R Godin","year":"1998","unstructured":"Godin, R., Mili, H., Mineau, G.W., Missaoui, R., Arfi, A., Chau, T.-T.: Design of class hierarchies based on concept (Galois) lattices. Theory Appl. Object Syst. 4(2), 117\u2013134 (1998)","journal-title":"Theory Appl. Object Syst."},{"key":"9418_CR19","doi-asserted-by":"crossref","unstructured":"Hitzler, P.: Default reasoning over domains and concept hierarchies. In: Proceedings of KI 2004, Volume 3238 of LNCS, pp. 351\u2013365. Springer (2004)","DOI":"10.1007\/978-3-540-30221-6_27"},{"issue":"3","key":"9418_CR20","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1137\/S0097539792224814","volume":"28","author":"W-L Hsu","year":"1999","unstructured":"Hsu, W.-L., Ma, T.-H.: Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs. SIAM J. Comput. 28(3), 1004\u20131020 (1999)","journal-title":"SIAM J. Comput."},{"key":"9418_CR21","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1051\/ita:2000129","volume":"34","author":"M Huchard","year":"2000","unstructured":"Huchard, M., Dicky, H., Leblanc, H.: Galois lattice as a framework to specify algorithms building class hierarchies. Theory Inform. Appl. 34, 521\u2013548 (2000)","journal-title":"Theory Inform. Appl."},{"key":"9418_CR22","unstructured":"Leblanc, H.: Sous-hi\u00e9rarchies de Galois: un Mod\u00e8le pour la Construction et L\u2019\u00e9volution des Hi\u00e9rarchies d\u2019objets (in french). PhD thesis, Universit\u00e9 Montpellier II (2000)"},{"key":"9418_CR23","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1109\/CSMR.2007.40","volume-title":"Proceedings of the 11th European Conference on Software Maintenance and Reengineering","author":"F Loesch","year":"2007","unstructured":"Loesch, F., Ploedereder, E.: Restructuring variability in software product lines using concept analysis of product configurations. In: Krikhaar, R.L., Verhoef, C., Lucca, G.A.D. (eds.) Proceedings of the 11th European Conference on Software Maintenance and Reengineering, pp 159\u2013170. IEEE, Amsterdam (2007)"},{"issue":"5","key":"9418_CR24","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/0216057","volume":"16","author":"A Lubiw","year":"1987","unstructured":"Lubiw, A.: Doubly lexical orderings of matrices. SIAM J. Comput. 16(5), 854\u2013879 (1987)","journal-title":"SIAM J. Comput."},{"key":"9418_CR25","doi-asserted-by":"crossref","unstructured":"Mineau, G.W., Gecsei, J., Godin, R.: Structuring knowledge bases using automatic learning. In: ICDE, pp. 274\u2013280. IEEE Computer Society (1990)","DOI":"10.1109\/ICDE.1990.113478"},{"key":"9418_CR26","unstructured":"Osswald, R., Petersen, W.: Induction of classifications from linguistic data. In: Proceedings of ECAI\u201902 Workshop on Advances in Formal Concept Analysis for Knowledge Discovery in Databases (2002)"},{"key":"9418_CR27","doi-asserted-by":"crossref","unstructured":"Osswald, R., Petersen, W.: A logical approach to data-driven classification. In: Proceedings of the 26th Annual German Conference on Advances in Artificial Intelligence KI 2003, Volume 2821 of LNCS, pp. 267\u2013281. Springer (2003)","DOI":"10.1007\/978-3-540-39451-8_20"},{"issue":"6","key":"9418_CR28","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition algorithms refinement. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"9418_CR29","doi-asserted-by":"crossref","unstructured":"Petersen, W.: A set-theoretical approach for the induction of inheritance hierarchies. In: Proceedings of the Joint Conference on Formal Grammar and Mathematics of Language (FG\/MOL-01), Electronic Notes in Theoretical in Computer Science, vol. 53, pp. 296\u2013308. Elsevier (2001)","DOI":"10.1016\/S1571-0661(05)82590-3"},{"issue":"1","key":"9418_CR30","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10472-012-9329-3","volume":"67","author":"M Rouane-Hacene","year":"2013","unstructured":"Rouane-Hacene, M., Huchard, M., Napoli, A., Valtchev, P.: Relational concept analysis: mining concept lattices from multi-relational data. Ann. Math. Artif. Intell. 67(1), 81\u2013108 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9418_CR31","doi-asserted-by":"crossref","unstructured":"Ryssel, U., Ploennigs, J., Kabitzsch, K.: Extraction of feature models from formal contexts. In: Schaefer, I., John, I., Schmid, K. (eds.) SPLC Workshops, p. 4. ACM (2011)","DOI":"10.1145\/2019136.2019141"},{"key":"9418_CR32","unstructured":"Sigayret, A.: Data mining: une approche par les graphes (in french). PhD thesis, Universit\u00e9 Blaise Pascal (Clermont-Ferrand, France) (2002)"},{"issue":"5","key":"9418_CR33","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","volume":"45","author":"JP Spinrad","year":"1993","unstructured":"Spinrad, J.P.: Doubly lexical ordering of dense 0-1 matrices. Inf. Process. Lett. 45(5), 229\u2013235 (1993)","journal-title":"Inf. Process. Lett."},{"key":"9418_CR34","doi-asserted-by":"crossref","DOI":"10.1090\/fim\/019","volume-title":"Efficient Graph Representations","author":"JP Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representations. American Mathematical Society (AMS), Paris (2003)"},{"key":"9418_CR35","doi-asserted-by":"crossref","unstructured":"Xue, Y., Xing, Z., Jarzabek, S.: Feature location in a collection of product variants. In: Proceedings of the 19th Working Conference on Reverse Engineering, pp. 145\u2013154. IEEE (2012)","DOI":"10.1109\/WCRE.2012.24"},{"key":"9418_CR36","doi-asserted-by":"crossref","unstructured":"Yang, Y., Peng, X., Zhao, W.: Domain feature model recovery from multiple applications using data access semantics and formal concept analysis. In: Zaidman, A., Antoniol, G., Ducasse, S. (eds.) Proceedings of the 16th Working Conference on Reverse Engineering, pp. 215\u2013224. IEEE (2009)","DOI":"10.1109\/WCRE.2009.15"},{"key":"9418_CR37","first-page":"59","volume-title":"Rough Sets and Current Trends in Computing, Volume 3066 of Lecture Notes in Computer Science","author":"Y Yao","year":"2004","unstructured":"Yao, Y.: A comparative study of formal concept analysis and rough set theory in data analysis. In: Tsumoto, S., Slowinski, R., Komorowski, H.J., Grzymala-Busse, J.W. (eds.) Rough Sets and Current Trends in Computing, Volume 3066 of Lecture Notes in Computer Science, pp 59\u201368. Springer, Berlin (2004)"},{"key":"9418_CR38","unstructured":"Yevtushenko, S.A.: System of data analysis \u201cConcept Explorer\u201d (In Russian). In: Proceedings of the 7th National Conference on Artificial Intelligence KII-2000, Russia, pp. 127\u2013134 (2000)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-014-9418-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-014-9418-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-014-9418-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:59:17Z","timestamp":1746248357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-014-9418-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,30]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9418"],"URL":"https:\/\/doi.org\/10.1007\/s10472-014-9418-6","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2014,5,30]]}}}