首页> 外文会议>FUTURE COMPUTING 2012 >Feature Selection for Clustering by Exploring Nearest and Farthest Neighbors
【24h】

Feature Selection for Clustering by Exploring Nearest and Farthest Neighbors

机译:通过探索最近的邻居群集聚类功能选择

获取原文

摘要

Feature selection has been explored extensively for use in several real-world applications. In this paper, we propose a new method to select a salient subset of features from unlabeled data, and the selected features are then adaptively used to identify natural clusters in the cluster analysis. Unlike previous methods that select salient features for clustering; our method does not require a predetermined clustering algorithm to identify salient features, and our method potentially ignores noisy features, allowing improved identification of salient features. Our feature selection method is motivated by a basic characteristic of clustering: a data instance usually belongs to the same cluster as its geometrically nearest neighbors and belongs to a cluster different than those of its geometrically farthest neighbors. In particular, our method uses instance-based learning to quantify features in the context of the nearest and the farthest neighbors of every instance so that clusters generated by the salient features maintain this characteristic.
机译:在多个真实应用程序中广泛探讨了功能选择。在本文中,我们提出了一种新方法来选择来自未标记数据的突出特征子集,然后自适应地使用所选功能来识别集群分析中的自然集群。与选择群集的突出功能的方法不同;我们的方法不需要预定的聚类算法来识别突出特征,并且我们的方法可能会忽略嘈杂的功能,允许改善突出特征的识别。我们的特征选择方法是由聚类的基本特征的激励:数据实例通常属于与其几何最近邻居相同的群集,并且属于与其几何上最远邻居不同的集群。特别是,我们的方法使用基于实例的学习来量化每个实例的最近邻居的上下文中的特征,以便由突出特征产生的集群维持该特征。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号