« BIRCH » : différence entre les versions

Version du 25 mai 2021 à 09:56

Algorithme d'exploration de données non supervisé utilisé pour la classification hiérarchique de volumes de données particulièrement importants.

BIRCH

algorithme BIRCH

BIRCH

balanced iterative reducing and clustering using hierarchies

@@ Ligne 1 : / Ligne 1 : @@
-==en construction==
 ==Définition==
-XXXXXXXXX
+[[Algorithme]] d'[[exploration de données]] non supervisé utilisé pour la [[classification hiérarchique]] de volumes de données particulièrement importants.
 ==Français==
-''' XXXXXXXXX '''
+'''BIRCH'''
+'''algorithme BIRCH'''
 ==Anglais==
-''' BIRCH'''
+'''BIRCH'''
+'''balanced iterative reducing and clustering using hierarchies'''
-BIRCH (balanced iterative reducing and clustering using hierarchies) is an unsupervised data mining algorithm used to perform hierarchical clustering over particularly large data-sets.[1] An advantage of BIRCH is its ability to incrementally and dynamically cluster incoming, multi-dimensional metric data points in an attempt to produce the best quality clustering for a given set of resources (memory and time constraints). In most cases, BIRCH only requires a single scan of the database.
-Its inventors claim BIRCH to be the "first clustering algorithm proposed in the database area to handle 'noise' (data points that are not part of the underlying pattern) effectively",[1] beating DBSCAN by two months. The algorithm received the SIGMOD 10 year test of time award in 2006.[2]
 <small>
-[https://en.wikipedia.org/wiki/BIRCHSource : Wikipedia  Machine Learning]
+[https://en.wikipedia.org/wiki/BIRCH  Source : Wikipedia (BIRCH) ]
 [[Catégorie:vocabulary]]
 [[Catégorie:Wikipedia-IA‎]]