Two evolutionary approaches to cross-clustering problems.

Research Output

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.

Date:

31 December 1999
Publication Status:

Published
Publisher

IEEE
DOI:

10.1109/CEC.1999.782514
Library of Congress:

QA75 Electronic computers. Computer science
Dewey Decimal Classification:

006.3 Artificial intelligence

http://researchrepository.napier.ac.uk/output/282717 <p>Luchian, H., Paechter, B., Radulescu, V., & Luchian, S. (1999). Two evolutionary approaches to cross-clustering problems. In <i>Proceedings of the 1999 Congress on Evolutionary Computation</i>, (860-870). https://doi.org/10.1109/CEC.1999.782514</p>

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