Referenced Items are not available for this document.
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 quasi-random 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
Published in:
Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on
(Volume:2
)
Date of Conference: 1999
- Meeting Date :
- 06 Jul 1999-09 Jul 1999
- Print ISBN:
- 0-7803-5536-9
- INSPEC Accession Number:
- 6338898
- Conference Location :
- Washington, DC
- Digital Object Identifier :
- 10.1109/CEC.1999.782514
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
