首页> 外文会议>Advances in Knowledge Discovery and Data Mining >M-FastMap: A Modified FastMap Algorithm for Visual Cluster Validation in Data Mining
【24h】

M-FastMap: A Modified FastMap Algorithm for Visual Cluster Validation in Data Mining

机译:M-FastMap:一种用于数据挖掘中的视觉集群验证的改进型FastMap算法

获取原文

摘要

This paper presents M-FastMap, a modified FastMap algorithm for visual cluster validation in data mining. In the visual cluster validation with FastMap, clusters are first generated with a clustering algorithm from a database. Then, the FastMap algorithm is used to project the clusters onto a 2-dimensional (2D) or 3-dimensional (3D) space and the clusters are visualized with different colors and/or symbols on a 2D (or 3D) display. From the display a human can visually examine the separation of clusters. This method follows the principle that if a cluster is separate from others in the projected 2D (or 3D) space, it is also separate from others in the original high dimensional space (the opposite is not true). The modified FastMap algorithm improves the quality of visual cluster validation by optimizing the separation of clusters on the 2D or (3D) space in the selection of pivot objects (or projection axis). The comparison study has shown that the modified FastMap algorithm can produce better visualization results than the original FastMap algorithm.
机译:本文介绍了M-FastMap,这是一种改进的FastMap算法,用于数据挖掘中的可视集群验证。在使用FastMap进行可视集群验证时,首先使用聚类算法从数据库中生成集群。然后,使用FastMap算法将群集投影到2维(2D)或3维(3D)空间上,并在2D(或3D)显示器上以不同的颜色和/或符号可视化群集。通过显示,人类可以从视觉上检查簇的分离。此方法遵循以下原理:如果一个群集在投影的2D(或3D)空间中与其他群集分离,则它在原始的高维空间中也与其他群集分离(相反情况并非如此)。改进的FastMap算法通过在选择枢轴对象(或投影轴)时优化2D或(3D)空间上的群集分离来提高视觉群集验证的质量。比较研究表明,改进的FastMap算法比原始的FastMap算法可以产生更好的可视化结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号