2022
DOI: 10.1016/j.array.2021.100124
|View full text |Cite
|
Sign up to set email alerts
|

Deep autoencoder-based fuzzy c-means for topic detection

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 28 publications
0
5
0
Order By: Relevance
“…The complexity and overlap facing many multi-dimensional data made traditional clustering algorithms useless, so it was necessary to develop clustering techniques that could deal with the overlap between clusters and form homogeneous groups according to fuzzy logic. The first algorithm to address this interference was Fuzzy C Means (FCM) 22 , which aims to collect large data in the form of new, more homogeneous groups based on determining degrees of belonging to the targeted cases. This algorithm was developed by Dunn, Bezdek In 1974, by developing the partition matrix in the K-Means clustering algorithm while determining the degree of fuzzing, then the objective function was obtained, which represents the minimization sum of square errors 𝒙 π’Šπ’‹ : value of observation i at dimension j. 𝒗 π’‹π’Œ : represents the center of cluster k of dimension j. 𝝋(𝒙 π’Šπ’‹ ; 𝒗 π’Œ ): is a measure of similarity or difference of the observation value𝒙 π’Šπ’‹ from its cluster center 𝒗 π’‹π’Œ .…”
Section: Fuzzy C-means Clusteringmentioning
confidence: 99%
“…The complexity and overlap facing many multi-dimensional data made traditional clustering algorithms useless, so it was necessary to develop clustering techniques that could deal with the overlap between clusters and form homogeneous groups according to fuzzy logic. The first algorithm to address this interference was Fuzzy C Means (FCM) 22 , which aims to collect large data in the form of new, more homogeneous groups based on determining degrees of belonging to the targeted cases. This algorithm was developed by Dunn, Bezdek In 1974, by developing the partition matrix in the K-Means clustering algorithm while determining the degree of fuzzing, then the objective function was obtained, which represents the minimization sum of square errors 𝒙 π’Šπ’‹ : value of observation i at dimension j. 𝒗 π’‹π’Œ : represents the center of cluster k of dimension j. 𝝋(𝒙 π’Šπ’‹ ; 𝒗 π’Œ ): is a measure of similarity or difference of the observation value𝒙 π’Šπ’‹ from its cluster center 𝒗 π’‹π’Œ .…”
Section: Fuzzy C-means Clusteringmentioning
confidence: 99%
“…This type of data representation is called clusteringfriendly representation [18]. Another method used for deep text clustering is the autoencoder neural network [19] [20], which is one of the most prominent unsupervised representation learning algorithms [21]. This neural network creates a non-linear mapping from the data space to a latent space in order to reduce the dimensions.…”
Section: Research Backgroundmentioning
confidence: 99%
“…problems. Autoencoders (AE) [1] and GAN [2] are two techniques for making deepfakes. Applications like FakeApp, DeepFaceLab, DFaker, and DeepFaketf have all adopted autoencoder technology.…”
Section: A Fake-image Generation and Deepfake Datasetsmentioning
confidence: 99%
“…For example, Reddit user "deepfakes" employs deep learning algorithms to distribute female face photos into pornographic videos. There is a significant uproar in response to this instance of defamation and disrespect [1]. Moreover, BuzzFeed has ever produced a video with former US President Barack Obama that he gives a speech about the problems of deepfakes on individuals and society as a whole [2].…”
Section: Introductionmentioning
confidence: 99%