Minimal variance algorithm. Ideas?
조회 수: 1 (최근 30일)
이전 댓글 표시
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!
댓글 수: 0
채택된 답변
추가 답변 (0개)
참고 항목
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!