A Greedy Search Approach to Co-clustering Sparse Binary Matrices Export

@proceedings{citeulike:3126047, abstract = {A co-clustering algorithm for large sparse binary data matrices, based on a greedy technique and enriched with a local search strategy to escape poor local maxima, is proposed. The algorithm starts with an initial random solution and searches for a locally optimal solution by successive transformations that improve a quality function which combines row and column means together with the size of the co-cluster. Experimental results on synthetic and real data sets show that the method is able to find significant co-clusters}, author = {Angiulli, Fabrizio and Cesario, Eugenio and Pizzuti, Clara}, booktitle = {Tools with Artificial Intelligence, 2006. ICTAI '06. 18th IEEE International Conference on}, citeulike-article-id = {3126047}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/ICTAI.2006.10}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4031920}, doi = {10.1109/ICTAI.2006.10}, journal = {Tools with Artificial Intelligence, 2006. ICTAI '06. 18th IEEE International Conference on}, keywords = {clustering}, pages = {363--370}, posted-at = {2008-08-15 20:13:15}, priority = {2}, title = {A Greedy Search Approach to Co-clustering Sparse Binary Matrices}, url = {http://dx.doi.org/10.1109/ICTAI.2006.10}, year = {2006} }

TY - CONF ID - citeulike:3126047 L3 - citeulike-article-id:3126047 N2 - A co-clustering algorithm for large sparse binary data matrices, based on a greedy technique and enriched with a local search strategy to escape poor local maxima, is proposed. The algorithm starts with an initial random solution and searches for a locally optimal solution by successive transformations that improve a quality function which combines row and column means together with the size of the co-cluster. Experimental results on synthetic and real data sets show that the method is able to find significant co-clusters JF - Tools with Artificial Intelligence, 2006. ICTAI '06. 18th IEEE International Conference on EP - 370 TI - A Greedy Search Approach to Co-clustering Sparse Binary Matrices T2 - Tools with Artificial Intelligence, 2006. ICTAI '06. 18th IEEE International Conference on SP - 363 KW - clustering AU - Angiulli, Fabrizio AU - Cesario, Eugenio AU - Pizzuti, Clara PY - 2006/// UR - http://dx.doi.org/10.1109/ICTAI.2006.10 ER -