Multi-technology Platforms (MTPs)

Brecher, Christian; Bleck, Wolfgang; Feldhusen, Jörg; Klocke, Fritz; Reisgen, Uwe; Schmitt, Robert; Bailly, David; Bambach�, Markus; Conrads, Laura; Bois-Reymond, Frédéric du; Göttmann, Alexander; Gräfe, Stefan; Harraz, Mohamed; Heller, Jan Erik; Herfs, Werner; Komerla, Krishna Chaitanya; Laugwitz, Marvin; Löwer, Manuel; Mertin, Chris; Naumov, Andreas; Nittinger, Johannes Alexander; Peterek, Martin; Prahl, Ulrich; Rey, Jan; Schiebahn, Alexander; Schmid, Alexander; Schmitz, Roman Ulrich Christopher; Tönissen, Stefan; Voswinckel, Holger; Wegener, M.; Wellmann, Frederik Norbert

doi:10.1007/978-3-319-47452-6_6

Cited by 3 publications

(1 citation statement)

References 100 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the clustering method, the arithmetic means of each cluster are determined. It is e cient and progressive due to the integration of a dynamic load balance technique and the K-Mean clustering method in [17,18]. In this strategy, the main system assigns the client system the same size subdataset [19,20].…”

Section: Simple Andmentioning

confidence: 99%

Performance Evaluation of Simple K-Mean and Parallel K-Mean Clustering Algorithms: Big Data Business Process Management Concept

Zada

Ali

Khan³

et al. 2022

Mobile Information Systems

View full text Add to dashboard Cite

Data is the most valuable asset in any firm. As time passes, the data expands at a breakneck speed. A major research issue is the extraction of meaningful information from a complex and huge data source. Clustering is one of the data extraction methods. The basic K-Mean and Parallel K-Mean partition clustering algorithms work by picking random starting centroids. The basic and K-Mean parallel clustering methods are investigated in this work using two different datasets with sizes of 10000 and 5000, respectively. The findings of the Simple K-Mean clustering algorithms alter throughout numerous runs or iterations, according to the study, and so iterations differ for each run or execution. In some circumstances, the clustering algorithms’ outcomes are always different, and the algorithms separate and identify unique properties of the K-Mean Simple clustering algorithm from the K-Mean Parallel clustering algorithm. Differentiating these features will improve cluster quality, lapsed time, and iterations. Experiments are designed to show that parallel algorithms considerably improve the Simple K-Mean techniques. The findings of the parallel techniques are also consistent; however, the Simple K-Mean algorithm’s results vary from run to run. Both the 10,000 and 5000 data item datasets are divided into ten subdatasets for ten different client systems. Clusters are generated in two iterations, i.e., the time it takes for all client systems to complete one iteration (mentioned in chapter number 4). In the first execution, Client No. 5 has the longest elapsed time (8 ms), whereas the longest elapsed time in the following iterations is 6 ms, for a total elapsed time of 12 ms for the K-Mean clustering technique. In addition, the Parallel algorithms reduce the number of executions and the time it takes to complete a task.

show abstract

Section: Simple Andmentioning

confidence: 99%