首页> 外文会议>2011 IEEE Symposium on Computational Intelligence and Data Mining >KB-CB-N classification: Towards unsupervised approach for supervised learning
【24h】

KB-CB-N classification: Towards unsupervised approach for supervised learning

机译:KB-CB-N分类:寻求无监督学习方法

获取原文

摘要

Data classification has attracted considerable research attention in the field of computational statistics and data mining due to its wide range of applications. K Best Cluster Based Neighbour (KB-CB-N) is our novel classification technique based on the integration of three different similarity measures for cluster based classification. The basic principle is to apply unsupervised learning on the instances of each class in the dataset and then use the output as an input for the classification algorithm to find the K best neighbours of clusters from the density, gravity and distance perspectives. Clustering is applied as an initial step within each class to find the inherent in-class grouping in the dataset. Different data clustering techniques use different similarity measures. Each measure has its own strength and weakness. Thus, combining the three measures can benefit from the strength of each one and eliminate encountered problems of using an individual measure. Extensive experimental results using eight real datasets have evidenced that our new technique typically shows improved or equivalent performance over other existing state-of-the-art classification methods.
机译:数据分类由于其广泛的应用而在计算统计和数据挖掘领域引起了相当大的研究关注。 K最佳基于聚类的邻居(KB-CB-N)是我们基于三种不同相似性度量的集成的新颖分类技术,用于基于聚类的分类。基本原理是将无监督学习应用于数据集中每个类的实例,然后将输出用作分类算法的输入,以从密度,重力和距离的角度找到聚类的K个最佳邻居。聚类被用作每个类中的初始步骤,以在数据集中找到固有的类内分组。不同的数据聚类技术使用不同的相似性度量。每种措施都有其优点和缺点。因此,将这三种措施结合起来可以从每种措施的优势中受益,并且可以消除使用单独措施时遇到的问题。使用八个真实数据集的大量实验结果证明,与其他现有的最新分类方法相比,我们的新技术通常显示出改进的性能或同等的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号