{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:49:45Z","timestamp":1725551385488},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119279"},{"type":"electronic","value":"9783642119286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11928-6_1","type":"book-chapter","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T11:21:07Z","timestamp":1270639267000},"page":"1-16","source":"Crossref","is-referenced-by-count":0,"title":["About the Enumeration Algorithms of Closed Sets"],"prefix":"10.1007","author":[{"given":"Alain","family":"G\u00e9ly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raoul","family":"Medina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11671404_8","volume-title":"Formal Concept Analysis","author":"A. Berry","year":"2006","unstructured":"Berry, A., McConnell, R.M., Sigayret, A., Spinrad, J.: Very Fast Instances for Concept Generation. In: Missaoui, R., Schmidt, J. (eds.) Formal Concept Analysis. LNCS (LNAI), vol.\u00a03874, pp. 119\u2013129. Springer, Heidelberg (2006)"},{"key":"1_CR2","first-page":"31","volume":"96","author":"J.P. Bordat","year":"1986","unstructured":"Bordat, J.P.: Calcul pratique du treillis de galois d\u2019une correspondance. Math. Sci. Hum.\u00a096, 31\u201347 (1986)","journal-title":"Math. Sci. Hum."},{"key":"1_CR3","first-page":"33","volume":"90","author":"Y. Cay","year":"1992","unstructured":"Cay, Y., Kong, M.C.: Generating all maximal cliques and related problems for certain perfect graphs. Congressus Numerantium\u00a090, 33\u201355 (1992)","journal-title":"Congressus Numerantium"},{"unstructured":"Chein, M.: Algorithme de recherche de sous-matrice premi\u00e8re d\u2019une matrice. Bull. Math. R. S. Roumanie\u00a013 (1969)","key":"1_CR4"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0166-218X(02)00210-X","volume":"127","author":"E. Diday","year":"2003","unstructured":"Diday, E., Emilion, R.: Maximal and stochastic galois lattices. Discrete Applied Mathematics\u00a0127, 271\u2013284 (2003)","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Emilion, R., Lambert, G., L\u00e9vy, G.: Algorithms for general galois lattice building. Technical report, CERIA, Universit\u00e9 Paris IX Dauphine (2001)","key":"1_CR6"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M.L. Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms\u00a021(3), 618\u2013628 (1996)","journal-title":"Journal of Algorithms"},{"unstructured":"Fu, H.: Algorithmique des Treillis de concepts: Application \u00e1 la fouille de donn\u00e9es. PhD thesis, Universit\u00e9 d\u2019Artois, France (2005)","key":"1_CR8"},{"key":"1_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-540-24651-0_26","volume-title":"Concept Lattices","author":"H. Fu","year":"2004","unstructured":"Fu, H., Fu, H., Njiwoua, P., Mephu Nguifo, E.: A comparative study of fca-based supervised classification algorithms. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol.\u00a02961, pp. 313\u2013320. Springer, Heidelberg (2004)"},{"key":"1_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/978-3-540-24651-0_33","volume-title":"Concept Lattices","author":"H. Fu","year":"2004","unstructured":"Fu, H., Mephu Nguifo, E.: A parallel algorithm to generate formal concepts for large data. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol.\u00a02961, pp. 394\u2013401. Springer, Heidelberg (2004)"},{"unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Technical report, Technische Hoschule Darmstadt (1984)","key":"1_CR11"},{"doi-asserted-by":"crossref","unstructured":"Ganter, B., Reuter, K.: Finding all closed sets: a general approach. Order\u00a08 (1991)","key":"1_CR12","DOI":"10.1007\/BF00383449"},{"unstructured":"Gely, A.: Algorithmique combinatoire: Cliques, Bicliques et syst\u00e8mes implicatifs. PhD Thesis, Universit\u00e9 Blaise Pascal, Clermont-Ferrand, France (2005)","key":"1_CR13"},{"unstructured":"G\u00e9ly, A., Nourine, L.: Algorithmique d\u2019\u00e9num\u00e9ration: Cliques, bicliques, itemset ferm\u00e9s. Revue I3: Information - Interaction - Intelligence, num\u00e9ro Special (Juin 2007)","key":"1_CR14"},{"issue":"7","key":"1_CR15","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1016\/j.dam.2008.10.010","volume":"157","author":"A. G\u00e9ly","year":"2009","unstructured":"G\u00e9ly, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques. Discrete Applied Mathematics\u00a0157(7), 1447\u20131459 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/S009753970240639X","volume":"32","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Gottlob, G., Makino, K.: New results n monotone dualization and generating hypergraph transversals. SIAM J. on Computing\u00a032(2), 514\u2013537 (2003)","journal-title":"SIAM J. on Computing"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters\u00a027, 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"issue":"2\/3","key":"1_CR18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S. Kuznetsov","year":"2002","unstructured":"Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. Journal of Experimental and Theoritical Artificial Intelligence (JETAI)\u00a014(2\/3), 189\u2013216 (2002)","journal-title":"Journal of Experimental and Theoritical Artificial Intelligence (JETAI)"},{"issue":"11","key":"1_CR19","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2007.04.014","volume":"156","author":"S. Kuznetsov","year":"2008","unstructured":"Kuznetsov, S., Obiedkov, S.: Some decision and counting problems of the Duquenne-Guigues basis of implications. Discrete Applied Mathematics\u00a0156(11), 1994\u20132003 (2008)","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Lindig, C.: Fast concept analysis. In: Stumme, G. (ed.) Working with Conceptual Structures - Contributions to ICCS 2000, pp. 235\u2013248 (2000)","key":"1_CR20"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K. Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 260\u2013272. Springer, Heidelberg (2004)"},{"key":"1_CR22","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. Information Processing Letters\u00a071, 199\u2013204 (1999)","journal-title":"Information Processing Letters"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1999)"},{"unstructured":"Pei, J., Han, J., Mao, R.: Closet: an efficient mining algorithm for mining frequent closed itemsets. In: Proc. of ACM-SIGMOD, International Workshop on Data Mining and Knowledge Discovery (DMKD 2000), Dallas (May 2000)","key":"1_CR24"},{"issue":"4","key":"1_CR25","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C. Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial (Gray) codes. SIAM Review\u00a039(4), 605\u2013629 (1997)","journal-title":"SIAM Review"},{"key":"1_CR26","series-title":"LNAI","first-page":"130","volume-title":"ICFCA 2009","author":"B. Sertkaya","year":"2009","unstructured":"Sertkaya, B.: Some Computational Problems Related to Pseudo-intents. In: Ferr\u00e9, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol.\u00a05548, pp. 130\u2013145. Springer, Heidelberg (2009)"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Aiyoshi, M., Shirawaka, I.: A new algorithm for generating all the independent sets. SIAM J. Computing\u00a06, 505\u2013517 (1977)","journal-title":"SIAM J. Computing"},{"unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: Lcm: An efficient algorithm for enumerating frequent closed item sets. In: ICDM 2003 - Proc. of Workshop on Frequent Itemset Mining Implementations, FIMI (2003)","key":"1_CR28"},{"doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: Lcm ver. 2: Efficient mining for algorithms for frequent\/closed\/maximal itemsets. In: ICDM 2004 - Proc. of Workshop on Frequent Itemset Mining Implementations, FIMI (2004)","key":"1_CR29","DOI":"10.1145\/1133905.1133916"},{"doi-asserted-by":"crossref","unstructured":"Valiant, L.: Lcm ver. 2: The complexity of Enumeration and Reliability Problems. SIAM Journal on Computing\u00a08(3) (1979)","key":"1_CR30","DOI":"10.1137\/0208032"},{"doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: Closet+: Searching for the best strategies for mining frequent closed itemsets. In: Proc. of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington D.C. (August 2003)","key":"1_CR31","DOI":"10.1145\/956750.956779"},{"doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: Charm: an efficient algorithm for closed itemset mining. In: 2nd SIAM International Conference on Data Mining, Arlington (April 2002)","key":"1_CR32","DOI":"10.1137\/1.9781611972726.27"},{"issue":"4","key":"1_CR33","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transaction on Knowledge and Data Engineering\u00a017(4), 462\u2013478 (2005)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11928-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:45:29Z","timestamp":1606185929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11928-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119279","9783642119286"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11928-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}