Evaluating Clustering Algorithms for Identifying Design Subproblems

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Understanding how humans decompose design problems will yield insights that can be applied to develop better support for human designers. However, there are few established methods for identifying the decompositions that human designers use. This paper discusses a method for identifying subproblems by analyzing when design variables were discussed concurrently by human designers. Four clustering techniques for grouping design variables were tested on a range of synthetic datasets designed to resemble data collected from design teams, and the accuracy of the clusters created by each algorithm was evaluated. A spectral clustering method was accurate for most problems and generally performed better than hierarchical (with Euclidean distance metric), Markov, or association rule clustering methods. The method's success should enable researchers to gain new insights into how human designers decompose complex design problems.

Cite

CITATION STYLE

APA

Herrmann, J. W., Morency, M., Anparasan, A., & Gralla, E. L. (2018). Evaluating Clustering Algorithms for Identifying Design Subproblems. Journal of Mechanical Design, 140(8). https://doi.org/10.1115/1.4040176

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free