文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 高等教育 > 工学 > Finding a Subset of Representative Points in a Data Set
侵权投诉

Finding a Subset of Representative Points in a Data Set

spectral clustering

1418

IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. 24, NO. 9, SEPTEMBER 1994

.

.

. . . . .. ., . . . . . .. .. . .. .... . . . '

. . . . . . . . .

. . . . . . . . . . ... . . . . . . . . . . . . .. ... ... . . . .. .. . _ . _. . . .. . . .. ._ .,.:. . .

. ' . ... . .. . .. .. . . . . .... . . .. . .. . . . . . .. . .. . .. . . . ... . . . . . .. . .

. . . . ... .. . . . .. .. .? . .. .. . . . . . . . ... . . . . ... .. ...-.: ... .. . .. ..... .. . .. .... . . .. . .. .. ' '

. . .

*, . . . . . .. .. .. . ... . . . . .-. .,;.:, ., . . . . . .

.. . . .. . . . .. .. . . . . . . . . . . .. .. .. .. ... .. . . . . . . . . . . . . ... ... . .. .... . ...=. . .. .. . . . . . . . . . . .. .. . . . . . . ..... . .. .. .:. . . . . . . . . . . . .. .: . .. . . .: . .. . . . '

. .

,

:.-;.

' '

.

.

. _ . . .. ':":..',:.. . . . . . .., _ '.,. . . ......:.,;.::=.,.

. .,. _ . ., . . .. . . '

. .. . . . . . . . Y ' i..,:. . . . . . . ..... . . '. .. . ........... , '

,

'.

'

. . . . . . . . . .. . . . . . . . . . .. . .. . ., . . . . - .. . ., .. . . .. ... . ... .1 ., . . .. . ... . .. . . . ... .. . ..: . . . .. . .... ..n. .. . .. i; .: .:i . . . .:. _: . . .. . . . I

.'

;.,

_.

'

'

Fig. 4. Synthetic data of two clusters of size 322. (a) Local best representative point. (b) Cluster center by applying C-means algorithm Almost 5% representative points. (d) Almost 10% representative points. Our approach for finding the local best representative points in plane is dependent upon the local densities of the points. The density of any point I is assumed to be the number of data points present in an open disc of radius 8 around 2. Minimal spanning tree (MST) of the data points is used to decide the value of 8. Euclidean interpoint distance is taken as the edge weight of the MST. The square root of the average edge weight k, is taken to be equal to 8. A previous work by Murthy[12] shows the importance of k, in the set estimation problem. It may be noted that all the high density points may not give good representative points because many high density points may remain in a small locality and the representatives do not cover the entire data set. Thus, the distance between any two good representative points should be significant. The k, mentioned above has been used to fix the distance between any pair of representative points. Two

(c= 2). (c)

algorithms are presented in this correspondence for finding the local best representative point set. The first algorithm can be used when no is fixed a priori, while the second algorithm can be used when no is supplied. The utility of these algorithms is successfully tested on various artificial data sets and also on a real life speech sound data set. The organization of the correspondence is as follows. Section I1 provides a few definitions of representative points. Section I11 gives the description of two algorithms when the data is from%*. Section IV provides the results of the two algorithms. Section V deals with the extension of these algorithms to higher dimensions and provides the results of applying them on a speech recognition problem.

11. A FEWDEFINITIONS This section contains a few definitions related to locally best representative points and the basic setup under which the algorithms

Finding a Subset of Representative Points in a Data Set

上一页第3页

你可能喜欢

热门文档

相关文档

  • data mining 9

    each data object is in exactly one subset ? ... – A cluster is a set of points such that ...“representative” point of a cluster 4 center-...

  • NO RESULT

    Analysis is the process of finding a ? subset D’ of D [D: data set to be analyzed...Sampling (determines a representative subset of the...

  • ...FewSparse Modeling for Finding Representative Ob...

    FewSparse Modeling for Finding Representative Objects_文学研究_人文社科_专业资料...few representatives for a dataset, i.e., a subset of data points that ...

  • 第四章 聚类分析

    Finding groups of objects such that the objects ...“representative” point of a cluster 4 center-... which is a subset of the points of the ...

  • chap10_聚类分析

    each data object is in exactly one subset ? ...A cluster is a set of points such that any ...“representative” point of a cluster 4 center-...

  • 数据挖掘第8章

    each data object is in exactly one subset ? ... – A cluster is a set of points such that ...“representative” point of a cluster 4 center-...

  • chap10_聚类分析

    each data object is in exactly one subset ? ...A cluster is a set of points such that any ...“representative” point of a cluster 4 center-...

  • COMP5318 Knowledge Discovery and Data Mining_2011 S...

    ? Finding groups of objects such that the ...“representative” point of a cluster 4 center-...(a) Green points denote the data set in a ...

  • ch10ClusBasic

    ? Finding similarities between data according to ...K-Medoids Clustering: Find representative objects (...points in the test set and the closest centroids...

  • chap3_data_exploration

    ‘gender’ and a representative population of ...data points are summarized in a single figure ?...Selection may involve the chossing a subset of ...

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email