FINDING A SUBSET OF REPRESENTATIVE POINTS IN A DATA SET

被引：29

作者：

CHAUDHURI, D

MURTHY, CA

CHAUDHURI, BB

机构：

[1] Electronics and Communication Sciences Unit, Indian Statistical Institute, Calcutta, 700 035

来源：

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS | 1994年 / 24卷 / 09期

关键词：

Problem solving;

D O I：

10.1109/21.310520

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This correspondence deals with the problem of finding the representative points from a data set subset-or-equal-to R2. 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.

引用

页码：1416 / 1424

页数：9

共 18 条

[1]

ANDERBERG MR, 1973, CLUSTER ANAL APPLICA

[2]

ASTRAHAN MM, 1970, AD709067

[3]

BALL GH, 1967, AD822174

[4] ESTIMATION OF A MULTIVARIATE DENSITY [J].

CACOULLOS, T .

ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 1966, 18 (02) :179-+

[5]

CHAUDHUIR BB, UNPUB PATTERN RECOGN

[6]

CHAUDHURI BB, 1993, TRKBCS293 TECH REP

[7] A NEW SPLIT-AND-MERGE CLUSTERING TECHNIQUE [J].

CHAUDHURI, D ;

CHAUDHURI, BB ;

MURTHY, CA .

PATTERN RECOGNITION LETTERS, 1992, 13 (06) :399-409

[8]

Devijver P., 1982, PATTERN RECOGNITION

[9]

FORGY EW, 1965, BIOMETRICS, V21, P768

[10]

Jain K., 1988, DUBES ALGORITHMS CLU

← 1 2 →