References

  1. K. Pearson (1901). On lines and planes of closest fit to systems of points in space. Philosophical Magazine, 2:559–572.
  2. A. D. Back (1997). "A first application of independent component analysis to extracting structure from stock returns," Neural Systems, vol. 8, no. 4, pp. 473–484.
  3. Tipping ME, Bishop CM (1999). Probabilistic principal component analysis. Journal of the Royal Statistical Society, Series B, 61(3):611–622. 10.1111/1467-9868.00196
  4. Sanjoy Dasgupta (2000). Experiments with random projection. In Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence (UAI'00), Craig Boutilier and Moisés Goldszmidt (Eds.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 143-151.
  5. T. Cox and M. Cox (2001). Multidimensional Scaling. Chapman Hall, Boca Raton, 2nd edition.
  6. Bernhard Schoelkopf, Alexander J. Smola, and Klaus-Robert Mueller (1999). Kernel principal component analysis. In Advances in kernel methods, MIT Press, Cambridge, MA, USA 327-352.
  7. Tenenbaum, J.B.; De Silva, V.; & Langford, J.C (2000).A global geometric framework for nonlinear dimensionality reduction. Science. Vol. 290, Issue 5500, pp. 2319-2323
  8. M. Belkin and P. Niyogi (2003). Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373–1396.
  9. S. Roweis and L. Saul (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290:2323–2326.
  10. Hartigan, J. and Wong, M (1979). Algorithm AS136: A k-means clustering algorithm. Applied Statistics, 28, 100-108.
  11. Dorin Comaniciu and Peter Meer (2002). Mean Shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence pp. 603-619.
  12. Hierarchical Clustering Jain, A. and Dubes, R (1988). Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs, NJ.
  13. Mclachlan, G. and Basford, K (1988). Mixture Models: Inference and Applications to Clustering. Marcel Dekker, New York, NY
  14. Ester, M., Kriegel, H-P., Sander, J. and Xu, X (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd ACM SIGKDD, 226-231, Portland, Oregon.
  15. Y. Ng, M. I. Jordan, and Y. Weiss (2001). On spectral clustering: Analysis and an algorithm, in Advances in Neural Information Processing Systems. MIT Press, pp. 849–856.
  16. Delbert Dueck and Brendan J. Frey (2007). Non-metric affinity propagation for unsupervised image categorization. In IEEE Int. Conf. Computer Vision (ICCV), pages 1–8.
  17. Teuvo Kohonen (2001). Self-Organizing Map. Springer, Berlin, Heidelberg. 1995.Third, Extended Edition.
  18. M. Halkidi, Y. Batistakis, and M. Vazirgiannis (2001). On clustering validation techniques, J. Intell. Inf. Syst., vol. 17, pp. 107–145.
  19. M. Markou, S. Singh (2003). Novelty detection: a review – part 1: statistical approaches, Signal Process. 83 (12) 2481–2497
  20. Byers, S. D. AND Raftery, A. E (1998). Nearest neighbor clutter removal for estimating features in spatial point processes. J. Amer. Statis. Assoc. 93, 577–584.
  21. Breunig, M. M., Kriegel, H.-P., Ng, R. T., AND Sander, J (1999). Optics-of: Identifying local outliers. In Proceedings of the 3rd European Conference on Principles of Data Mining and Knowledge Discovery. Springer-Verlag, 262–270.
  22. Brito, M. R., Chavez, E. L., Quiroz, A. J., AND yukich, J. E (1997). Connectivity of the mutual k-nearest neighbor graph in clustering and outlier detection. Statis. Prob. Lett. 35, 1, 33–42.
  23. Aggarwal C and Yu P S (2000). Outlier detection for high dimensional data. In Proc ACM SIGMOD International Conference on Management of Data (SIGMOD), Dallas, TX.
  24. Ghoting, A., Parthasarathy, S., and Otey, M (2006). Fast mining of distance-based outliers in high dimensional spaces In Proceedings SIAM Int Conf on Data Mining (SDM) Bethesda ML dimensional spaces. In Proc. SIAM Int. Conf. on Data Mining (SDM), Bethesda, ML.
  25. Kriegel, H.-P., Schubert, M., and Zimek, A (2008). Angle-based outlier detection, In Proceedings ACM SIGKDD Int. Conf on Knowledge Discovery and Data Mining (SIGKDD) Las Vegas NV Conf. on Knowledge Discovery and Data Mining (SIGKDD), Las Vegas, NV.
  26. Schoelkopf, B., Platt, J. C., Shawe-Taylor, J. C., Smola, A. J., AND Williamson, R. C (2001). Estimating the support of a high-dimensional distribution. Neural Comput. 13, 7, 1443–1471.
  27. F Pedregosa, et al. Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 2825-2830.
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.144.93.222