● Input: |
−initial partition |
−Data set |
● Iterations: |
1. Use the SVD to find by minimizing for each i, and compute ; |
2. Set j=1; |
3. While |
4. Choose a new partition that satisfies, implies that , ; |
5. Use SVD to find and choose , by minimizing for each i, and compute ; |
6. Increment j by 1, i.e., j→j + 1; |
7. End while |
● Output: |
− and . |