Re:Top Algorithms in Data Mining (2008) [pdf]
by micro_cam on Sunday March 23, 2014 @01:45PM
(#7454222)
PageRank is a similar eigenvalue based algorithm and I think PCA can be seen as a relaxation of k-means so they sort of did.
But yes, if i wrote the list it eigenvector based methods would be more prominent.
Also If I wrote it the tree based methods would have been replaced with random forests which are similar to CART but use the crucial ideas of sample bagging and random feature subsets which have proven themselves over and over.
I think it may just be out of date.
Re:Top Algorithms in Data Mining (2008) [pdf]
by jessaustin on Sunday March 23, 2014 @02:18PM
(#7454345)
Any suggestions for something more recent?
Re:Top Algorithms in Data Mining (2008) [pdf]
by micro_cam on Sunday March 23, 2014 @04:37PM
(#7455035)
The machine learning reddit recently started a faq:
http://www.reddit.com/r/MachineLearning/comments/20i0vi/meta...
They also have a good selection of articles though they tend to be somewhat deep learning/neural network focused. These algorithms have seen a big surge in interest and success of late but may not be as applicable to "data mining" (as opposed to say image or speech recognition).
I think PCA is better understood in theorem-proof style of mathematics rather than algorithmically. For example, PCA can be understood as an optimization problem. Whereas CART and k-NN and the likes are best understood algorithmically. I know k-NN was introduced as an algorithm and only later figured out in terms of probability, etc..
Algorithmically, it's just finding an eigensystem...
Is this an artifact of how the list was put together or is clustering really that much more common than feature extraction? Is PCA thought to be too trivial to qualify?