Evaluating Clustering Algorithms for Identifying Design Subproblems
نویسندگان
چکیده
منابع مشابه
Using Clustering Algorithms to Identify Subproblems in Design Processes
Designers work in teams to design complex systems. They separate the design problem into subproblems and solve the smaller, more manageable subproblems. Because this affects the overall quality of their design, it is important to understand how teams decompose system design problems, which will ultimately enable future research on how to design better design processes. We studied teams of exper...
متن کاملEvaluating Subspace Clustering Algorithms
Clustering techniques often define the similarity between instances using distance measures over the various dimensions of the data [12, 14]. Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. Traditional clustering algorithms consider all of the dimensions of an input dataset in an attempt to learn as much as possi...
متن کاملMinimization subproblems and heuristics for an applied clustering problem
A practical problem that requires the classification of a set of points of IRn using a criterion not sensitive to bounded outliers is studied in this paper. A fixed-point (k-means) algorithm is defined that uses an arbitrary distance function. Finite convergence is proved. A robust distance defined by Boente, Fraiman and Yohai is selected for applications. Smooth approximations of this distance...
متن کاملFramework for Evaluating Clustering Algorithms in Duplicate Detection
The presence of duplicate records is a major data quality concern in large databases. To detect duplicates, entity resolution also known as duplication detection or record linkage is used as a part of the data cleaning process to identify records that potentially refer to the same real-world entity. We present the Stringer system that provides an evaluation framework for understanding what barr...
متن کاملEvaluating graph theoretic clustering algorithms for reliable multicasting
In reliable multicast protocols, each data packet being sent must be acknowledged. Collecting the acknowledgments centrally at the sources can cause ACK-implosion and can result in poor scalability. To overcome this, clustering algorithms which use virtual structures to gather acknowledgments were proposed. In this work, we analyze the complexities of three such clustering algorithms: Lorax, k-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mechanical Design
سال: 2018
ISSN: 1050-0472,1528-9001
DOI: 10.1115/1.4040176