1 |
K.S. Al-sultan, A tabu search approach to the clustering problem, Pattern Recognition, 28 (1995) : 1443–1451
DOI
ScienceOn
|
2 |
강창완, 강현철, 데이터마이닝, 사이플러스, (2007)
|
3 |
허준, 정규상, 허수희, 최희경, Clementine 7 매뉴얼, 데이터 솔루션, (2003)
|
4 |
Temel Oncan, Jean-Francois Cordeau and Gilbert Laporte, A tabu search heuristic for the generalized minimum spanning tree problem, European Journal of Operational Research, 191 (2008) : 306–319
DOI
ScienceOn
|
5 |
Yongguo Liu, Zhang Yi, Hong Wua, Mao Ye and Kefei Chen, A tabu search approach for the minimum sum-of-squares clustering problem, Information Sciences,178 (2008) : 2680–2704
DOI
ScienceOn
|
6 |
Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R. and Wu, A.Y., An efficient k-means clustering algorithm: analysis and implementation, Pattern Analysis and Machine Intelligence, 24 (2002):881-892
DOI
ScienceOn
|
7 |
SPSS, Clementine 8.0 user's guide, SPSS, (2003)
|
8 |
Ordonez, C., Integrating K-means clustering with a relational DBMS using SQL, Knowledge and Data Engineering, 18 (2006) : 188 - 201
DOI
ScienceOn
|
9 |
Resnick, P., N. Iacovou, M. Suchak, P. Bergstrom and J. Riedl, Grouplens : An Open Architecture for Collaborative Filtering of Netnews, Proceedings of the ACM Conf. on Computer Supported Cooperative Work (1994), 175-186
DOI
|
10 |
박우창, 승현우, 용환승, 최기헌, 데이터마이닝 개념 및 기법, 자유아카데미, (2004)
|