A PATTERN LANGUAGE APPROACH TO IDENTIFY APPROPRIATE MACHINE LEARNING ALGORITHMS IN THE CONTEXT OF PRODUCT DEVELOPMENT

Abstract The product development process faces several challenges, such as an increasing and differentiated number of customer requirements, increasing product complexity, and shortened time-to-market. To address these challenges, the implementation of automation approaches in form of machine learni...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the Design Society Vol. 3; pp. 365 - 374
Main Authors Sonntag, Sebastian, Luttmer, Janosch, Pluhnau, Robin, Nagarajah, Arun
Format Journal Article Conference Proceeding
LanguageEnglish
Published Cambridge Cambridge University Press 01.07.2023
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Abstract The product development process faces several challenges, such as an increasing and differentiated number of customer requirements, increasing product complexity, and shortened time-to-market. To address these challenges, the implementation of automation approaches in form of machine learning (ML) algorithms appears promising. However, companies lack the implementation of these approaches in their processes, inter alia due to inadequate knowledge and experience in this field. Therefore, the aim of this paper is to develop a structured formulized way of characterising ML algorithms, which can support non-experts in identifying the optimal algorithm to solve a given problem. First, existing approaches covering the determination of appropriate ML algorithms for a given task are examined. Based on this, a pattern language approach is introduced to characterise ML algorithms and problems, allowing matching to be performed to identify the most suitable one for a given task. Due to their broad application, the concept is demonstrated by creating patterns for decision trees and artificial neural networks. A study is conducted to prove that the proposed concept is appropriate to support the ML algorithm selection.
ISSN:2732-527X
2732-527X
DOI:10.1017/pds.2023.37