메뉴 건너뛰기




Volumn 33, Issue 2, 2011, Pages 279-293

Coordination of cluster ensembles via exact methods

Author keywords

Clustering; combinatorial algorithms; constrained optimization; machine learning

Indexed keywords

ADJUSTED RAND INDEX; BENCHMARK DATA; CLUSTER ENSEMBLES; CLUSTERING; CLUSTERING PROBLEMS; COMBINATORIAL ALGORITHM; COMPUTATIONAL EXPERIMENT; EXACT METHODS; HIGH QUALITY; HIGH-QUALITY SOLUTIONS; INTRA-CLUSTER; K-MEANS; LOCAL MINIMUMS; MACHINE-LEARNING; NUMBER OF CLUSTERS; PROTOTYPE IMPLEMENTATIONS; SET COVERINGS; SUM OF SQUARES; TEST INSTANCES;

EID: 78650512354     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2010.85     Document Type: Article
Times cited : (37)

References (33)
  • 1
    • 0034819175 scopus 로고    scopus 로고
    • J-means: A new local search heuristic for minimum sum-of-squares clustering
    • Feb.
    • P. Hansen and N. Mladenovic, "J-Means: A New Local Search Heuristic for Minimum Sum-of-Squares Clustering," Pattern Recognition, vol. 34, no. 2, pp. 405-413, Feb. 2001.
    • (2001) Pattern Recognition , vol.34 , Issue.2 , pp. 405-413
    • Hansen, P.1    Mladenovic, N.2
  • 2
    • 33144460268 scopus 로고    scopus 로고
    • A genetic algorithm using hyper-quadtrees for low-dimensional k-means clustering
    • Apr.
    • M. Laszlo and S. Mukherjee, "A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-Means Clustering," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 4, pp. 533-543, Apr. 2006.
    • (2006) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.28 , Issue.4 , pp. 533-543
    • Laszlo, M.1    Mukherjee, S.2
  • 3
    • 7544240596 scopus 로고    scopus 로고
    • A scatter-search approach for the minimum-sum-of-squares clustering problem
    • May
    • J. Pacheco, "A Scatter-Search Approach for the Minimum-Sum-of- Squares Clustering Problem," Computers and Operations Research, vol. 32, no. 5, pp. 1325-1335, May 2005.
    • (2005) Computers and Operations Research , vol.32 , Issue.5 , pp. 1325-1335
    • Pacheco, J.1
  • 7
    • 36448962361 scopus 로고    scopus 로고
    • Cumulative voting consensus method for partitions with variable number of clusters
    • Jan.
    • H. Ayad and M. Kamel, "Cumulative Voting Consensus Method for Partitions with Variable Number of Clusters," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, no. 1, pp. 160-173, Jan. 2008.
    • (2008) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.30 , Issue.1 , pp. 160-173
    • Ayad, H.1    Kamel, M.2
  • 9
    • 0003495934 scopus 로고
    • Bagging predictors
    • Dept. of Statistics, Univ. of California at Berkeley
    • L. Breiman, "Bagging Predictors," Technical Report 421, Dept. of Statistics, Univ. of California at Berkeley, 1994.
    • (1994) Technical Report , vol.421
    • Breiman, L.1
  • 11
    • 0041965980 scopus 로고    scopus 로고
    • Cluster ensembles-a knowledge reuse framework for combining multiple partitions
    • A. Strehl and J. Ghosh, "Cluster Ensembles-A Knowledge ReUse Framework for Combining Multiple Partitions," J. Machine Learning Research, vol. 3, pp. 583-618, 2002.
    • (2002) J. Machine Learning Research , vol.3 , pp. 583-618
    • Strehl, A.1    Ghosh, J.2
  • 14
    • 33947159574 scopus 로고    scopus 로고
    • Evaluation of stability of k-means cluster ensembles with respect to random initializations
    • Nov.
    • L.I. Kuncheva and D.P. Vetrov, "Evaluation of Stability of K-Means Cluster Ensembles with Respect to Random Initializations," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 1798-1808, Nov. 2006.
    • (2006) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.28 , Issue.11 , pp. 1798-1808
    • Kuncheva, L.I.1    Vetrov, D.P.2
  • 16
    • 85162007256 scopus 로고    scopus 로고
    • Ensemble clustering using semidefinite programming
    • J.C. Platt D. Koller, Y. Singer, and S. Roweis, eds. MIT Press
    • V. Singh, L. Mukherjee, J. Peng, and J. Xu, "Ensemble Clustering Using Semidefinite Programming," Advances in Neural Information Processing Systems, J.C. Platt, D. Koller, Y. Singer, and S. Roweis, eds., pp. 1353-1360, MIT Press, 2008.
    • (2008) Advances in Neural Information Processing Systems , pp. 1353-1360
    • Singh, V.1    Mukherjee, L.2    Peng, J.3    Xu, J.4
  • 19
    • 0031390388 scopus 로고    scopus 로고
    • Variable neighborhood search for the p-median
    • P. Hansen and N. Mladenovic, "Variable Neighborhood Search for the P-Median," Location Science, vol. 5, no. 4, pp. 207-226, 1997.
    • (1997) Location Science , vol.5 , Issue.4 , pp. 207-226
    • Hansen, P.1    Mladenovic, N.2
  • 20
    • 2142808199 scopus 로고    scopus 로고
    • A hybrid heuristic for the p-median problem
    • M.G.C. Resende and R.F. Werneck, "A Hybrid Heuristic for the P-Median Problem," J. Heuristics, vol. 10, pp. 59-88, 2004.
    • (2004) J. Heuristics , vol.10 , pp. 59-88
    • Resende, M.G.C.1    Werneck, R.F.2
  • 21
    • 0001820920 scopus 로고    scopus 로고
    • X-Means: Extending K-Means with efficient estimation of the number of clusters
    • D. Pelleg and A. Moore, "X-Means: Extending K-Means with Efficient Estimation of the Number of Clusters," Proc. 17th Int'l Conf. Machine Learning, pp. 727-734, 2000.
    • (2000) Proc. 17th Int'l Conf. Machine Learning , pp. 727-734
    • Pelleg, D.1    Moore, A.2
  • 22
    • 0033296944 scopus 로고    scopus 로고
    • An interior point algorithm for minimum sum of squares clustering
    • Mar.
    • O. du Merle, P. Hansen, B. Jaumard, and N. Mladenovich, "An Interior Point Algorithm for Minimum Sum of Squares Clustering," SIAM J. Scientific Computing, vol. 21, no. 4, pp. 1484-1505, Mar. 2000.
    • (2000) SIAM J. Scientific Computing , vol.21 , Issue.4 , pp. 1484-1505
    • Du Merle, O.1    Hansen, P.2    Jaumard, B.3    Mladenovich, N.4
  • 23
    • 0000950204 scopus 로고    scopus 로고
    • Cluster analysis and mathematical programming
    • P. Hansen and B. Jaumard, "Cluster Analysis and Mathematical Programming," Math. Programming, vol. 79, pp. 191-215, 1997.
    • (1997) Math. Programming , vol.79 , pp. 191-215
    • Hansen, P.1    Jaumard, B.2
  • 25
    • 0001391104 scopus 로고
    • Decomposition principle for linear programs
    • G.B. Dantzig and P. Wolfe, "Decomposition Principle for Linear Programs," Operations Research, vol. 8, no. 1, pp. 101-111, 1960.
    • (1960) Operations Research , vol.8 , Issue.1 , pp. 101-111
    • Dantzig, G.B.1    Wolfe, P.2
  • 28
    • 39449128529 scopus 로고    scopus 로고
    • A new theoretical framework for K-means-type clustering
    • W. Chu and T.Y. Lin, eds. Springer
    • J. Peng and Y. Xia, "A New Theoretical Framework for K-Means-Type Clustering," Foundations and Advances in Data Mining, W. Chu and T.Y. Lin, eds., pp. 79-95, Springer, 2005.
    • (2005) Foundations and Advances in Data Mining , pp. 79-95
    • Peng, J.1    Xia, Y.2
  • 29
    • 0032202775 scopus 로고    scopus 로고
    • Deterministic annealing for clustering, compression, classification, regression and related optimization problems
    • Aug.
    • K. Rose, "Deterministic Annealing for Clustering, Compression, Classification, Regression and Related Optimization Problems," Proc. IEEE, vol. 86, no. 11, pp. 2210-2239, Aug. 1998.
    • (1998) Proc. IEEE , vol.86 , Issue.11 , pp. 2210-2239
    • Rose, K.1
  • 31
    • 0003140078 scopus 로고
    • Toward practical 'neural' computation for combinatorial optimization problems
    • J. Denker, ed., Am. Inst. of Physics
    • E.B. Baum, "Toward Practical 'Neural' Computation for Combinatorial Optimization Problems," Neural Networks for Computing, J. Denker, ed., Am. Inst. of Physics, 1986.
    • (1986) Neural Networks for Computing
    • Baum, E.B.1
  • 32
    • 0034538133 scopus 로고    scopus 로고
    • Multi-level k-way hyper-graph partitioning
    • G. Karypis and V. Kumar, "Multi-Level k-Way Hyper-Graph Partitioning," VLSI Design, vol. 11, no. 3, pp. 285-300, 2000.
    • (2000) VLSI Design , vol.11 , Issue.3 , pp. 285-300
    • Karypis, G.1    Kumar, V.2
  • 33
    • 33947416736 scopus 로고    scopus 로고
    • Decomposition algorithms for communication minimization in parallel computing
    • P.M. Pardalos and L. Pitsoulis, eds. Kluwer Academic Publishers
    • I.T. Christou and R.R. Meyer, "Decomposition Algorithms for Communication Minimization in Parallel Computing," Non-Linear Assignment Problems Theory and Practice, P.M. Pardalos and L. Pitsoulis, eds., Kluwer Academic Publishers, 2000.
    • (2000) Non-Linear Assignment Problems Theory and Practice
    • Christou, I.T.1    Meyer, R.R.2


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