只開了個頭……
google scholar自動生成APA引用真好用啊真好用……
之後在博客園寫長文果斷先寫markdown轉換成HTML本身改 自帶的CMS好蛋疼……(教練 我要本身建博!=。=)html
-------------------------------web
Jain, A. K. (2010). Data clustering: 50 years beyond K-means. Pattern Recognition Letters, 31(8), 651-666.
不知爲什麼404了……搜一搜仍是能在其餘地方找到的
http://www.cs.msu.edu/~cse802/notes/JainDataClusteringPRL09.pdf算法
Matteo Matteucci的tutorial
http://home.deib.polimi.it/matteucc/Clustering/tutorial_html/index.htmlshell
四種聚類算法及其mahout用例
探索推薦引擎內部的祕密,第 3 部分: 深刻推薦引擎相關算法 - 聚類
http://www.ibm.com/developerworks/cn/web/1103_zhaoct_recommstudy3/index.htmlapache
Carlos Guestrin的一個slides
http://www.cs.cmu.edu/~guestrin/Class/10701-S07/Slides/clustering.pdfmarkdown
Segaran, T. (2007). Programming collective intelligence: building smart web 2.0 applications. O'Reilly Media.
http://www.amazon.com/dp/0596529325app
《Data Clustering and Pattern Recognition (資料分羣與樣式辨認)》 by Roger Jang (張智星)
http://neural.cs.nthu.edu.tw/jang/books/dcpr/index.aspide
Google: Cluster Computing and MapReduce,原來的網址404了,這是pku的鏡像,視頻還在管子上
http://net.pku.edu.cn/~course/cs501/2008/resource/mapreduce-minilecture/listing.htmloop
Andrew Ng在Coursera上鼎鼎大名的的ML課程,目前在新一輪的課程裏貌似還沒講到clustering,不過網上不少保存下來的之前的資料
https://www.coursera.org/course/ml學習
MacKay, D. J. (2003). Information theory, inference and learning algorithms. Cambridge university press.
http://www.inference.phy.cam.ac.uk/mackay/itila/book.html
------------------------------------------------------------
k-means中英維基
http://en.wikipedia.org/wiki/K-means_clustering
http://zh.wikipedia.org/wiki/K%E5%B9%B3%E5%9D%87%E7%AE%97%E6%B3%95
DEMO(須要JRE)
http://home.deib.polimi.it/matteucc/Clustering/tutorial_html/AppletKM.html
pluskid的博文
http://blog.pluskid.org/?p=17
coolshell上的k-means簡介
http://coolshell.cn/articles/7779.html
mahout wiki上的簡介
https://cwiki.apache.org/confluence/display/MAHOUT/K-Means+Clustering
Matteo Matteucci的文章
http://home.deib.polimi.it/matteucc/Clustering/tutorial_html/kmeans.html
張智星的文章
http://neural.cs.nthu.edu.tw/jang/books/dcpr/dcKMeans.asp?title=3-3%20K-means%20Clustering
Coates, A., & Ng, A. Y. (2012). Learning feature representations with k-means. In Neural Networks: Tricks of the Trade (pp. 561-580). Springer Berlin Heidelberg.
http://www.stanford.edu/~acoates/papers/coatesng_nntot2012.pdf
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002). An efficient k-means clustering algorithm: Analysis and implementation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 24(7), 881-892.
https://www.lri.fr/~antoine/Courses/Master-ISI/TD-TP/sujets_2009/pami02.pdf
目前整理的思惟導圖,待續(複製圖片連接到地址欄查看大圖)
------------------------------------------------------------
DEMO(須要JRE)
http://home.deib.polimi.it/matteucc/Clustering/tutorial_html/AppletFCM.html
維基
http://en.wikipedia.org/wiki/Fuzzy_clustering#Fuzzy_c-means_clustering
Matteo Matteucci的文章
http://home.deib.polimi.it/matteucc/Clustering/tutorial_html/cmeans.html
思惟導圖
------------------------------------------------------------
Matteo Matteucci的文章
http://home.deib.polimi.it/matteucc/Clustering/tutorial_html/hierarchical.html
思惟導圖
------------------------------------------------------------
使用hadoop的樣例代碼
http://code.google.com/p/canopy-clustering/
提出該算法的paper
McCallum, A., Nigam, K., & Ungar, L. H. (2000, August). Efficient clustering of high-dimensional data sets with application to reference matching. InProceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 169-178). ACM.
http://www.kamalnigam.com/papers/canopy-kdd00.pdf
------------------------------------------------------------
pluskid的博文
http://blog.pluskid.org/?p=39
Matteo Matteucci的文章
http://home.deib.polimi.it/matteucc/Clustering/tutorial_html/mixture.html
維基的Mixture Model詞條
http://en.wikipedia.org/wiki/Mixture_model
------------------------------------------------------------
維基
http://en.wikipedia.org/wiki/Expectation-maximization_algorithm