Journal of the Korean Data and Information Science Society

The Korean Data and Information Science Society (한국데이터정보과학회)
권호 표지
DOI QR코드

DOI QR Code

Classification of universities in Daegu·Gyungpook by support vector cluster analysis

서포트벡터 군집분석을 이용한 대구·경북지역 대학의 분류

  • Received : 2013.05.13
  • Accepted : 2013.07.01
  • Published : 2013.07.31
Download PDF
⟨ Previous Next ⟩

Abstract

There are sixteen indicators of "College Information" found on the website of College Information Disclosure Center. Among these indicators, the current study examined an enrollment rate and an employment rate based on health insurance coverage, and focused on twenty-four universities in Daegu and Gyeongbuk area. The universities were classified into groups by the enrollment rate and employment rate. This study investigated the characteristics pertaining to those different groups. Hierarchical cluster analysis and support vector cluster analysis were conducted in order to analyze the characteristics of the groups statistically.

본 논문에서는 대구 경북지역의 24개 4년제 대학교의 대학공시센터에 공시한 대학지표 자료를 사용하였다. 이들 대학지표들 중 재학생 충원률과 건강보험 취업률에 대한 지표를 이용하여 유사 특징을 가지고 있는 대학들을 그룹화 (분류)하여 그룹의 특징을 분석하는데 목적이 있다. SPSS의 계층적 군집분석과 서포트벡터 군집분석을 분석방법으로 활용하여 실험한 결과에서 공통으로 도출할 수 있는 정보를 구하였다.

Keywords

References

  1. Ben-Hur, A., Horn, D., Siegelmann, H. T. and Vapnik, V. (2001a). Support vector clustring. Journal of Machine Learning Research, 2, 125-137.
  2. Ben-Hur, A., Horn, D., Siegelmann, H. T. and Vapnik, V. (2001b). A support vector method for hierarchical clustering. In Advances in Neural Information Processing Systems, 13, MIT Press, New York.
  3. Hwang, C. (2011). Asymmetric least squares regression estimation using weighted least squares support vector machine. Journal of the Korean Data & Information Science Society, 22, 999-1005.
  4. Hwang, C. and Shim, J. (2012). Mixed effects least squares support vector machine for survival data analysis. Journal of the Korean Data & Information Science Society, 23, 739-748. https://doi.org/10.7465/jkdi.2012.23.4.739
  5. Kuhn, H. W. and Tucker, A. W. (1951). Nonlinear programming. Proceedings of 2nd Berkeley Symposium, University of California Press, Berkeley, 481-492.
  6. Lee, J. and Lee, D. (2005). An Improved cluster labeling method for support vector clustering. IEEE Transactions on Pattern Aanalysis and Machine Intelligence, 27, 461-464. https://doi.org/10.1109/TPAMI.2005.47
  7. Mercer, J. (1909). Functions of positive and negative type and their connection with the theory of integral equations. Philosophical Transactions of the Royal Society A, 415-446.
  8. Scholkopf, B., Platt, J., Shawe-Taylor, J., Smola, A. J. and Williamson, R. C. (2001). Estimating the support of a high-dimensional distribution. Neural Computation, 13, 1443-1472. https://doi.org/10.1162/089976601750264965
  9. Shim, J. and Seok, K. (2013). GACV for partially linear support vector regression. Journal of the Korean Data & Information Science Society, 24, 391-399. https://doi.org/10.7465/jkdi.2013.24.2.391
  10. Tax, D. M. J. and Duin, R. P. W. (1999). Support vector domain description. Pattern Recognition Letters, 20, 1191-1199. https://doi.org/10.1016/S0167-8655(99)00087-2
  11. Vapnik, V. (1995). The nature of statistical learning theory, Springer-Verlag, New York.
  12. Vapnik, V. (1998). Statistical learning theory, Springer, New York.
  13. Yang, J., Estivill-Castro, V. and Chalup, S. K. (2002). Support vector clustering through proximity graph modelling. Proceeding 9th International Conference, Neural Information Processing, 898-903.

Cited by

  1. Bounds of PIM-based similarity measures with partially marginal proportion vol.26, pp.4, 2015, https://doi.org/10.7465/jkdi.2015.26.4.857
  2. A study on the ordering of PIM family similarity measures without marginal probability vol.26, pp.2, 2015, https://doi.org/10.7465/jkdi.2015.26.2.367
  3. A study on the ordering of similarity measures with negative matches vol.26, pp.1, 2015, https://doi.org/10.7465/jkdi.2015.26.1.89
  4. 공식인구통계들에 대한 비교 분석 vol.28, pp.1, 2013, https://doi.org/10.7465/jkdi.2017.28.1.99