计算机工程与应用Issue(11):58-61,4.DOI:10.3778/j.issn.1002-8331.1208-0001
Binary-Positive下的并行化CURE算法
Parallel CURE algorithm with Binary-Positive
摘要
Abstract
For random sampling is not representative, it proposes a robust parallel improvement of algorithms when using CURE algorithm to handle non-uniform mass data. It uses the Binary-Positive algorithm to get the effective properties of the data, uses valid data for hierarchical clustering with MapReduce, which is a distributed parallel framework. It achieves the correct rate and efficiency of a trade-off. The tests show that the improved CURE algorithm has a higher efficiency in the implementation and has a good clustering result.关键词
聚类/利用代表点聚类(CURE)/Binary-Positive/MapReduce/并行Key words
clustering/Clustering Using Representative(CURE)/Binary-Positive/MapReduce/parallel分类
信息技术与安全科学引用本文复制引用
王民,尹超,王稚慧,要趁红,高婧..Binary-Positive下的并行化CURE算法[J].计算机工程与应用,2014,(11):58-61,4.基金项目
国家自然科学基金(No.61073196);陕西省教育厅专项科研计划项目基金(No.11JK0982)。 ()