T. Kohonen, Self-organizing Maps, 2001.

Y. Demchenko, P. Grosso, C. De-laat, and P. Membrey, Addressing big data issues in scientific data infrastructure, Collaboration Technologies and Systems (CTS), 2013 International Conference on, pp.48-55, 2013.

M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma et al., Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing, Proceedings of the 9th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2012, pp.15-28, 2012.

M. Ester, H. Kriegel, J. Sander, and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), pp.226-231, 1996.

C. Charu, C. K. Aggarwal, and . Reddy, Data Clustering: Algorithms and Applications, 2014.

J. Han, J. Pei, and M. Kamber, Data mining: concepts and techniques, 2011.

B. S. Everitt, S. Landau, and M. Leese, Cluster Analysis, p.9780340761199, 2009.

J. R. Mashey, Big data and the next wave of infrastress problems, solutions, opportunities, 1998.

W. Fan and A. Bifet, Mining big data: current status, and forecast to the future, ACM sIGKDD Explorations Newsletter, vol.14, issue.2, pp.1-5, 2013.

D. Laney, 3D data management: Controlling data volume, velocity, and variety, 2001.

J. Gantz and D. Reinsel, Extracting value from chaos, IDC iview, vol.1142, pp.1-12, 2011.

S. Ghemawat, H. Gobioff, and S. Leung, The google file system

, In ACM SIGOPS operating systems review, vol.37, pp.29-43, 2003.

M. Burrows, The chubby lock service for loosely-coupled distributed systems, Proceedings of the 7th symposium on Operating systems design and implementation, pp.335-350, 2006.

D. Borthakur, The hadoop distributed file system: Architecture and design, vol.11, p.21, 2007.

J. Dean and S. Ghemawat, Mapreduce: simplified data processing on large clusters, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008.

M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, Spark: Cluster computing with working sets, Proceedings of the 2Nd USENIX Conference on Hot Topics in Cloud Computing, HotCloud'10, pp.10-10, 2010.

K. Anil, R. C. Jain, and . Dubes, Algorithms for Clustering Data, 1988.

S. Kaski, J. Kangas, and T. Kohonen, Bibliography of self-organizing map (som) papers: 1981-1997, Neural computing surveys, vol.1, pp.102-350, 1998.

S. Haykin, Neural Networks: A Comprehensive Foundation, 1998.

T. Kohonen, M. R. Schroeder, and T. S. Huang, Self-Organizing Maps

T. Martinetz and K. Schulten, A "Neural-Gas, Network Learns Topologies. Artificial Neural Networks, vol.I, pp.397-402, 1991.

B. Fritzke, Unsupervised clustering with growing cell structures, Proceedings of the International Joint Conference on Neural Networks, pp.531-536

, IEEE, 1991.

B. Fritzke, A growing neural gas network learns topologies, NIPS, pp.625-632, 1994.

O. Beyer and P. Cimiano, Online semi-supervised growing neural gas, Int. J. Neural Syst, vol.22, issue.5, 2012.

A. Amini, Y. W. Teh, and H. Saboohi, On density-based data streams clustering algorithms: A survey, J. Comput. Sci. Technol, vol.29, issue.1, pp.116-141, 2014.

C. Fraley and A. E. Raftery, How many clusters? which clustering method? answers via model-based cluster analysis, The computer journal, vol.41, issue.8, pp.578-588, 1998.

P. Arthur, N. M. Dempster, D. Laird, and . Rubin, Maximum likelihood from incomplete data via the em algorithm, Journal of the royal statistical society. Series B (methodological), pp.1-38, 1977.

G. Mclachlan and T. Krishnan, The EM algorithm and extensions, vol.382, 2007.

A. E. Attar, A. Pigeau, and M. Gelgon, Robust estimation of a global gaussian mixture by decentralized aggregations of local models, Web Intelligence and Agent Systems, vol.11, issue.3, pp.245-262, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00794452

