Hey Trevor,
I have completed the Kmeans code and will soon commit it as per
instructions which you have shared with me the other mail chain.
Best Regards
Parth
On Sat, May 20, 2017 at 2:29 AM, Trevor Grant
wrote:
> Bumping this-
>
> Parth, is there anything we can do to assist you?
>
>
>
> Tre
Bumping this-
Parth, is there anything we can do to assist you?
Trevor Grant
Data Scientist
https://github.com/rawkintrevo
http://stackexchange.com/users/3002022/rawkintrevo
http://trevorgrant.org
*"Fortunate is he, who is able to know the causes of things." -Virgil*
On Mon, Apr 24, 2017 at
@Trevor and @Dmitriy
Tough Bug in Aggregating Transpose is fixed. One issue is still left which
is causing hindrance in completing the KMeans Code
That issue is of Assigning the the Row Keys of The DRM with the "Closest
Cluster Index" found
Consider the Matrix of Data points given as follows
{
Can mahout be used for self driving tech ?
Thanks,
Khurrum.
On Apr 24, 2017, 10:34 PM -0400, KHATWANI PARTH BHARAT
, wrote:
> @Trevor and @Dmitriy
>
> Tough Bug in Aggregating Transpose is fixed. One issue is still left which
> is causing hindrance in completing the KMeans Code
> That issue is
@Trevor and @Dmitriy
Tough Bug in Aggregating Transpose is fixed. One issue is still left which
is causing hindrance in completing the KMeans Code
That issue is of Assigning the the Row Keys of The DRM with the "Closest
Cluster Index" found
Consider the Matrix of Data points given as follows
{
gt; > > > > > >> > >> > > }
> > > > > > > >> > >> > > keys -> block
> > > > > > > >> > >> > > }
> > > > > > > >> > >> > >
>
t;
> > > > > > >>
> > > > > > >> Trevor Grant
> > > > > > >> Data Scientist
> > > > > > >> https://github.com/rawkintrevo
> > > > > > >> http://stackexchange.com/users/30020
,@Trevor and @Andrew Sir,
> > > > > >> > I am still stuck at the above problem can you please help me
> out
> > > > with
> > > > > >> it.
> > > > > >> > I am unable to find the proper reference
pilani.ac.in&idSignature=22>
> > > > >> >
> > > > >> > On Sat, Apr 15, 2017 at 10:07 AM, KHATWANI PARTH BHARAT <
> > > > >> > h2016...@pilani.bits-pilani.ac.in> wrote:
> > > > >> >
> > > > >&g
ed in
> > the
> > > >> above
> > > >> > > mail,
> > > >> > > By Writing the a separate code where i am assigning the a
> default
> > > >> value 1
> > > >> > > to each row Key of The DRM and then taking the
>> > > >> >
> > >> > >> > > >> > My code is as follows
> > >> > >> > > >> >
> > >> > >> > > >> > This code works fine till step number 10
> > >> > >>
e((1,1, 2, 3), (1,2, 3, 4), (1,3, 4, 5), (1,4, 5,
>> >> 6))
>> >> > > val A = drmParallelize(m = inCoreA)
>> >> > >
>> >> > > //Mapblock
>> >> > > val drm2 = A.mapBlock() {
>> >> > > case (keys, block) =>
gt; >> > >> > > >> >
> >> > >> > > >> > //start of main method
> >> > >> > > >> >
> >> > >> > > >> > def main(args: Array[String]) {
> >> > >> >
gt; 0 => {}
>> > > 1 => {0:1.0,1:4.0,2:5.0,3:6.0}
>> > > 2 => {}
>> > > 3 => {}
>> > > }
>> > > And the result of aggregating Transpose should be
>> > > {
>> > > 0 => {1: 4.0}
>> > > 1 =&
; > > Beyond MapReduce
> > > <https://www.amazon.com/Apache-Mahout-MapReduce-
> > Dmitriy-Lyubimov/dp/1523775785> Aggregating
> > > Transpose and other concepts are explained very nicely over here but i
> > am
> > > unable to find any example whe
t;> > > keys -> block
> >> > > }
> >> > >
> >> > > in step 12 i am finding the centriod closest to the current
> dataPoint
> >> > > in step13 i am assigning the closesetIndex to the key of the
> >> >
alues . Mahout Samsara Manual
> http://apache.github.io/mahout/doc/ScalaSparkBindings.html Also Does not
> contain any such examples.
> It will great if i can get some reference to solution of mentioned issue.
>
>
> Thanks
> Parth Khatwani
>
>
>
> On Sat, Apr 15, 2017
Parth Khatwani
On Sat, Apr 15, 2017 at 12:13 AM, Andrew Palumbo wrote:
> +1
>
>
>
> Sent from my Verizon Wireless 4G LTE smartphone
>
>
> Original message ----
> From: Trevor Grant
> Date: 04/14/2017 11:40 (GMT-08:00)
> To: dev@mahout.apache.org
+1
Sent from my Verizon Wireless 4G LTE smartphone
Original message
From: Trevor Grant
Date: 04/14/2017 11:40 (GMT-08:00)
To: dev@mahout.apache.org
Subject: Re: Trying to write the KMeans Clustering Using "Apache Mahout Samsara"
Parth and Dmitriy,
This is awe
s & Regards
> > > Parth Khatwani
> > >
> > > On Thu, Apr 13, 2017 at 3:19 AM, Andrew Palumbo
> > > wrote:
> > >
> > >> +1 to creating a branch.
> > >>
> > >>
> > >>
> > >> Sent from my Veriz
;> +1 to creating a branch.
> >>
> >>
> >>
> >> Sent from my Verizon Wireless 4G LTE smartphone
> >>
> >>
> >> Original message
> >> From: Dmitriy Lyubimov
> >> Date: 04/12/2017 11:25 (GMT-08:00)
&g
> +1 to creating a branch.
>>
>>
>>
>> Sent from my Verizon Wireless 4G LTE smartphone
>>
>>
>> Original message ----
>> From: Dmitriy Lyubimov
>> Date: 04/12/2017 11:25 (GMT-08:00)
>> To: dev@mahout.apache.org
>>
> Sent from my Verizon Wireless 4G LTE smartphone
>
>
> Original message
> From: Dmitriy Lyubimov
> Date: 04/12/2017 11:25 (GMT-08:00)
> To: dev@mahout.apache.org
> Subject: Re: Trying to write the KMeans Clustering Using "Apache Mahout
> Samsara&q
+1 to creating a branch.
Sent from my Verizon Wireless 4G LTE smartphone
Original message
From: Dmitriy Lyubimov
Date: 04/12/2017 11:25 (GMT-08:00)
To: dev@mahout.apache.org
Subject: Re: Trying to write the KMeans Clustering Using "Apache Mahout Samsara"
can&#
index = row
> > }
> > }
> > index
> > }
> >
> > //calculating the sum of squared distance between the points(Vectors)
> > def ssr(a: Vector, b: Vector): Double = {
> > (a - b) ^= 2 sum
> > }
> >
> >
rray[Double] = {
> val newArr = new Array[Double](arg.length + 1)
> newArr(0) = 1.0;
> for (i <- 0 until (arg.size)) {
> newArr(i + 1) = arg(i);
> }
> newArr
> }
>
>
> Thanks & Regards
> Parth Khatwani
>
>
>
> On Mon, Apr
- 0 until (arg.size)) {
newArr(i + 1) = arg(i);
}
newArr
}
Thanks & Regards
Parth Khatwani
On Mon, Apr 3, 2017 at 7:37 PM, KHATWANI PARTH BHARAT <
h2016...@pilani.bits-pilani.ac.in> wrote:
>
> ------ Forwarded message ------
> From: Dmitriy Lyubim
ps1 this assumes row-wise construction of A based on training set of m
n-dimensional points.
ps2 since we are doing multiple passes over A it may make sense to make
sure it is committed to spark cache (by using checkpoint api), if spark is
used
On Fri, Mar 31, 2017 at 10:53 AM, Dmitriy Lyubimov
w
here is the outline. For details of APIs, please refer to samsara manual
[2], i will not be be repeating it.
Assume your training data input is m x n matrix A. For simplicity let's
assume it's a DRM with int row keys, i.e., DrmLike[Int].
Initialization:
First, classic k-means starts by selecting
@Dmitriycan you please again tell me the approach to move ahead.
Thanks
Parth Khatwani
On Fri, Mar 31, 2017 at 10:15 PM, KHATWANI PARTH BHARAT <
h2016...@pilani.bits-pilani.ac.in> wrote:
> yes i am unable to figure out the way ahead.
> Like how to create the augmented matrix A := (0|D) which y
yes i am unable to figure out the way ahead.
Like how to create the augmented matrix A := (0|D) which you have mentioned.
On Fri, Mar 31, 2017 at 10:10 PM, Dmitriy Lyubimov
wrote:
> was my reply for your post on @user has been a bit confusing?
>
> On Fri, Mar 31, 2017 at 8:40 AM, KHATWANI PARTH
was my reply for your post on @user has been a bit confusing?
On Fri, Mar 31, 2017 at 8:40 AM, KHATWANI PARTH BHARAT <
h2016...@pilani.bits-pilani.ac.in> wrote:
> Sir,
> I am trying to write the kmeans clustering algorithm using Mahout Samsara
> but i am bit confused
> about how to leverage Distr
32 matches
Mail list logo
