Unsupervised classifier based on heuristic optimization and maximum entropy principle
From MaRDI portal
Recommendations
Cites work
- An Experimental Study of Benchmarking Functions for Genetic Algorithms
- scientific article; zbMATH DE number 5717058 (Why is no real title available?)
- scientific article; zbMATH DE number 1350773 (Why is no real title available?)
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- scientific article; zbMATH DE number 2001588 (Why is no real title available?)
- scientific article; zbMATH DE number 2087677 (Why is no real title available?)
- scientific article; zbMATH DE number 1392848 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Learning representations by back-propagating errors
- On clustering validation techniques
- Pattern classification.
Cited in
(8)- Optimal unions of hidden classes
- Unsupervised learning by cluster quality optimization
- An efficient optimization method for solving unsupervised data classification problems
- scientific article; zbMATH DE number 1975248 (Why is no real title available?)
- scientific article; zbMATH DE number 1836285 (Why is no real title available?)
- A classifier system using smooth graph coloring
- Maximum-entropy estimated distribution model for classification problems
- Clusterwise elastic-net regression based on a combined information criterion
This page was built for publication: Unsupervised classifier based on heuristic optimization and maximum entropy principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950781)