Before revision:  The main problem is to cope with the partial information . We studied a simple algorithm we callData clustering using flats minimum distances , using the following assumptions: 1) There are m clusters.
After revision:  The main problem is to cope with Data clustering using flats minimum distances , using the following assumptions: 1) There are m clusters.