Hi Beam ML community
Based on comments from a number of you and some discussion we've had here
we thought we would suggest the following direction:
- Begin with primitive operations common and critical to most all ML
algorithms. These primitive operators would include:
- linear algebr
If you have local ordering within a group-by like what Francis said, you can
build global total ordering off of it, by partitioning the data in ranges.
Most terrasort implementations do this. They subsample the data to get a
fairly evenly distributed range of keys, and then do individual small
Totally agree that orderings of values within a
key[-window[-pane]]-grouping being quite useful, and they make total
sense in the model (primarily because elements themselves are never
partitioned).
On Fri, May 27, 2016 at 11:31 AM, Bobby Evans
wrote:
> If you have local ordering within a group-b
Hi all!
One of the questions that often gets asked is why Beam has PTransforms
for everything instead of having methods on PCollection. This morning
I published a blog post explaining some of the design considerations
and history that went into designing the Beam SDK.
http://beam.incubator.apache
Here's the URL of my fork, so you can see what it looks like so far:
https://github.com/devin-donnelly/incubator-beam-site/tree/beam-pg
On Mon, May 23, 2016 at 8:02 AM, Jean-Baptiste Onofré
wrote:
> Agree, it would be great to have such user guide + a started guide for
> Beam.
>
> Regards
> JB
The relevant file you're looking for, and the one that's constantly
updated, is:
/docs/programming-guide.md
On Fri, May 27, 2016 at 5:20 PM, Devin Donnelly
wrote:
> Here's the URL of my fork, so you can see what it looks like so far:
>
> https://github.com/devin-donnelly/incubator-beam-site/tre
