{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:45Z","timestamp":1725490245323},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540747413"},{"type":"electronic","value":"9783540747420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74742-0_34","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:03:30Z","timestamp":1187679810000},"page":"359-370","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Computation of Closed Itemsets and Implication Rule Bases"],"prefix":"10.1007","author":[{"given":"Jean Fran\u00e7ois","family":"Djoufak Kengue","sequence":"first","affiliation":[]},{"given":"Petko","family":"Valtchev","sequence":"additional","affiliation":[]},{"given":"Cl\u00e9mentin","family":"Tayou Djamegni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2001","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 1st edn. Morgan Kaufmann Publishers, San Francisco, California, USA (2001)","edition":"1"},{"key":"34_CR2","volume-title":"KDD 2003","author":"J. Wang","year":"2003","unstructured":"Wang, J., Han, J., Pei, J.: Closet+: searching for the best strategies for mining frequent closed itemsets. In: KDD 2003. Proceedings of the ninth ACM SIGKDD, ACM Press, New York (2003)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.J.: Charm: An efficient algorithm for closed itemset mining. In: Proceedings of the Second SIAM International Conference on Data Mining, SIAM (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"34_CR4","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1997","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1997)"},{"key":"34_CR5","first-page":"5","volume":"95","author":"V. Duquenne","year":"1986","unstructured":"Duquenne, V., Guigues, J.L.: Famille minimale d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Sociales\u00a095, 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Sociales"},{"key":"34_CR6","first-page":"95","volume":"24","author":"C. Carpineto","year":"1996","unstructured":"Carpineto, C., Romano, G.: A lattice conceptual clustering system and its application to browsing retrieval. Mach. Learn.\u00a024, 95\u2013122 (1996)","journal-title":"Mach. Learn."},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Inf. Syst.\u00a024, 25\u201346 (1999)","journal-title":"Inf. Syst."},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"M.J. Zaki","year":"1999","unstructured":"Zaki, M.J.: Parallel and distributed association mining: A survey. IEEE Concurrency\u00a07, 14\u201325 (1999)","journal-title":"IEEE Concurrency"},{"key":"34_CR9","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Technical Report Preprint 831, Technische Hochschule, Darmstadt, Germany (1984)"},{"key":"34_CR10","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 Math.\u00a0256, 801\u2013829 (2002)","journal-title":"Discrete Math."},{"key":"34_CR11","unstructured":"Valtchev, P., Duquenne, V.: Towards scalable divide-and-conquer methods for computing concepts and implications. Preprint accepted to Discrete Applied Mathematics (2006)"},{"key":"34_CR12","series-title":"Lecture Notes in Artificial Intelligence","first-page":"249","volume-title":"Formal Concept Analysis","author":"J.F.K. Djoufak","year":"2005","unstructured":"Djoufak, J.F.K., Valtchev, P., Djamegni, C.T.: A parallel algorithm for lattice construction. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol.\u00a03403, pp. 249\u2013264. Springer, Heidelberg (2005)"},{"key":"34_CR13","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"1990","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)"},{"key":"34_CR14","unstructured":"Maier, D.: The Theory of Relational Databases. Computer Science Press (1983)"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Armstrong, W.W.: Dependency structures of data base relationships. In: IFIP Congress, pp. 580\u2013583 (1974)","DOI":"10.1515\/9783110840308-026"},{"key":"34_CR16","unstructured":"Goetz, S.: Algorithms in cgm, bsp and bsp* model: A survey. Technical report, Carleton Unviversity, Ottawa (1997)"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0218195996000241","volume":"6","author":"F. Dehne","year":"1996","unstructured":"Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable parallel computational geometry for coarse grained multicomputers. Journal of Computational Geometry and Applications\u00a06, 379\u2013400 (1996)","journal-title":"Journal of Computational Geometry and Applications"},{"key":"34_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1312-3","volume-title":"Using the STL: the C++ standard template library","author":"R. Robson","year":"2000","unstructured":"Robson, R.: Using the STL: the C++ standard template library, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"34_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7056.001.0001","volume-title":"Using MPI: Portable Parallel Programming with the Message Passing Interface","author":"W. Gropp","year":"1999","unstructured":"Gropp, W., Lusk, E., Skjellum, A.: Using MPI: Portable Parallel Programming with the Message Passing Interface, 2nd edn. MIT Press, Cambridge, MA (1999)","edition":"2"},{"key":"34_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.4218\/etrij.99.0199.0204","volume":"21","author":"H.K. Parka","year":"1999","unstructured":"Parka, H.K., Chi, D.H., Lee, D.K., Ryu, K.W.: An efficient parallel algorithm for merging in the postal model. ETRI Journal\u00a021, 31\u201339 (1999)","journal-title":"ETRI Journal"},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.jpdc.2003.04.002","volume":"64","author":"C.T. Djamegni","year":"2004","unstructured":"Djamegni, C.T.: Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays. J. Parallel Distrib. Comput.\u00a064, 345\u2013359 (2004)","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74742-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:33:02Z","timestamp":1556775182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74742-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540747413","9783540747420"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74742-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}