阈值优化的文本密度聚类算法  

Text density clustering algorithm with optimized threshold values

作　　者：马素琴[1] 施化吉[1] 

机构地区：[1]江苏大学计算机科学与通信工程学院,江苏镇江212013

出　　处：《计算机工程与应用》2011年第17期134-136,共3页Computer Engineering and Applications

基　　金：国家自然科学基金No.60841003;国家火炬计划项目(No.2004EB33006)~~

摘　　要：针对DBSCAN算法的聚类性能受全局阈值影响而降低的问题,提出一种阈值优化的文本密度聚类算法。该算法使用k-近邻距离对对象进行排序,通过分位数区分密度不同的各序列,找到与其对应的优化,根据优化阈值使用密度聚类方法对对象进行聚类。改进后的聚类算法克服了阈值选取对聚类结果影响的问题,提高了聚类精确度和时间效率。采用树形结构存储聚簇,增加了聚簇的可读性。实验结果证明了该算法的有效性。A text density clustering algorithm with the optimized threshold values is proposed to solve the problem of reduced clustering performance of the DBSCAN algorithm because of global threshold values.The proposed algorithm sorts objects with k-neighbor distance,and discerns arrays with different densities by quantile,and finds the corresponding optimization, then carries out clustering of objects using density clustering algorithm based on optimized threshold values.The advanced clustering algorithm has overcome the problem of reduced clustering performance caused by threshold values selection, and has improved clustering accuracy and efficiency.This paper stores clusters with tree structure, and has made clusters more legible.The experimental results show the effectiveness of this algorithm

关 键 词：文本挖掘 文本聚类 一个基于高密度连接区域的密度聚类方法 一种阈值优化的文本密度聚类算法 分位数 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]