首页> 外文学位 >Evaluating Clustering Algorithms to Identify Subproblems in Design Processes
【24h】

Evaluating Clustering Algorithms to Identify Subproblems in Design Processes

机译:评估聚类算法以识别设计过程中的子问题

获取原文
获取原文并翻译 | 示例

摘要

Design problems are inherently intricate and require multiple dependent decisions. Because of these characteristics, design teams generally choose to decompose the main problem into manageable subproblems. This thesis describes the results of a study designed to (a) explore clustering algorithms as a new and repeatable way to identify subproblems in recorded design team discussions, (b) assess the quality of the identified subproblems, and (c) examine any relationships between the subproblems and final design or team experience level. We observed five teams of public health professionals and four teams of undergraduate students and applied four clustering algorithms to identify the team's subproblems and achieve the aforementioned research goals. The use of clustering algorithms to identify subproblems has not been documented before, and clustering presents a repeatable and objective method for determining a team's subproblems. The results from these algorithms as well as metrics noting the each result's quality were captured for all teams. We learned that each clustering algorithm has strengths and weaknesses depending on how the team discussed the problem, but the algorithms always accurately identify at least some of the discussed subproblems. Studying these identified subproblems reveals a team's design process and provides insight into their final design choices.
机译:设计问题本质上是复杂的,需要多个相关决策。由于这些特性,设计团队通常选择将主要问题分解为可管理的子问题。本论文描述了一项研究的结果,该研究旨在(a)探索聚类算法,作为在记录的设计团队讨论中识别子问题的新的可重复方式,(b)评估已识别子问题的质量,以及(c)检查之间的任何关系子问题和最终设计或团队经验水平。我们观察了五个团队的公共卫生专业人员和四个团队的本科生,并应用了四个聚类算法来识别团队的子问题并实现上述研究目标。之前尚未记录过使用聚类算法识别子问题的方法,并且聚类提出了一种可重复的,客观的方法来确定团队的子问题。这些算法的结果以及表示每个结果质量的度量标准已为所有团队捕获。我们了解到,根据团队讨论问题的方式,每种聚类算法都有其优缺点,但是这些算法始终可以准确地识别出至少一些所讨论的子问题。研究这些确定的子问题可以揭示团队的设计过程,并深入了解他们的最终设计选择。

著录项

  • 作者

    Morency, Michael.;

  • 作者单位

    University of Maryland, College Park.;

  • 授予单位 University of Maryland, College Park.;
  • 学科 Operations research.
  • 学位 M.S.
  • 年度 2017
  • 页码 164 p.
  • 总页数 164
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号