A.1D-C: A novel fast automatic heuristic to handle large-scale one-dimensional clustering

详细信息    查看全文

• 作者：Hassan Ismkhan ^{H.Ismkhan@bonabu.ac.ir esmkhan@gmail.com}Author Vitae
• 关键词：A.1D-C ; One-dimensional ; Number of clusters ; Array of integers ; New heuristic
• 刊名：Applied Soft Computing
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：52
• 期：Complete
• 页码：1200-1209
• 全文大小：1686 K
• 卷排序：52

文摘

This paper proposes an O (N × log N) algorithm for the one-dimensional clustering. F-Measure achieved by the A.1D-C is more than 0.98 for instances of sizes 10 000 000. The runtime of A.1D-C is a small fraction of a second for the input of size 100 000.