On Thu, Apr 3, 2014 at 11:21 PM, Heikki Linnakangas wrote:
> On 04/03/2014 04:15 PM, Alexander Korotkov wrote:
>
>> On Wed, Apr 2, 2014 at 2:22 PM, Alexander Korotkov > >wrote:
>>
>> On Tue, Apr 1, 2014 at 2:23 PM, Heikki Linnakangas <
>>> hlinnakan...@vmware.com> wrote:
>>>
>>> The BIRCH algor
On 04/03/2014 04:15 PM, Alexander Korotkov wrote:
On Wed, Apr 2, 2014 at 2:22 PM, Alexander Korotkov wrote:
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 c
On Wed, Apr 2, 2014 at 2:22 PM, Alexander Korotkov wrote:
> 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 use a pre-bu
On Tue, Apr 1, 2014 at 2:23 PM, Heikki Linnakangas
wrote:
> 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 signifcant differences
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 stati
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
