25
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      NP-hardness of Euclidean sum-of-squares clustering

      , , ,

      Machine Learning

      Springer Nature

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Most cited references 6

          • Record: found
          • Abstract: not found
          • Article: not found

          Clustering Large Graphs via the Singular Value Decomposition

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Cluster analysis and mathematical programming

              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              The Effectiveness of Lloyd-Type Methods for the k-Means Problem

                Bookmark

                Author and article information

                Journal
                Machine Learning
                Mach Learn
                Springer Nature
                0885-6125
                1573-0565
                May 2009
                January 2009
                : 75
                : 2
                : 245-248
                Article
                10.1007/s10994-009-5103-0
                © 2009
                Product

                Comments

                Comment on this article