Two evolutionary approaches to cross-clustering problems.

Luchian, Henri; Paechter, Ben; Radulescu, Vlad; Luchian, Silvia

Abstract

Cross-clustering asks for a Boolean matrix to
be brought to a quasi-canonical form. The problem has
many applications in image processing, circuit design,
archaeology, ecology etc. The heuristics currently used
to solve it rely on either topological sorting or quasirandom
search. We present here two evolutionary
approaches to this problem: a permutation-based
solution and a clustering one. The results on both real
data and randomly generated, scalable, test data show
very good convergence and encouraging efficiency
properties, mainly for our second approach.

Citation

Luchian, H., Paechter, B., Radulescu, V., & Luchian, S. (1999). Two evolutionary approaches to cross-clustering problems. In Proceedings of the 1999 Congress on Evolutionary Computation (860-870). https://doi.org/10.1109/CEC.1999.782514

• Conference Name: 1999 Congress on Evolutionary Computation
• Start Date: Jul 6, 1999
• End Date: Jul 9, 1999
• Publication Date: 1999
• Deposit Date: Aug 2, 2010
• Publicly Available Date: Aug 2, 2010
• Publisher: Institute of Electrical and Electronics Engineers
• Peer Reviewed: Peer Reviewed
• Volume: Volume
• Pages: 860-870
• Book Title: Proceedings of the 1999 Congress on Evolutionary Computation
• ISBN: 0-7803-5536-9
• DOI: https://doi.org/10.1109/CEC.1999.782514
• Keywords: Cross-clustering; topological sorting; quasirandomsearch; permutation-based solution; clustering
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3197
• Publisher URL: http://dx.doi.org/10.1109/CEC.1999.782514
• Contract Date: Aug 2, 2010