无监督学习(Unsupervised Learning, Clustering)
摘要:
聚类-Greedy Method 1: For each point p 2: Finds the cluster center q such that D(p, q) is minimum 3: If D(p, q) < d then 4: p is added to the cluster whose center is q 5: Else 6: A new cluster with center p is formedEM Algorithm(Expectation Maximization)第一... 阅读全文
posted @ 2013-06-09 13:37 yuer5 阅读(170) 评论(0) 推荐(0)
浙公网安备 33010602011771号