A. E. and A. , Estimation robuste des modèles de mélange sur des données distribuées. Theses, 2012.

R. Lämmel, Google's mapreduce programming model-revisited, Science of computer programming, vol.70, issue.1, pp.1-30, 2008.

E. Januzaj, H. Kriegel, and M. Pfeifle, Dbdc: Density based distributed clustering, Advances in Database Technology-EDBT 2004, pp.88-105, 2004.

T. Sarazin, H. Azzag, and M. Lebbah, SOM clustering using spark-mapreduce, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, pp.1727-1734, 2014.

W. Zhao, H. Ma, and Q. He, Parallel k-means clustering based on mapreduce, Cloud computing, pp.674-679, 2009.

K. Shvachko, H. Kuang, S. Radia, and R. Chansler, The hadoop distributed file system, Mass Storage Systems and Technologies (MSST), 2010 IEEE 26th Symposium on, pp.1-10, 2010.

Y. He, H. Tan, and W. Luo, Mrdbscan: a scalable mapreduce-based dbscan algorithm for heavily skewed data, Shengzhong Feng, and Jianping Fan, vol.8, pp.83-99, 2014.

A. Seyed-shirkhorshidi, S. Aghabozorgi, Y. Teh, T. Wah, and . Herawan, Big data clustering: a review, Computational Science and Its Applications-ICCSA 2014, pp.707-720, 2014.

S. Abhinandan, M. Das, A. Datar, S. Garg, and . Rajaram, Google news personalization: scalable online collaborative filtering, Proceedings of the 16th international conference on World Wide Web, pp.271-280, 2007.

H. Cui, J. Wei, and W. Dai, Parallel implementation of expectationmaximization for fast convergence

A. Basak, I. Brinster, and O. J. Mengshoel, Mapreduce for bayesian network parameter learning using the em algorithm, Proc. of Big Learning: Algorithms, Systems and Tools, 2012.

B. Bahmani, B. Moseley, A. Vattani, R. Kumar, and S. Vassilvitskii, Scalable k-means++, Proceedings of the VLDB Endowment, vol.5, pp.622-633, 2012.

A. Ene, S. Im, and B. Moseley, Fast clustering using mapreduce, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.681-689, 2011.

G. Govaert, Classification croisée, 1983.

A. Abdullah and A. Hussain, A new biclustering technique based on crossing minimization, Neurocomputing, vol.69, issue.16, pp.1882-1896, 2006.

G. Govaert and M. Nadif, Un modèle de mélange pour la classification croisée d'un tableau de données continue, CAP'09, 11e conférence sur l'apprentissage artificiel, pp.287-302, 2009.

B. Kwon and H. Cho, Scalable co-clustering algorithms, International Conference on Algorithms and Architectures for Parallel Processing, pp.32-43, 2010.

W. Ayadi, M. Elloumi, and J. Hao, Pattern-driven neighborhood search for biclustering of microarray data, BMC bioinformatics, vol.13, issue.7, p.1, 2012.

F. Olivetti-de-frança, G. Palermo-coelho, and F. Zuben, Predicting missing values with biclustering: A coherence-based approach, Pattern Recognition, vol.46, issue.5, pp.1255-1266, 2013.

J. A. Hartigan, Direct clustering of a data matrix, Journal of the American Statistical Association, vol.67, issue.337, pp.123-129

A. Tanay, R. Sharan, and R. Shamir, Discovering statistically significant biclusters in gene expression data, Proceedings of ISMB 2002, pp.136-144, 2002.

D. Greene and P. Cunningham, Spectral co-clustering for dynamic bipartite graphs, Workshop on dynamic networks and knowledge discovery at ecml'10, 2010.

H. Shan, ,. , and A. Banerjee, Residual bayesian co-clustering for matrix approximation, SDM, pp.223-234, 2010.

F. Angiulli, E. Cesario, and C. Pizzuti, A greedy search approach to co-clustering sparse binary matrices, ICTAI, pp.363-370, 2006.

