메뉴 건너뛰기




Volumn 8621 LNCS, Issue , 2014, Pages 32-41

Balanced k-means for clustering

Author keywords

assignment problem; balanced clustering; clustering; Hungarian algorithm

Indexed keywords

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING; PATTERN RECOGNITION; SYNTACTICS;

EID: 84906314498     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-44415-3_4     Document Type: Conference Paper
Times cited : (163)

References (24)
  • 1
    • 62249143532 scopus 로고    scopus 로고
    • NP-hardness of Euclidean sumof- squares clustering
    • Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sumof- squares clustering. Mach. Learn. 75, 245-248 (2009)
    • (2009) Mach. Learn. , vol.75 , pp. 245-248
    • Aloise, D.1    Deshpande, A.2    Hansen, P.3    Popat, P.4
  • 2
    • 84943144844 scopus 로고    scopus 로고
    • Balanced clustering for content-based image browsing
    • Gesellschaft für Informatik e.V. March
    • Althoff, C.T., Ulges, A., Dengel, A.: Balanced clustering for content-based image browsing. In: GI-Informatiktage 2011. Gesellschaft für Informatik e.V. (March 2011)
    • (2011) GI-Informatiktage 2011
    • Althoff, C.T.1    Ulges, A.2    Dengel, A.3
  • 5
    • 2542583128 scopus 로고    scopus 로고
    • Frequency sensitive competitive learning for balanced clustering on high-dimensional hyperspheres
    • Banerjee, A., Ghosh, J.: Frequency sensitive competitive learning for balanced clustering on high-dimensional hyperspheres. IEEE Transactions on Neural Networks 15, 719 (2004)
    • (2004) IEEE Transactions on Neural Networks , vol.15 , pp. 719
    • Banerjee, A.1    Ghosh, J.2
  • 11
    • 0034345982 scopus 로고    scopus 로고
    • Randomized local search algorithm for the clustering problem
    • Fränti, P., Kivijärvi, J.: Randomized local search algorithm for the clustering problem. Pattern Anal. Appl. 3(4), 358-369 (2000)
    • (2000) Pattern Anal. Appl. , vol.3 , Issue.4 , pp. 358-369
    • Fränti, P.1    Kivijärvi, J.2
  • 12
    • 33244462619 scopus 로고    scopus 로고
    • Iterative shrinking method for clustering problems
    • Fränti, P., Virmajoki, O.: Iterative shrinking method for clustering problems. Pattern Recognition 39(5), 761-765 (2006)
    • (2006) Pattern Recognition , vol.39 , Issue.5 , pp. 761-765
    • Fränti, P.1    Virmajoki, O.2
  • 14
    • 0026925324 scopus 로고
    • New spectral methods for ratio cut partitioning and clustering
    • Hagen, L., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on Computer-Aided Design 11(9), 1074-1085 (1992)
    • (1992) IEEE Transactions on Computer-Aided Design , vol.11 , Issue.9 , pp. 1074-1085
    • Hagen, L.1    Kahng, A.B.2
  • 15
    • 51249181779 scopus 로고
    • A new polynomial time algorithm for linear programming
    • Karmarkar, N.: A new polynomial time algorithm for linear programming. Combinatorica 4(4), 373-395 (1984)
    • (1984) Combinatorica , vol.4 , Issue.4 , pp. 373-395
    • Karmarkar, N.1
  • 16
    • 78649320961 scopus 로고    scopus 로고
    • Submodular fractional programming for balanced clustering
    • Kawahara, Y., Nagano, K., Okamoto, Y.: Submodular fractional programming for balanced clustering. Pattern Recognition Letters 32(2), 235-243 (2011)
    • (2011) Pattern Recognition Letters , vol.32 , Issue.2 , pp. 235-243
    • Kawahara, Y.1    Nagano, K.2    Okamoto, Y.3
  • 17
    • 84875749929 scopus 로고    scopus 로고
    • Load-balanced clustering algorithm with distributed self-organization forwireless sensor networks
    • Liao, Y., Qi, H., Li, W.: Load-Balanced Clustering Algorithm With Distributed Self-Organization forWireless Sensor Networks. IEEE Sensors Journal 13(5), 1498-1506 (2013)
    • (2013) IEEE Sensors Journal , vol.13 , Issue.5 , pp. 1498-1506
    • Liao, Y.1    Qi, H.2    Li, W.3
  • 18
  • 19
    • 0001457509 scopus 로고
    • Some methods of classification and analysis of multivariate observations
    • MacQueen, J.: Some methods of classification and analysis of multivariate observations. In: Proc. 5th Berkeley Symp. Mathemat. Statist. Probability, vol. 1, pp. 281-296 (1967)
    • (1967) Proc. 5th Berkeley Symp. Mathemat. Statist. Probability , vol.1 , pp. 281-296
    • Macqueen, J.1
  • 20
    • 84865241978 scopus 로고    scopus 로고
    • Optimization of non-linear multiple traveling salesman problem using k-means clustering, shrink wrap algorithm and meta-heuristics
    • Nallusamy, R., Duraiswamy, K., Dhanalaksmi, R., Parthiban, P.: Optimization of non-linear multiple traveling salesman problem using k-means clustering, shrink wrap algorithm and meta-heuristics. International Journal of Nonlinear Science 9(2), 171-177 (2010)
    • (2010) International Journal of Nonlinear Science , vol.9 , Issue.2 , pp. 171-177
    • Nallusamy, R.1    Duraiswamy, K.2    Dhanalaksmi, R.3    Parthiban, P.4
  • 21
  • 22
    • 65749311215 scopus 로고
    • Karmarkars algorithm and its place in applied mathematics
    • Strang, G.: Karmarkars algorithm and its place in applied mathematics. The Mathematical Intelligencer 9(2), 4-10 (1987)
    • (1987) The Mathematical Intelligencer , vol.9 , Issue.2 , pp. 4-10
    • Strang, G.1
  • 24
    • 77957894729 scopus 로고    scopus 로고
    • Data clustering with size constraints
    • Zhu, S., Wang, D., Li, T.: Data clustering with size constraints. Knowledge-Based Systems 23(8), 883-889 (2010)
    • (2010) Knowledge-Based Systems , vol.23 , Issue.8 , pp. 883-889
    • Zhu, S.1    Wang, D.2    Li, T.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.