clustering analysis

  • 51Nearest-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

  • 52Non-negative matrix factorization — NMF redirects here. For the bridge convention, see new minor forcing. Non negative matrix factorization (NMF) is a group of algorithms in multivariate analysis and linear algebra where a matrix, , is factorized into (usually) two matrices, and… …

    Wikipedia

  • 53cosmos — /koz meuhs, mohs/, n., pl. cosmos, cosmoses for 2, 4. 1. the world or universe regarded as an orderly, harmonious system. 2. a complete, orderly, harmonious system. 3. order; harmony. 4. any composite plant of the genus Cosmos, of tropical… …

    Universalium

  • 54K-means algorithm — The k means algorithm is an algorithm to cluster n objects based on attributes into k partitions, k < n. It is similar to the expectation maximization algorithm for mixtures of Gaussians in that they both attempt to find the centers of natural&#8230; …

    Wikipedia

  • 55Granular computing — is an emerging computing paradigm of information processing. It concerns the processing of complex information entities called information granules, which arise in the process of data abstraction and derivation of knowledge from information.&#8230; …

    Wikipedia

  • 56Кластерный анализ — Для улучшения этой статьи&#160;по математике желательно?: Проставив сноски, внести более точные указания на источники. Исправить статью согласно стилистическим правилам Википедии. Переработать офо …

    Википедия

  • 57Glossaire du data mining — 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

  • 58Classification double — La Classification double ou «&#160;Biclustering&#160;» 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&#8230; …

    Wikipédia en Français

  • 59CrimeStat — Primary File page of CrimeStat CrimeStat is a Windows based spatial statistic software program that conducts spatial and statistical analysis and is designed to interface with a Geographic Information System. The program is developed by Ned&#8230; …

    Wikipedia

  • 602-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all&#8230; …

    Wikipedia