M. Charrad, Y. Lechevallier, G. Saporta, and M. Ahmed, Le bipartitionnement: Etat de l'art sur les approches et les algorithmes, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01125575

X. Jollois, Contribution de la classification automatiqueà la Fouille de Données, 2003.

P. Arthur, N. M. Dempster, D. Laird, and . Rubin, Maximum likelihood from incomplete data via the em algorithm, Journal of the royal statistical society. Series B (methodological), pp.1-38, 1977.

T. Kohonen, M. R. Schroeder, and T. S. Huang, Self-Organizing Maps

S. Busygin, G. Jacobsen, E. Kremer, and C. Ag, Double conjugated clustering applied to leukemia microarray data, 2nd SIAM ICDM, Workshop on clustering high dimensional data, 2002.

M. Cottrell, S. Ibbou, and P. Letrémy, Som-based algorithms for qualitative variables, Neural Netw, vol.17, issue.8-9, pp.1149-1167, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00107960

K. Benabdeslem and K. Allab, Bi-clustering continuous data with self-organizing map, Neural Computing and Applications, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00874676

J. Caldas and S. Kaski, Hierarchical generative biclustering for microrna expression analysis, Journal of Computational Biology, vol.18, issue.3, pp.251-261, 2011.

Y. Dq-mao, J. H. Luo, J. Zhang, and . Zhu, A new strategy of cooperativity of biclustering and hierarchical clustering: A case of analyzing yeast genomic microarray datasets, Front. Biosci, vol.10, pp.1619-1627, 2005.

G. Getz, E. Levine, and . Domany, Coupled two-way clustering analysis of gene microarray data, Proceedings of the National Academy of Sciences of the United States of America, vol.97, pp.12079-12084, 2000.

G. Getz, E. Levine, E. Domany, and M. Q. Zhang, Super paramagnetic clustering of yeast gene expression profiles, 2000.

Y. Cheng and G. M. Church, Biclustering of expression data, 2000.

A. Ben-dor, B. Chor, R. Karp, and Z. Yakhini, Discovering local structure in gene expression data: the order-preserving submatrix problem, Journal of computational biology, vol.10, issue.3-4, pp.373-384, 2003.

L. Lazzeroni and A. Owen, Plaid models for gene expression data, Statistica Sinica, vol.12, pp.61-86, 2000.

B. Long, (. Zhongfei, ). Mark, P. S. Zhang, and . Yu, Co-clustering by block value decomposition, Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, KDD '05, pp.635-640, 2005.

J. Yoo and S. Choi, Orthogonal nonnegative matrix tri-factorization for co-clustering: Multiplicative updates on stiefel manifolds, Inf. Process. Manage, vol.46, issue.5, pp.559-570, 2010.

L. Labiod and M. Nadif, Co-clustering under nonnegative matrix tri-factorization, Proceedings of the 18th international conference on Neural Information Processing -Volume Part II, ICONIP'11, pp.709-717, 2011.

F. Shang, L. C. Jiao, and F. Wang, Graph dual regularization non-negative matrix factorization for co-clustering, Pattern Recogn, vol.45, issue.6, pp.2237-2250, 2012.

D. D. Lee and H. S. Seung, Learning the parts of objects by non-negative matrix factorization, Nature, vol.401, p.788, 1999.

S. Boyd and L. Vandenberghe, Convex optimization. Cambridge university press, 2004.

K. Raphaël and . Freitas, K-théorie réelle des variétés de Stiefel sans torsion, vol.1, 1985.

A. K. Jain, M. N. Murty, and P. J. Flynn, Data clustering: a review, ACM Comput. Surv, vol.31, issue.3, pp.264-323, 1999.

M. Charikar, C. Chekuri, T. Feder, and R. Motwani, Incremental clustering and dynamic information retrieval, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, STOC '97, pp.626-635, 1997.

R. Matthew-mccutchen and S. Khuller, Streaming algorithms for kcenter clustering with outliers and with anonymity, Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RAN-DOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, APPROX '08 / RANDOM '08, pp.165-178, 2008.

