NSL OpenIR  > 中国科学院文献情报中心(北京)  > 研究生
一种改进的K-means算法最佳聚类数确定方法
边鹏; 赵妍; 苏玉召
2011
Source Publication现代图书情报技术
Issue9Pages:34-40
KeywordK-means聚类 聚类数 文本聚类 推荐系统
Subject Area知识组织
Document Type期刊论文
Identifierhttp://ir.las.ac.cn/handle/12502/5095
Collection中国科学院文献情报中心(北京)_研究生
Recommended Citation
GB/T 7714
边鹏,赵妍,苏玉召. 一种改进的K-means算法最佳聚类数确定方法[J]. 现代图书情报技术,2011(9):34-40.
APA 边鹏,赵妍,&苏玉召.(2011).一种改进的K-means算法最佳聚类数确定方法.现代图书情报技术(9),34-40.
MLA 边鹏,et al."一种改进的K-means算法最佳聚类数确定方法".现代图书情报技术 .9(2011):34-40.
Files in This Item: Download All
File Name/Size DocType Version Access License
一种改进的K_means算法最佳聚类数确(749KB) 开放获取LicenseView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[边鹏]'s Articles
[赵妍]'s Articles
[苏玉召]'s Articles
Baidu academic
Similar articles in Baidu academic
[边鹏]'s Articles
[赵妍]'s Articles
[苏玉召]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[边鹏]'s Articles
[赵妍]'s Articles
[苏玉召]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: 一种改进的K_means算法最佳聚类数确定方法.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.