Nphardness of euclidean sum-of-squares clustering, Machine Learning, 2009. ,
Heuristic algorithms for the unconstrained binary quadratic programming problem, Management School, Imperial College, vol.4, 1998. ,
Nonnegative factorization and the maximum edge biclique problem, In CORE Discusssion paper, 2008. ,
DOI : 10.1007/s10898-013-0053-2
Adaptive memory Tabu search for binary quadratic programs, Management Science, vol.44, 1998. ,
Efficient algorithms for vairance-based k-clustering, Proceedings of the first Pacific conference on Computer Graphics Applications, 1993. ,
A Clustering Approach to Constrained Binary Matrix Factorization, Data Mining and Knowledge Discovery for Big Data, pp.281-303, 2014. ,
DOI : 10.1007/978-3-642-40837-3_9
A local search approximation algorithm for k-means clustering, Proceedings of the eighteenth annual symposium on Computational geometry, pp.10-18, 2002. ,
An Efficient Heuristic Procedure for Partitioning Graphs. The Bell Systems Technical Journal, 1970. ,
DOI : 10.1002/j.1538-7305.1970.tb01770.x
PROXIMUS, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.147-156, 2003. ,
DOI : 10.1145/956750.956770
Compression, clustering, and pattern discovery in very high-dimensional discrete-attribute data sets, IEEE Transactions on Knowledge and Data Engineering, vol.17, issue.4, pp.447-461, 2005. ,
DOI : 10.1109/TKDE.2005.55
Learning the parts of objects by non-negative matrix factorization, Nature, vol.401, issue.6755, pp.788-791, 1999. ,
Algorithms for non-negative matrix factorization, NIPS, pp.556-562, 2000. ,
A general model for clustering binary data, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, pp.188-197, 2005. ,
DOI : 10.1145/1081870.1081894
An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Operations Research, vol.21, issue.2, pp.498-516, 1973. ,
DOI : 10.1287/opre.21.2.498
Weighted Rank-One Binary Matrix Factorization, SDM, pp.283-294, 2011. ,
DOI : 10.1137/1.9781611972818.25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.1917
Modeling dyadic data with binary latent factors, NIPS, pp.977-984, 2006. ,
Greedy and local search heuristics for unconstrained binary quadratic programming, Journal of Heuristics, vol.8, issue.2, pp.197-2013, 2002. ,
DOI : 10.1023/A:1017912624016
The Boolean column and column-row matrix decompositions, Data Mining and Knowledge Discovery, vol.1, issue.1, pp.39-56, 2008. ,
DOI : 10.1007/s10618-008-0107-0
The Discrete Basis Problem, IEEE Transactions on Knowledge and Data Engineering, vol.20, issue.10, pp.1348-1362, 2008. ,
DOI : 10.1109/TKDE.2008.53
Itemset approximation using Constrained Binary Matrix Factorization, 2014 International Conference on Data Science and Advanced Analytics (DSAA), pp.39-45, 2014. ,
DOI : 10.1109/DSAA.2014.7058049
URL : https://hal.archives-ouvertes.fr/hal-01071751
Mining discrete patterns via binary matrix factorization, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pp.757-766, 2009. ,
DOI : 10.1145/1557019.1557103
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.6514
LCM ver.3, Proceedings of the 1st international workshop on open source data mining frequent pattern mining implementations, OSDM '05 ,
DOI : 10.1145/1133905.1133916
Binary matrix factorization for analyzing gene expression data, Data Mining and Knowledge Discovery, vol.12, issue.6, pp.28-52, 2010. ,
DOI : 10.1007/s10618-009-0145-2