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

      Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection

      , , ,
      ACM Transactions on Knowledge Discovery from Data
      Association for Computing Machinery (ACM)

      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.

          Related collections

          Most cited references99

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

          The meaning and use of the area under a receiver operating characteristic (ROC) curve.

          A representation and interpretation of the area under a receiver operating characteristic (ROC) curve obtained by the "rating" method, or by mathematical predictions based on patient characteristics, is presented. It is shown that in such a setting the area represents the probability that a randomly chosen diseased subject is (correctly) rated or ranked with greater suspicion than a randomly chosen non-diseased subject. Moreover, this probability of a correct ranking is the same quantity that is estimated by the already well-studied nonparametric Wilcoxon statistic. These two relationships are exploited to (a) provide rapid closed-form expressions for the approximate magnitude of the sampling variability, i.e., standard error that one uses to accompany the area under a smoothed ROC curve, (b) guide in determining the size of the sample required to provide a sufficiently reliable estimate of this area, and (c) determine how large sample sizes should be to ensure that one can statistically detect differences in the accuracy of diagnostic techniques.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Hierarchical clustering schemes.

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

              Survey of clustering algorithms.

              Data analysis plays an indispensable role for understanding various phenomena. Cluster analysis, primitive exploration with little or no prior knowledge, consists of research developed across a wide variety of communities. The diversity, on one hand, equips us with many tools. On the other hand, the profusion of options causes confusion. We survey clustering algorithms for data sets appearing in statistics, computer science, and machine learning, and illustrate their applications in some benchmark data sets, the traveling salesman problem, and bioinformatics, a new field attracting intensive efforts. Several tightly related topics, proximity measure, and cluster validation, are also discussed.
                Bookmark

                Author and article information

                Journal
                ACM Transactions on Knowledge Discovery from Data
                ACM Trans. Knowl. Discov. Data
                Association for Computing Machinery (ACM)
                15564681
                July 27 2015
                July 22 2015
                : 10
                : 1
                : 1-51
                Article
                10.1145/2733381
                1c5b2bee-c64f-4d1b-9c1a-760a51d19629
                © 2015

                http://www.acm.org/publications/policies/copyright_policy#Background

                History

                Comments

                Comment on this article