摘要
本文分析了Web信息搜索中的Leader算法其聚类结果中可能存在重叠区域;k-means算法其k参数的确定可能需要多次尝试。结合上述二种聚类分析算法提出将Leader算法和k-means算法融合可以同时解决上述问题,且在实际的Web信息搜索中更能体现聚类分析的优势。
Analyzes Web in the information search in the Leader algorithm its duster result possibly to have the overlap region; k-means algorithm its k parameter determination possibly needs to attempt many times. Unifies above two kind of duster parsing algorithm to propose may simultaneously solve the Leader algorithm and the k-means algorithm fusion the above question, also can manifest the duster analysis in the actual Web information search the superiority.
出处
《电脑与电信》
2007年第6期53-56,共4页
Computer & Telecommunication
