DocumentCode :
1142456
Title :
Finding a subset of representative points in a data set
Author :
Chaudhuri, D. ; Murthy, C.A. ; Chaudhuri, B.B.
Author_Institution :
Electron. & Commun. Sci. Unit, Indian Stat. Inst., Calcutta, India
Volume :
24
Issue :
9
fYear :
1994
fDate :
9/1/1994 12:00:00 AM
Firstpage :
1416
Lastpage :
1424
Abstract :
Deals with the problem of finding the representative points from a data set ⊆ℜ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
Keywords :
probability; set theory; statistical analysis; data set; local best representative; real life data; representative points; seed points; subset; synthetic data; Clustering algorithms; Data compression; Density functional theory; Parameter estimation; Pattern classification; Probability density function; Statistics;
fLanguage :
English
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9472
Type :
jour
DOI :
10.1109/21.310520
Filename :
310520
Link To Document :
بازگشت