Luchian, Henri, Paechter, Ben, Radulescu, Vlad and Luchian, Silvia (1999) Two evolutionary approaches to cross-clustering problems. In: Proceedings of the 1999 Congress on Evolutionary Computation. IEEE, Washington, USA, pp. 860-870. ISBN 0-7803-5536-9
| PDF Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial. Download (662kB) | Request a copy |
Abstract/Description
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.
| Item Type: | Book Section |
|---|---|
| ISBN: | 0-7803-5536-9 |
| Uncontrolled Keywords: | Cross-clustering; topological sorting; quasirandom search; permutation-based solution; clustering; |
| University Divisions/Research Centres: | Faculty of Engineering, Computing and Creative Industries > School of Computing |
| Dewey Decimal Subjects: | 000 Computer science, information & general works > 000 Computer science, knowledge & systems > 006 Special Computer Methods > 006.3 Artificial intelligence |
| Library of Congress Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Item ID: | 3197 |
| Depositing User: | Computing Research |
| Date Deposited: | 02 Aug 2010 15:52 |
| Last Modified: | 12 Jan 2011 04:52 |
| URI: | http://researchrepository.napier.ac.uk/id/eprint/3197 |
Actions (login required)
| View Item |

Tools
Tools