Minimal variance algorithm. Ideas?

1 次查看（过去 30 天）
Jurgen
Jurgen 2012-12-28
I don't have much experience with developing algorithms but I am considering the following problem: How to divide a set of numbers in N groups, such that the total variance is minimal? So the variance within each group is summed to get total variance.
Is it possible to calculate directly (like thresholding quantiles if I wanted groups of equal size) or does it require an iterative process?
Ive checked the code of rgb2ind but it uses some built-in functionality (cq?), and of course rgb2ind works on points in 3D space. So any help, even a reference to a handy paper or book, is welcome!

请先登录，再回答此问题。

采纳的回答

Matt J
Matt J 2012-12-28
编辑：Matt J 2012-12-28

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Categorical Arrays 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by