2019
DOI: 10.1016/j.ins.2019.03.024
|View full text |Cite
|
Sign up to set email alerts
|

Efficient registration of multi-view point sets by K-means clustering

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 73 publications
(27 citation statements)
references
References 30 publications
0
27
0
Order By: Relevance
“…For example, fuzzy k-means clustering first randomly selects a number of cluster centers, all data points are given a certain degree of fuzzy membership to the cluster centers, and then iteratively modify the clustering center continuously. In the iterative process, the optimization goal is to minimize the distance between all data points and each cluster center and to take the weighted sum of the minimum membership degrees [36]. After determining the number of fuzzy subsets for each attribute, calculate the membership of each fuzzy subset.…”
Section: A Data Fuzzificationmentioning
confidence: 99%
“…For example, fuzzy k-means clustering first randomly selects a number of cluster centers, all data points are given a certain degree of fuzzy membership to the cluster centers, and then iteratively modify the clustering center continuously. In the iterative process, the optimization goal is to minimize the distance between all data points and each cluster center and to take the weighted sum of the minimum membership degrees [36]. After determining the number of fuzzy subsets for each attribute, calculate the membership of each fuzzy subset.…”
Section: A Data Fuzzificationmentioning
confidence: 99%
“…It is worth to highlight that a maximum number of 300 iterations with 15 re-runs were used. The initialization was set at random whilst the class centroids were estimated in order to normalize the observations from the initially aligned points to stimulate the efficacy as well as the effectiveness of the clustering (22) . Consequently, every single point is assigned to a particular cluster whilst each cluster centroid is updated simultaneously.…”
Section: The K-means Clustering Algorithmmentioning
confidence: 99%
“…Reference [22] gives the typical curves of cooling, heating, and electrical load and solar radiation in different seasons to illustrate these uncertainties, which does not make cluster analysis or scenario reduction. Furthermore, there are many frequently used scenario-clustering methods applied in the energy field, such as K-mean [23,24], Fuzzy c-mean [25,26], K-harmonic means [27,28], and K-shape [29]. However, there is a problem with these conventional clustering methods; that is, the number of expected clustering scenarios is given subjectively before clustering analysis but not objectively explaining why such clustering is the best through reasonable arguments.…”
Section: Literature Reviewmentioning
confidence: 99%