Clustering by CP-QR

摘要：

This paper concerns a novel method to deal with data clustering, which is called completely positive factorizations combined with QR decomposition. We first introduce the concept of completely positive matrices and then the (0,1) CP factorizations, by which some recent work on the linear clustering and the number of the clusters in this case is initialized. A detailed CP-QR algorithm is presented, and its advantage over NMF method is illustrated by an example.

关键词： Clustering Completely Positive Factorization Similarity Matrix (0,1)-CP QR decomposition.

作者: Changqing Xu Jiejie Jiao Hailong Hu Chuanlong Huangbin

作者单位: Depart. Of Mathematics, School of Sciences, Zhejiang A&F University School Of Environment and Resour School Of Environment and Resources, Zhejiang A&F University LinAn, Hangzhou, 311300 China Depart. Of Mathematics, School of Sciences, Zhejiang A&F University

会议类型: 国际会议

会议名称: 2011 4th International Conference on Biomedical Engineering and Informatics(第四届生物医学工程与信息学国际会议 BMEI 2011)

会议地点: 上海

会议语种:英文

页码: 189-193

在线出版日期: 2011-10-15（万方平台首次上网日期，不代表论文的发表时间）