On Wed, Apr 2, 2014 at 2:22 PM, Alexander Korotkov aekorot...@gmail.comwrote:
On Tue, Apr 1, 2014 at 2:23 PM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
The BIRCH algorithm as described in the paper describes building a tree
in memory. If I understood correctly, you're suggesting to
On 04/03/2014 04:15 PM, Alexander Korotkov wrote:
On Wed, Apr 2, 2014 at 2:22 PM, Alexander Korotkov aekorot...@gmail.comwrote:
On Tue, Apr 1, 2014 at 2:23 PM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
The BIRCH algorithm as described in the paper describes building a tree
in
On Thu, Apr 3, 2014 at 11:21 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 04/03/2014 04:15 PM, Alexander Korotkov wrote:
On Wed, Apr 2, 2014 at 2:22 PM, Alexander Korotkov aekorot...@gmail.com
wrote:
On Tue, Apr 1, 2014 at 2:23 PM, Heikki Linnakangas
hlinnakan...@vmware.com
On Tue, Apr 1, 2014 at 2:23 PM, Heikki Linnakangas
hlinnakan...@vmware.comwrote:
The BIRCH algorithm as described in the paper describes building a tree in
memory. If I understood correctly, you're suggesting to use a pre-built
GiST index instead. Interesting idea!
There are a couple of
On 03/30/2014 11:50 PM, Иван Парфилов wrote:
The implementation of this algorithm would be for data type cube and based
on GiST.
The key concept of BIRCH algorithm is clustering feature. Given a set of N
d-dimensional data points, the clustering feature CF of the set is defined
as the triple CF
On 03/30/2014 11:50 PM, Иван Парфилов wrote:
* Quantifiable results*
Adding support of BIRCH algorithm for data type cube
Aside from the details of *how* that would work, the other question is:
Do we want this in contrib/cube? There are currently no clustering
functions, or any other
Hello, hackers! This is my GSoC proposal.
*Short description:*
Cluster analysis or clustering is the task of grouping a set of objects in
such a way that objects in the same group (called a cluster) are more
similar (in some sense or another) to each other than to those in other
groups
