Finding a subset of representative points in a data set

Deals with the problem of finding the representative points from a data set /spl subespl Rfrsup 2/. Two algorithms are stated. One of the algorithms can find the local best representative or seed points. The extension of these algorithms for three or more dimensions is also discussed. Experimental results on synthetic and real life data are provided which manifest the utility of these algorithms.<
>