clustering method

  • 21Unweighted Pair Group Method with Arithmetic mean — (kurz UPGMA) bezeichnet eine Bottom Up Clustering Methode. Sie wird oft in der Bioinformatik zur Rekonstruktion phylogenetischer Bäume angewendet. Im Gegensatz zu anderen Verfahren wie Neighbour Joining basiert UPGMA auf der Annahme der… …

    Deutsch Wikipedia

  • 22Cluster analysis — The result of a cluster analysis shown as the coloring of the squares into three clusters. Cluster analysis or clustering is the task of assigning a set of objects into groups (called clusters) so that the objects in the same cluster are more… …

    Wikipedia

  • 23Nearest-neighbor chain algorithm — In the theory of cluster analysis, the nearest neighbor chain algorithm is a method that can be used to perform several types of agglomerative hierarchical clustering, using an amount of memory that is linear in the number of points to be… …

    Wikipedia

  • 24BRST algorithm — Boender Rinnooy Stougie Timmer algorithm (BRST) is an optimization algorithm suitable for finding global optimum of black box functions. In their paper Boender et al cite journal | author = Boender, C.G.E., A.H.G. Rinnooy Kan, L. Strougie and G.T …

    Wikipedia

  • 25Girvan-Newman algorithm — The Girvan Newman algorithm is one of the methods used to detect communities in complex systems.Girvan M. and Newman M. E. J., Proc. Natl. Acad. Sci. USA 99, 7821 7826 (2002)] The notion of a community structure is related to that of clustering,… …

    Wikipedia

  • 26Web query classification — Web query topic classification/categorization is a problem in information science. The task is to assign a Web search query to one or more predefined categories, based on its topics. The importance of query classification is underscored by many… …

    Wikipedia

  • 27Girvan–Newman algorithm — The Girvan–Newman algorithm (named after Michelle Girvan and Mark Newman) is one of the methods used to detect communities in complex systems.[1] The notion of a community structure is related to that of clustering, though it isn t quite the same …

    Wikipedia

  • 28Classification double — La Classification double ou « Biclustering » est une technique d exploration de données non supervisée permettant de segmenter simultanément les lignes et les colonnes d une matrice. Plus formellement[1], la définition de la… …

    Wikipédia en Français

  • 29Neighbor joining — This genetic distance map made in 2002 is an estimate of 18 world human groups by a neighbour joining method based on 23 kinds of genetic information. It was made by Saitou Naruya (斎藤成也? …

    Wikipedia

  • 30Fouille de flots de données — Exploration de données Articles principaux Exploration de données Fouille de données spatiales Fouille du web Fouille de flots de données Fouille de textes …

    Wikipédia en Français