返回
A new shifting grid clustering algorithm
DOI:10.1016/j.patcog.2003.08.014.png)
摘要
En 中文
A new density- and grid-based type clustering algorithm using the concept of shifting grid is proposed. The proposed algorithm is a non-parametric type, which does not require users inputting parameters. It divides each dimension of the data space into certain intervals to form a grid structure in the data space. Based on the concept of sliding window, shifting of the whole grid structure is introduced to obtain a more descriptive density profile. As a result, we are able to enhance the accuracy of the results. Compared with many conventional algorithms, this algorithm is computational efficient because it clusters data in a way of cell rather than in points. (C) 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
clustering
shifting grid
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
External pH regulates the slowly activating potassium current IsK expressed in Xenopus oocytes
FEBS Letters
IF0
Diseases of the tooth: the genetic and molecular basis of inherited anomalies affecting the dentition牙齿疾病: 影响牙列的遗传异常的遗传和分子基础