L. Parsons, E. Haque, and H. Liu, Subspace clustering for high dimensional data: a review, SIGKDD Explor. Newsl, vol.6, issue.1, pp.90-105, 2004.

H. Kriegel, P. Kröger, and A. Zimek, Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering, ACM Trans. Knowl. Discov. Data, vol.3, issue.1, 2009.

Z. Lv, Y. Hu, H. Zhong, J. Wu, B. Li et al., Parallel k-means clustering of remote sensing images based on mapreduce, Proceedings of the 2010 international conference on Web information systems and mining, WISM'10, pp.978-981, 2010.

C. Lin, Y. Yang, and T. Rutayisire, A parallel cop-kmeans clustering algorithm based on mapreduce framework, Knowledge Engineering and Management, vol.123, pp.93-102, 2011.

J. Dean and S. Ghemawat, Mapreduce: simplified data processing on large clusters, Commun. ACM, vol.51, issue.1, pp.107-113, 2008.

A. Ene, S. Im, and B. Moseley, Fast clustering using mapreduce, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pp.681-689, 2011.

J. Seung, A. Sul, and . Tovchigrechko, Parallelizing blast and som algorithms with mapreduce-mpi library, IPDPS Workshops'11, pp.481-489, 2011.

C. Robson-leonardo-ferreira-cordeiro, . Traina, A. Junior, J. Traina, U. López et al., Clustering very large multi-dimensional datasets with mapreduce, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pp.690-698, 2011.

A. Ghoting, P. Kambadur, E. Pednault, and R. Kannan, Nimble: a toolkit for the implementation of parallel data mining and machine learning algorithms on mapreduce, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pp.334-342, 2011.

J. Howard, S. Karloff, S. Suri, and . Vassilvitskii, A model of computation for mapreduce, SODA'10, pp.938-948, 2010.

M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, Spark: cluster computing with working sets, Proceedings of the 2nd USENIX conference on Hot topics in cloud computing, HotCloud'10, pp.10-10, 2010.

M. Varsta, J. Heikkonen, J. Lampinen, J. Del, and R. Millán, Temporal kohonen map and the recurrent self-organizing map: Analytical and experimental comparison, Neural Process. Lett, vol.13, pp.237-251, 2001.

G. Malewicz, M. H. Austern, J. Aart, J. C. Bik, I. Dehnert et al., Pregel: A system for large-scale graph processing, Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD '10, pp.135-146, 2010.

Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola et al., Distributed graphlab: A framework for machine learning and data mining in the cloud, Proc. VLDB Endow, vol.5, issue.8, pp.716-727, 2012.

A. Frank and A. Asuncion, Uci machine learning repository, School of Information and Computer Sciences, 2010.

J. A. Hartigan, Direct Clustering of a Data Matrix, Journal of the American Statistical Association, vol.67, issue.337, pp.123-129, 1972.

D. Daniel, H. S. Lee, and . Seung, Learning the parts of objects by nonnegative matrix factorization, Nature, vol.401, pp.788-791, 1999.

G. Govaert and M. Nadif, Block clustering with Bernoulli mixture models: Comparison of different approaches, Computational Statistics and Data Analysis, vol.52, pp.3233-3245, 2008.

R. Priam, M. Nadif, and G. Govaert, The block generative topographic mapping, The Third International Workshop on Artificial Neural Networks in Pattern Recognition, Lecture Notes in Artificial Intelligence (LNCS), number 5064, pp.13-23, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01915820

E. R. Sparks, A. Talwalkar, V. Smith, J. Kottalam, X. Pan et al., Mli: An api for distributed machine learning, 2013.

A. Strehl, J. Ghosh, and C. Cardie, Cluster ensembles -a knowledge reuse framework for combining multiple partitions, Journal of Machine Learning Research, vol.3, pp.583-617, 2002.

T. J. Hastie, R. J. Tibshirani, and J. J. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer series in statistics