Wang, Bingwen and Antonsson, Erik K. (2005) Hierarchical modularity: Decomposition of function structures with the minimal description length principle. In: 17th International Conference on Design Theory and Methodology. American Society of Mechanical Engineers , New York, NY, pp. 393-402. ISBN 0-7918-4742-X http://resolver.caltech.edu/CaltechAUTHORS:20110816-090033673
- Published Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20110816-090033673
In engineering design and analysis, complex systems often need to be decomposed into a hierarchical combination of different simple subsystems. It's necessary to provide formal, computable methods to hierarchically decompose complex structures. Since graph structures are commonly used as modeling methods in engineering practice, this paper presents a method to hierarchically decompose graph structures. The Minimal Description Length (MDL) principle is introduced as a measure to compare different decompositions. The best hierarchical decomposition is searched by, evolutionary computation methods with newly defined crossover and mutation operators of tree structures. The results on abstract graph without attributes and a real function structure show that the technique is promising.
|Item Type:||Book Section|
|Additional Information:||© 2005 ASME. Paper no. DETC2005-85173. The authors thank the anonymous reviewers for valuable comments that improved the presentation of this paper.|
|Official Citation:||Hierarchical Modularity: Decomposition of Function Structures With the Minimal Description Length Principle Bingwen Wang and Erik K. Antonsson, ASME Conf. Proc. 2005, 393 (2005), DOI:10.1115/DETC2005-85173|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||17 Aug 2011 23:30|
|Last Modified:||24 Dec 2014 16:26|
Repository Staff Only: item control page