2019
DOI: 10.3390/jsan8040056
|View full text |Cite
|
Sign up to set email alerts
|

Introducing and Comparing Recent Clustering Methods for Massive Data Management in the Internet of Things

Abstract: The use of wireless sensor networks, which are the key ingredient in the growing Internet of Things (IoT), has surged over the past few years with a widening range of applications in the industry, healthcare, agriculture, with a special attention to monitoring and tracking, often tied with security issues. In some applications, sensors can be deployed in remote, large unpopulated areas, whereas in others, they serve to monitor confined busy spaces. In either case, clustering the sensor network’s nodes into sev… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 16 publications
(5 citation statements)
references
References 47 publications
0
5
0
Order By: Relevance
“…K-means partitions data into k distinct clusters based on distance to the centroid of a cluster, which have been successfully applied to the analysis of Raman spectra from biological samples such as breast cancer ( Kothari et al, 2021 ), colonic cancer ( Beljebbar et al, 2009 ), and macromolecules ( Pahlow et al, 2018 ). As for the DBSCAN algorithm, it is a density-based clustering that looks for high-density areas and extends clusters from them ( Guyeux et al, 2019 ). Thus, the pre-set number of clusters is not required.…”
Section: Resultsmentioning
confidence: 99%
“…K-means partitions data into k distinct clusters based on distance to the centroid of a cluster, which have been successfully applied to the analysis of Raman spectra from biological samples such as breast cancer ( Kothari et al, 2021 ), colonic cancer ( Beljebbar et al, 2009 ), and macromolecules ( Pahlow et al, 2018 ). As for the DBSCAN algorithm, it is a density-based clustering that looks for high-density areas and extends clusters from them ( Guyeux et al, 2019 ). Thus, the pre-set number of clusters is not required.…”
Section: Resultsmentioning
confidence: 99%
“…The fourteen chosen algorithms for consideration (and their implementations) are as follows: Hierarchical (Ward’s) [ 19 , 45 ], Hierarchical (Single Link) [ 19 ], BIRCH (Balanced Iterative Reducing and Clustering) [ 46 , 47 ], k -means [ 48 50 ], k -means minibatch [ 49 , 51 ], Partitioning around Medoids (PAM) [ 52 ], DBSCAN (Density-based Spatial Clustering of Applications with Noise) [ 49 , 53 ], OPTICS (Ordering Points to Identify Clustering Structure) [ 49 , 54 ], Mean Shift [ 49 , 55 ], Spectral Clustering [ 49 , 56 , 57 ], Affinity Propagation [ 49 , 57 , 58 ], and Gaussian Mixture Model [ 57 , 59 ] were implemented using the scikit-learn Python package ( https://scikit-learn.org/stable/modules/clustering.html ). Fuzzy C-Means [ 60 , 61 ] was implemented using the Fuzzy C-Means Python package [ 62 ] ( https://git.io/fuzzy-c-means ).…”
Section: Methodsmentioning
confidence: 99%
“…The fowlkes-mallows index is a metric that assesses the similarity between two clusters by comparing the clustering result to a known ground truth partition [24]. FMI produces a similarity score ranging from 0 to 1, with a higher score indicating a higher similarity between the two clusters.…”
Section: Fowlkes-mallows Indexmentioning
confidence: 99%