Quasi-cluster centers clustering algorithm based on potential entropy and t-distributed stochastic neighbor embedding

Title
Quasi-cluster centers clustering algorithm based on potential entropy and t-distributed stochastic neighbor embedding
Authors
Keywords
Data clustering, Quasi-cluster centers clustering, Potential entropy, Optimal parameter, t-distributed stochastic neighbor embedding
Journal
SOFT COMPUTING
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2018-05-11
DOI
10.1007/s00500-018-3221-y

Ask authors/readers for more resources

Reprint

Contact the author

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started