2021
DOI: 10.1609/aaai.v35i8.16854
|View full text |Cite
|
Sign up to set email alerts
|

Automated Clustering of High-dimensional Data with a Feature Weighted Mean Shift Algorithm

Abstract: Mean shift is a simple interactive procedure that gradually shifts data points towards the mode which denotes the highest density of data points in the region. Mean shift algorithms have been effectively used for data denoising, mode seeking, and finding the number of clusters in a dataset in an automated fashion. However, the merits of mean shift quickly fade away as the data dimensions increase and only a handful of features contain useful information about the cluster structure of the data. We propose a sim… 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
1

Year Published

2022
2022
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 36 publications
0
5
0
1
Order By: Relevance
“…Based on the K-Means machine learning algorithm to complete the modeling process of the fractal model, the clustering idea is used to mine the potential correlation of the genotype data, and the data are grouped categorized, and visualized. The K-Means algorithm was proposed by the Lloyd scholars in 1982, and the algorithm is one of the most classical and commonly used unsupervised learning algorithms to solve the clustering problem ( Chakraborty et al., 2020 ; Sinaga and Yang, 2020 ). It divides the set of samples into K-class clusters and uses Euclidean distance to measure the similarity between the samples, which results in high similarity within clusters of the same class and low similarity between clusters of different classes ( Mirzal, 2020 ).…”
Section: Methodsmentioning
confidence: 99%
“…Based on the K-Means machine learning algorithm to complete the modeling process of the fractal model, the clustering idea is used to mine the potential correlation of the genotype data, and the data are grouped categorized, and visualized. The K-Means algorithm was proposed by the Lloyd scholars in 1982, and the algorithm is one of the most classical and commonly used unsupervised learning algorithms to solve the clustering problem ( Chakraborty et al., 2020 ; Sinaga and Yang, 2020 ). It divides the set of samples into K-class clusters and uses Euclidean distance to measure the similarity between the samples, which results in high similarity within clusters of the same class and low similarity between clusters of different classes ( Mirzal, 2020 ).…”
Section: Methodsmentioning
confidence: 99%
“…Then, this detected speech is sent for Speaker segmentation, where the speech is segmented based on Speaker Change Detection [24] and the constant thresholds are estimated using Proposed FEOSA. Next to speaker segmentation, the clustering or Speaker diarization process is conducted using entropy weighting power k means algorithm [25], where the weight update is accomplished through same proposed FEOSA. Figure 1 portrays the schematic illustration of proposed FEOSA.…”
Section: Methodsmentioning
confidence: 99%
“…Where M c represents the largest number of clusters As one of the widely used clustering algorithms, K-means [13] algorithm can group data vectors into several clusters. When K-means algorithm is initialized, it is necessary to determine the number of clusters, and this parameter has a great impact on the performance of the algorithm.…”
Section: Identify Electricity Theft In Output Layermentioning
confidence: 99%