2021
DOI: 10.1155/2021/6658785
|View full text |Cite
|
Sign up to set email alerts
|

A Source Number Estimation Algorithm Based on Data Local Density and Fuzzy C‐Means Clustering

Abstract: An advanced source number estimation (SNE) algorithm based on both fuzzy C-means clustering (FCM) and data local density (DLD) is proposed in this paper. The DLD of an eigenvalue refers to the number of eigenvalues within a specific neighborhood of this eigenvalue belonging to the data covariance matrix. This local density essentially as the one-dimensional sample feature of the FCM is extracted into the SNE algorithm based on FCM and can enable to improve the probability of correct detection (PCD) of the SNE … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…where d ik is the distance between sample x i and the kth clustering center [18,19]. (5) Determine whether the objective function calculated by formula (15) is greater than the set threshold ε and the number of iterations N. If the number of iterations N has not reached the maximum and is greater than the threshold, return (4); otherwise, turn to (6);…”
Section: Fault Determination Processmentioning
confidence: 99%
“…where d ik is the distance between sample x i and the kth clustering center [18,19]. (5) Determine whether the objective function calculated by formula (15) is greater than the set threshold ε and the number of iterations N. If the number of iterations N has not reached the maximum and is greater than the threshold, return (4); otherwise, turn to (6);…”
Section: Fault Determination Processmentioning
confidence: 99%
“…In order to better improve the clustering effect of the FCM algorithm, Wang et al 22 proposed a validity function to evaluate the clustering results according to the relative structure information of the data, and this method can accurately obtain the optimal number of clusters. Wu et al 23 added a sample feature called local data densit y to optimize the FCM algorithm, and one-dimensional data was extracted by distribution density characteristics of the eigenvalues. Wang 22 and Wu 23 gave us much inspiration for dealing with the relative positional relationship of data, and the shortcomings of FCM in finding the optimal solution cannot also be ignored.…”
Section: Related Workmentioning
confidence: 99%
“…Wu et al 23 added a sample feature called local data densit y to optimize the FCM algorithm, and one-dimensional data was extracted by distribution density characteristics of the eigenvalues. Wang 22 and Wu 23 gave us much inspiration for dealing with the relative positional relationship of data, and the shortcomings of FCM in finding the optimal solution cannot also be ignored. Therefore, we added a population-based stochastic optimization technique to the process of finding the centroid and a relative structure measurement method to the anomaly detection process.…”
Section: Related Workmentioning
confidence: 99%
“…According to the data structure distribution in Figure 2, the statistical feature quantity and high order cumulant of the sample data flow collected by sparse scattered points and multisensor array elements are extracted. In the process of resource allocation, the self-sparse structure is constantly adjusted according to the accumulated historical data, and the fuzzy clustering processing of the sample data information flow collected by sparse scattered points and multisensor array elements is realized by combining the learning algorithm of unbalanced data distribution and sample feature fusion [10].…”
Section: Analysis Of Data Structure Of Sensor Array Samplingmentioning
confidence: 99%