首页> 外文会议>International Workshop on Database Technology and Applications >LILA: A Connected Components Labeling Algorithm in Grid-Based Clustering
【24h】

LILA: A Connected Components Labeling Algorithm in Grid-Based Clustering

机译:LILA:基于网格群集的连接组件标记算法

获取原文

摘要

Labeling the connected components in the feature space is an important step in grid based clustering algorithms in data mining. Although connected components labeling algorithms have been highly improved in image processing domain, there is little progress in grid based clustering in data mining domain. Two problems exist in transplanting these algorithms from image processing to data mining. One is how to process multi-dimensional dataset. The other is how to reduce the cost of auxiliary space. This paper describes an optimal two-scan Connected Components Labeling algorithm based that in image processing domain. It does not need auxiliary space, and easy to be extended to multi-dimension data set.
机译:标记要素空间中的连接组件是数据挖掘中基于网格的聚类算法的一个重要步骤。虽然在图像处理域中的连接组件标记算法已经高度改善,但数据挖掘域中基于网格的聚类几乎没有进展。将这些算法从图像处理移植到数据挖掘时存在两个问题。一个是如何处理多维数据集。另一个是如何降低辅助空间的成本。本文介绍了一种基于图像处理域中的最佳双扫描连接组件标记算法。它不需要辅助空间,易于扩展到多维数据集。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号