최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기응용통계연구 = The Korean journal of applied statistics, v.33 no.2, 2020년, pp.115 - 122
정상훈 (부산대학교 통계학과) , 배수현 (부산대학교 통계학과) , 김충락 (부산대학교 통계학과)
K-means clustering uses a spherical or elliptical metric to group data points; however, it does not work well for non-convex data such as the concentric circles. Spectral clustering, based on graph theory, is a generalized and robust technique to deal with non-standard type of data such as non-conve...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
Ben-Hur, A., Horn, D., Siegelmann, H. T., and Vapnik, V. (2001). Support vector clustering, Journal of Machine Learning Research, 2, 125-137.
Fiedler, M. (1973). Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, 23, 298-305
Fraley, C. and Raftery, A. E. (2002). Model-based clustering, discriminant analysis, and density estimation, Journal of the American Statistical Association, 97, 611-631.
Hastie, T., Tibshirani, R., and Friedman, J. (2008). The Elements of Statistical Learning (2nd Ed), Springer, New York.
Kim, C., Cheon, M., Kang, M., and Chang, I. (2008). A simple and exact Laplacian clustering of complex networking phenomena: Application to gene expression proles. In Proceedings of the National Academy of Science, 105, 4083-4087.
Le, C. M. and Levina, E. (2015). Estimating the number of components in networks by spectral methods, arXiv 1507.00827.
LeCun, Y., Bengio, Y., and Hinton, G. (2015). Deep learning, Nature, 521, 436-444.
Ng, A., Jordan, M., and Weiss, Y. (2002). On spectral clustering: analysis and an algorithm. Advances in Neural Information Processing Systems, 849?856, MIT Press.
Nie, F., Zeng, Z., Tsang, I. W., Xu, D., and Zhang, C. (2011). Spectral embedded clustering: A framework for in-sample and out-of-sample spectral clustering, IEEE Transactions on Neural Networks, 22, 1796-1808.
Tibshirani, R., Walther, G., and Hastie, T. (2001). Estimating the number of clusters in a dataset via the gap statistic. Journal of the Royal Statistical Society Series B, 63, 411-423.
von Luxburg, U. (2007). A tutorial on spectral clustering, Statistics and Computing, 17, 395-416.
Wang, Q., Qin, Z., Nie, F., and Li, X. (2019). Spectral embedded adaptive neighbors clustering, IEEE Transactions on Neural Networks and Learning Systems, 30, 1265-1271.
Xu, L., Neufeld, J., Larson, B., and Schuurmans, D. (2005). Maximum margin clustering, Advances in Neural Information Processing Systems, 1537-1544.
Zhang, K., Tsang, I. W., and Kwok, J. T. (2009). Maximum margin clustering made practical, IEEE Transactions on Neural Networks, 20, 583?596.
Zelnik-Manor, L. and Perona, P. (2005). Self-tuning spectral clustering, Advances in Neural Information Processing Systems, 1601-1608, MIT Press.
Zhou, G. T., Lan, T., Vahdat, A., and Mori, G. (2013). Latent maximum margin clustering, Advances in Neural Information Processing Systems, 28-36.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
오픈액세스 학술지에 출판된 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.