FINDING A SUBSET OF REPRESENTATIVE POINTS IN A DATA SET

Authors
CHAUDHURI D MURTHY CA CHAUDHURI BB
Citation
D. Chaudhuri et al., FINDING A SUBSET OF REPRESENTATIVE POINTS IN A DATA SET, IEEE transactions on systems, man, and cybernetics, 24(9), 1994, pp. 1416-1424
Citations number
18
Categorie Soggetti
Controlo Theory & Cybernetics","Computer Science Cybernetics","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on systems, man, and cybernetics → ACNP
ISSN journal
00189472
Volume
24
Issue
9
Year of publication
1994
Pages
1416 - 1424
Database
ISI
SICI code
0018-9472(1994)24:9<1416:FASORP>2.0.ZU;2-4
Abstract
This correspondence deals with the problem of finding the representati ve points from a data set subset-or-equal-to R2. Two algorithms are st ated. One of the algorithms can find the local best representative or seed points. The extension of these algorithms for three or more dimen sions is also discussed. Experimental results on synthetic and real li fe data are provided which manifest the utility of these algorithms.