2019
DOI: 10.1007/s10586-019-02963-9
|View full text |Cite
|
Sign up to set email alerts
|

Enhancement of fraternal K-median algorithm with CNN for high dropout probabilities to evolve optimal time-complexity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 37 publications
0
1
0
Order By: Relevance
“…The clustering procedure based on K-means algorithm includes initialization, computation of cluster centers, distance calculation, guideline of the termination circumstance and computation of the target function. Nagaraj et al (2019) used fraternal K-median clustering algorithm as the preprocessing schemes. The research applied dropout regularization mechanism to improve the precision by letting network over fit decision of CNN.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The clustering procedure based on K-means algorithm includes initialization, computation of cluster centers, distance calculation, guideline of the termination circumstance and computation of the target function. Nagaraj et al (2019) used fraternal K-median clustering algorithm as the preprocessing schemes. The research applied dropout regularization mechanism to improve the precision by letting network over fit decision of CNN.…”
Section: Literature Reviewmentioning
confidence: 99%