乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:05:39Z","timestamp":1725897939166},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298912"},{"type":"electronic","value":"9783642298929"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29892-9_26","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T16:34:23Z","timestamp":1340642063000},"page":"292-308","source":"Crossref","is-referenced-by-count":24,"title":["Distributed Formal Concept Analysis Algorithms Based on an Iterative MapReduce Framework"],"prefix":"10.1007","author":[{"given":"Biao","family":"Xu","sequence":"first","affiliation":[]},{"given":"Ruair\u00ed","family":"de Fr\u00e9in","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Robson","sequence":"additional","affiliation":[]},{"given":"M\u00edche\u00e1l","family":"\u00d3 Foghl\u00fa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Wille, R.: Restructuring Lattice Theory: an Approach Based on Hierarchies of Concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. Reidel (1982)","DOI":"10.1007\/978-94-009-7798-3_15"},{"key":"26_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11528784_10","volume-title":"Formal Concept Analysis","author":"L. Lakhal","year":"2005","unstructured":"Lakhal, L., Stumme, G.: Efficient Mining of Association Rules Based on Formal Concept Analysis. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol.\u00a03626, pp. 180\u2013195. Springer, Heidelberg (2005)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Polaillon, G., Aufaure, M.-A., Le Grand, B., Soto, M.: FCA for Contextual Semantic Navigation and Information Retrieval in Heterogeneous Information Systems. In: DEXA Workshops 2007, pp. 534\u2013539 (2007)","DOI":"10.1109\/DEXA.2007.147"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Sn\u00e1sel, V., Horak, Z., Kocibova, J., Abraham, A.: Analyzing Social Networks Using FCA: Complexity Aspects. In: Web Intelligence\/IAT Workshops 2009, pp. 38\u201341 (2009)","DOI":"10.1109\/WI-IAT.2009.225"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Caspard, N., Monjardet, B.: The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey. Discrete Applied Mathematics, 241\u2013269 (2003)","DOI":"10.1016\/S0166-218X(02)00209-3"},{"key":"26_CR6","doi-asserted-by":"publisher","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, Heidelberg (1999)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Ekanayake, J., Li, H., Zhang, B., Gunarathne, T., Bae, S.-H., Qiu, J., Fox, G.: Twister: a Runtime for Iterative MapReduce. In: Hariri, S., Keahey, K. (eds.) HPDC, pp. 810\u2013818. ACM (2010)","DOI":"10.1145\/1851476.1851593"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-11928-6_22","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"2010","unstructured":"Ganter, B.: Two Basic Algorithms in Concept Analysis. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol.\u00a05986, pp. 312\u2013340. Springer, Heidelberg (2010)"},{"key":"26_CR9","unstructured":"Lindig, C.: Fast Concept Analysis. In: Working with Conceptual Structures-Contributions to ICCS, pp. 235\u2013248 (2000)"},{"issue":"5","key":"26_CR10","first-page":"11","volume":"27","author":"S.O. Kuznetsov","year":"1993","unstructured":"Kuznetsov, S.O.: A Fast Algorithm for Computing All Intersections of Objects in a Finite Semi-Lattice. Automatic Documentation and Mathematical Linguistics\u00a027(5), 11\u201321 (1993)","journal-title":"Automatic Documentation and Mathematical Linguistics"},{"key":"26_CR11","unstructured":"Andrews, S.: In-Close, a Fast Algorithm for Computing Formal Concepts. In: The Seventeenth International Conference on Conceptual Structures (2009)"},{"key":"26_CR12","unstructured":"Vychodil, V.: A New Algorithm for Computing Formal Concepts. Cybernetics and Systems, 15\u201321 (2008)"},{"key":"26_CR13","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Parallel Recursive Algorithm for FCA. In: CLA 2008, vol.\u00a0433, pp. 71\u201382. CLA (2008)"},{"key":"26_CR14","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\u00e9matiques et Sciences Humaines\u00a096, 31\u201347 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10472-007-9063-4","volume":"49","author":"A. Berry","year":"2006","unstructured":"Berry, A., Bordat, J.-P., Sigayret, A.: A Local Approach to Concept Generation. Ann. Math. Artif. Intell.\u00a049(1), 117\u2013136 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S.O. Kuznetsov","year":"2002","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Comparing Performance of Algorithms for Generating Concept Lattices. J. Exp. Theor. Artif. Intell.\u00a014, 189\u2013216 (2002)","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"2","key":"26_CR17","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. Roum. Math. Pures et Appl.\u00a023(2), 243\u2013250 (1978)","journal-title":"Rev. Roum. Math. Pures et Appl."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1006\/jmps.1993.1003","volume":"37","author":"C.E. Dowling","year":"1993","unstructured":"Dowling, C.E.: On the Irredundant Generation of Knowledge Spaces. J. Math. Psychol.\u00a037, 49\u201362 (1993)","journal-title":"J. Math. Psychol."},{"key":"26_CR19","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, 246\u2013267 (1995)","journal-title":"Computational Intelligence"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Carpineto, C., Romano, G.: A Lattice Conceptual Clustering System and Its Application to Browsing Retrieval. Machine Learning, 95\u2013122 (1996)","DOI":"10.1007\/BF00058654"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Valtchev, P., Missaoui, R., Lebrun, P.: A Partition-based Approach Towards Constructing Galois (concept) Lattices. Discrete Mathematics, 801\u2013829 (2002)","DOI":"10.1016\/S0012-365X(02)00349-7"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/WCSE.2009.301","volume-title":"Proceedings of the 2009 WRI World Congress on Software Engineering, WCSE 2009","author":"Y. Yu","year":"2009","unstructured":"Yu, Y., Qian, X., Zhong, F., Li, X.-R.: An Improved Incremental Algorithm for Constructing Concept Lattices. In: Proceedings of the 2009 WRI World Congress on Software Engineering, WCSE 2009, vol.\u00a004, pp. 401\u2013405. IEEE Computer Society, Washington, DC (2009)"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-03915-7_29","volume-title":"Advances in Intelligent Data Analysis VIII","author":"P. Krajca","year":"2009","unstructured":"Krajca, P., Vychodil, V.: Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, J.-F. (eds.) IDA 2009. LNCS, vol.\u00a05772, pp. 333\u2013344. Springer, Heidelberg (2009)"},{"key":"26_CR24","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplified Data Processing on Large Clusters. In: OSDI, p.\u00a013 (2004)"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Chu, C.T., Kim, S.K., Lin, Y.A., Yu, Y., Bradski, G.R., Ng, A.Y., Olukotun, K.: Map-Reduce for Machine Learning on Multicore. In: Sch\u00f6lkopf, B., Platt, J.C., Hoffman, T. (eds.) NIPS, pp. 281\u2013288. MIT Press (2006)","DOI":"10.7551\/mitpress\/7503.003.0040"}],"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-29892-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T02:28:47Z","timestamp":1714098527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29892-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298912","9783642298929"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29892-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}