Maier's theorem: Difference between revisions
BettGrammar |
en>K9re11 mNo edit summary |
||
| Line 1: | Line 1: | ||
'''BIRCH''' (balanced iterative reducing and clustering using hierarchies) is an unsupervised [[data mining]] algorithm used to perform [[Data clustering|hierarchical clustering]] over particularly large data-sets. An advantage of Birch is its ability to incrementally and dynamically cluster incoming, multi-dimensional metric [[data point]]s in an attempt to produce the best quality clustering for a given set of resources (memory and [[time constraint]]s). In most cases, Birch only requires a single scan of the database. In addition, Birch is recognized<ref>{{Literatur | |||
| Autor = Tian Zhang, Raghu Ramakrishnan, Miron Livny | |||
| Titel = An Efficient Data Clustering Method for Very Large Databases | |||
}}</ref> as the, "first clustering algorithm proposed in the database area to handle 'noise' (data points that are not part of the underlying pattern) effectively". | |||
==Problem with previous methods== | |||
Previous clustering algorithms performed less effectively over very large databases and did not adequately consider the case wherein a data-set was too large to fit in [[Primary storage|main memory]]. As a result, there was a lot of overhead maintaining high clustering quality while minimizing the cost of addition IO (input/output) operations. Furthermore, most of Birch's predecessors inspect all data points (or all currently existing clusters) equally for each 'clustering decision' and do not perform heuristic weighting based on the distance between these data points. | |||
==Advantages with BIRCH== | |||
It is local in that each clustering decision is made without scanning all data points and currently existing clusters. | |||
It exploits the observation that data space is not usually uniformly occupied and not every data point is equally important. | |||
It makes full use of available memory to derive the finest possible sub-clusters while minimizing I/O costs. | |||
It is also an incremental method that does not require the whole [[data set]] in advance. | |||
==BIRCH Clustering Algorithm== | |||
Given a set of N d-dimensional data points, the '''clustering feature''' <math>CF</math> of the set is defined as the triple <math>CF = (N,LS,SS)</math>, where <math>LS</math> is the linear sum and <math>SS</math> is the square sum of data points. | |||
Clustering features are organized in a '''CF tree''', which is a height [[Self-balancing binary search tree|balanced tree]] with two parameters: [[branching factor]] <math>B</math> and threshold <math>T</math>. Each non-leaf node contains at most <math>B</math> entries of the form <math>[CF_i,child_i]</math>, where <math>child_i</math> is a pointer to its <math>i</math>th [[Tree (data structure)|child node]] and <math>CF_i</math> the clustering feature representing the associated subcluster. A [[leaf node]] contains at most <math>L</math> entries each of the form <math>[CF_i]</math> . It also has two pointers prev and next which are used to chain all leaf nodes together. The tree size depends on the parameter T. A node is required to fit in a page of size P. B and L are determined by P. So P can be varied for [[performance tuning]]. It is a very compact representation of the dataset because each entry in a leaf node is not a single data point but a subcluster. | |||
In the algorithm in the first step it scans all data and builds an initial memory CF tree using the given amount of memory. In the second step it scans all the leaf entries in the initial CF tree to rebuild a smaller CF tree, while removing outliers and grouping crowded subclusters into larger ones. In step three an existing clustering algorithm is used to cluster all leaf entries. Here an agglomerative hierarchical clustering algorithm is applied directly to the subclusters represented by their CF vectors. It also provides the flexibility of allowing the user to specify either the desired number of clusters or the desired diameter threshold for clusters. After this step a set of clusters is obtained that captures major distribution pattern in the data. However there might exist minor and localized inaccuracies which can be handled by an optional step 4. In step 4 the centroids of the clusters produced in step 3 are used as seeds and redistribute the data points to its closest seeds to obtain a new set of clusters. Step 4 also provides us with an option of discarding outliers. That is a point which is too far from its closest seed can be treated as an outlier. | |||
==Awards== | |||
It has received | |||
<ref>{{Literatur | |||
| url = http://www.sigmod.org/sigmod-awards/citations/2006-sigmod-test-of-time-award-1 | |||
| Titel = http://www.sigmod.org/sigmod-awards/citations/2006-sigmod-test-of-time-award-1 | |||
}}</ref> the SIGMOD 10 year test of time award. | |||
==External links== | |||
* http://people.cs.ubc.ca/~rap/teaching/504/2005/slides/Birch.pdf | |||
* http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.2504 | |||
==Notes== | |||
{{Reflist}} | |||
{{DEFAULTSORT:Birch (Data Clustering)}} | |||
[[Category:Data clustering algorithms]] | |||
Revision as of 21:29, 24 January 2014
BIRCH (balanced iterative reducing and clustering using hierarchies) is an unsupervised data mining algorithm used to perform hierarchical clustering over particularly large data-sets. 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. In addition, Birch is recognized[1] as the, "first clustering algorithm proposed in the database area to handle 'noise' (data points that are not part of the underlying pattern) effectively".
Problem with previous methods
Previous clustering algorithms performed less effectively over very large databases and did not adequately consider the case wherein a data-set was too large to fit in main memory. As a result, there was a lot of overhead maintaining high clustering quality while minimizing the cost of addition IO (input/output) operations. Furthermore, most of Birch's predecessors inspect all data points (or all currently existing clusters) equally for each 'clustering decision' and do not perform heuristic weighting based on the distance between these data points.
Advantages with BIRCH
It is local in that each clustering decision is made without scanning all data points and currently existing clusters. It exploits the observation that data space is not usually uniformly occupied and not every data point is equally important. It makes full use of available memory to derive the finest possible sub-clusters while minimizing I/O costs. It is also an incremental method that does not require the whole data set in advance.
BIRCH Clustering Algorithm
Given a set of N d-dimensional data points, the clustering feature of the set is defined as the triple , where is the linear sum and is the square sum of data points.
Clustering features are organized in a CF tree, which is a height balanced tree with two parameters: branching factor and threshold . Each non-leaf node contains at most entries of the form , where is a pointer to its th child node and the clustering feature representing the associated subcluster. A leaf node contains at most entries each of the form . It also has two pointers prev and next which are used to chain all leaf nodes together. The tree size depends on the parameter T. A node is required to fit in a page of size P. B and L are determined by P. So P can be varied for performance tuning. It is a very compact representation of the dataset because each entry in a leaf node is not a single data point but a subcluster.
![[CF_{i},child_{i}]](https://wikimedia.org/api/rest_v1/media/math/render/svg/60bdf970a0d94b7bfbef770eb92f5c79117e57fc)
![[CF_{i}]](https://wikimedia.org/api/rest_v1/media/math/render/svg/36267b34f65f4109efc27d584d3b9e713b0be3d0)
In the algorithm in the first step it scans all data and builds an initial memory CF tree using the given amount of memory. In the second step it scans all the leaf entries in the initial CF tree to rebuild a smaller CF tree, while removing outliers and grouping crowded subclusters into larger ones. In step three an existing clustering algorithm is used to cluster all leaf entries. Here an agglomerative hierarchical clustering algorithm is applied directly to the subclusters represented by their CF vectors. It also provides the flexibility of allowing the user to specify either the desired number of clusters or the desired diameter threshold for clusters. After this step a set of clusters is obtained that captures major distribution pattern in the data. However there might exist minor and localized inaccuracies which can be handled by an optional step 4. In step 4 the centroids of the clusters produced in step 3 are used as seeds and redistribute the data points to its closest seeds to obtain a new set of clusters. Step 4 also provides us with an option of discarding outliers. That is a point which is too far from its closest seed can be treated as an outlier.
Awards
It has received [2] the SIGMOD 10 year test of time award.
External links
- http://people.cs.ubc.ca/~rap/teaching/504/2005/slides/Birch.pdf
- http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.2504
Notes
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.