ABSTRACT
The application of model transformations to the process of design space exploration and multi-objective optimization allows for comprehensive exploration of an architectural trade space. For many applications, such as the design of missions involving multiple spacecraft, the resulting set of Pareto-optimal solution models can be too large to be consumed directly, requiring additional analyses in order to gain meaningful insights. In this paper, we investigate the use of automated clustering techniques for grouping similar solution models, and introduce and study a number of both generic and domain-specific methods for measuring the similarity of the solution models. We report results from applying our approach to the exploration of the design space of a spacecraft-based interferometry array in a lunar orbit. For purposes of evaluation and validation, results from the application to the case study are correlated with the results from a study in which solution models were clustered manually by groups of domain experts. The results show tradeoffs in the granularity and extensibility of applying clustering approaches to spacecraft mission architecture models. Also, what humans consider to be relevant in assessing architectural similarity varies and is often biased by their background and expertise. We conclude that providing the subjects with a range of clustering tools has the potential to strongly enhance the ability to explore the complex design space of multi-spacecraft missions, and gain deep insights into the trade space.
- Ethem Alpaydin. 2014. Introduction to machine learning. MIT press. Google ScholarDigital Library
- Thorsten Arendt, Enrico Biermann, Stefan Jurack, Christian Krause, and Gabriele Taentzer. 2010. Henshin: Advanced Concepts and Tools for In-Place EMF Model Transformations. Springer Berlin Heidelberg, Berlin, Heidelberg, 121--135. Google ScholarDigital Library
- C. Canali and R. Lancellotti. 2012. Automated clustering of VMs for scalable cloud monitoring and management. In 20th International Conference on Software, Telecommunications and Computer Networks. 1--5.Google Scholar
- Martin Fleck, Javier Troya, and Manuel Wimmer. 2015. Marrying search-based optimization and model transformation technology. Proc. of NasBASE (2015).Google Scholar
- Hank Heidt, Jordi Puig-Suari, Augustus Moore, Shinichi Nakasuka, and Robert Twiggs. 2000. CubeSat: A new generation of picosatellite for education and industry low-cost space experimentation. (2000).Google Scholar
- Sebastian J. I. Herzig, Sanda Mandutianu, Hongman Kim, Sonia Hernandez, and Travis Imken. 2017. Model-Transformation-Based Computational Design Synthesis for Mission Architecture Optimization. In In Proc. of the International IEEE Aerospace Conference. IEEE.Google Scholar
- Leonard Kaufman and Peter J Rousseeuw. 2009. Finding groups in data: an introduction to cluster analysis. Vol. 344. John Wiley & Sons.Google Scholar
- Soo Dong Kim and Soo Ho Chang. 2004. A systematic method to identify software components. In 11th Asia-Pacific Software Engineering Conference. 538--545. Google ScholarDigital Library
- Dimitrios S Kolovos, Davide Di Ruscio, Alfonso Pierantonio, and Richard F Paige. 2009. Different models for model matching: An analysis of approaches to support model differencing. In Comparison and Versioning of Software Models, 2009. CVSM'09. ICSE Workshop on. IEEE, 1--6. Google ScholarDigital Library
- Wiley J Larson and James Richard Wertz. 1992. Space mission analysis and design. Technical Report. Microcosm, Inc., Torrance, CA (US).Google Scholar
- S. Mancoridis, B. S. Mitchell, C. Rorres, Y. Chen, and E. R. Gansner. 1998. Using automatic clustering to produce high-level system organizations of source code. In In Proc. of 6th International Workshop on Program Comprehension. 45--52. Google ScholarDigital Library
- O. Maqbool and H. Babri. 2007. Hierarchical Clustering for Software Architecture Recovery. IEEE Transactions on Software Engineering 33, 11 (Nov 2007), 759--780. Google ScholarDigital Library
- Tom Mens and Pieter Van Gorp. 2006. A Taxonomy of Model Transformation. Electron. Notes Theor. Comput. Sci. 152 (March 2006), 125--142. Google ScholarDigital Library
- Michel Neuhaus, Kaspar Riesen, and Horst Bunke. 2006. Fast suboptimal algorithms for the computation of graph edit distance. In Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition and Structural and Syntactic Pattern Recognition. Springer, 163--172. Google ScholarDigital Library
- Mateusz Pawlik and Nikolaus Augsten. 2011. RTED: a robust algorithm for the tree edit distance. In Proc. of the VLDB Endowment 5, 4 (2011), 334--345. Google ScholarDigital Library
- Dave Steinberg, Frank Budinsky, Ed Merks, and Marcelo Paternostro. 2008. EMF: Eclipse Modeling Framework. Pearson Education. Google ScholarDigital Library
- V. Tzerpos and R. C. Holt. 1999. MoJo: a distance metric for software clusterings. In Sixth Working Conference on Reverse Engineering. 187--193. Google ScholarDigital Library
- Rui Xu and Donald Wunsch. 2005. Survey of clustering algorithms. IEEE Transactions on neural networks 16, 3 (2005), 645--678. Google ScholarDigital Library
- Liguo Yu and Srini Ramaswamy. 2007. Verifying Design Modularity, Hierarchy, and Interaction Locality Using Data Clustering Techniques. In In Proc. of the 45th Annual Southeast Regional Conference (ACM-SE 45). ACM, New York, NY, USA, 419--424. Google ScholarDigital Library
- S. Zhong, T. M. Khoshgoftaar, and N. Seliya. 2004. Analyzing software measurement data with clustering techniques. IEEE Intelligent Systems 19, 2 (Mar 2004), 20--27. Google ScholarDigital Library
Index Terms
- Dissimilarity Measures for Clustering Space Mission Architectures
Recommendations
Design space exploration acceleration through operation clustering
This paper presents a clustering method called clustering design space exploration (CDS-ExpA) to accelerate the architectural exploration of behavioral descriptions in C and SystemC. The trade-offs between faster exploration versus optimality of results ...
A dissimilarity measure based Fuzzy c-means FCM clustering algorithm
According to the definition of cluster objects belonging to same cluster must have high similarity while objects belonging to different clusters should be highly dissimilar. In the same way cluster validity indices for analyzing clustering result are ...
Learning spatially variant dissimilarity (SVaD) measures
KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data miningClustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure between the data points in feature space. This makes the type of clusters ...
Comments