2022
DOI: 10.1109/tcyb.2021.3071462
|View full text |Cite
|
Sign up to set email alerts
|

Trust-Tech Source-Point Method for Systematically Computing Multiple Local Optimal Solutions: Theory and Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 43 publications
0
3
0
Order By: Relevance
“…(i) Apply a hierarchical scheme to provide higher-quality initial points for the K-means algorithm to local optimal solutions; the resulting scheme is termed the hierarchical Kmeans algorithm (H-K algorithm) [31];…”
Section: Overview Of the Proposed Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…(i) Apply a hierarchical scheme to provide higher-quality initial points for the K-means algorithm to local optimal solutions; the resulting scheme is termed the hierarchical Kmeans algorithm (H-K algorithm) [31];…”
Section: Overview Of the Proposed Methodsmentioning
confidence: 99%
“…To resolve these difficulties, we next present a Trust-Tech source-point method [31]. Theorem 4 below establishes the existence of source points on the quasi-stability boundary and the relationship between a source point and the quasi-stability neighboring regions.…”
Section: Multiple Clustering Solutions By Trust-tech Methodsmentioning
confidence: 99%
“…The first is to set the appropriate initial conditions according to the actual situation of different problems, c so as to better find the local optimal solution. The second is to optimise each local solution and obtain a locally optimal solution by iteration of the greedy algorithm [10]. The final step is to determine the termination conditions of the algorithm.…”
Section: Analysis Of Model Ideasmentioning
confidence: 99%