Thanks for your reply. I get it now.
The all zeros case implies that the two sets are empty. Which is a 0/0
situation. Hence, it is taken to be 1.
--
sp
On Mon, May 9, 2016 at 10:11 PM, Maniteja Nandana <
maniteja.modesty...@gmail.com> wrote:
>
> On 9 May 2016 9:47 pm, "Shish
imension is y is 2 x 3 because I getting confused on
what the 2 represents, is it the number of columns or number of rows?
--
sp
On Mon, May 9, 2016 at 7:44 PM, Maniteja Nandana <
maniteja.modesty...@gmail.com> wrote:
>
> On 9 May 2016 5:24 pm, "Shishir Pandey" wrote:
&g
ill help.
>
> Regards,
> Bharat.
>
>
>
> On Mon, May 9, 2016 at 4:05 AM, Shishir Pandey
> wrote:
>
>> I a bit confused regarding the Jaccard similarity score. The example
>> given on :
>>
>> http://scikit-learn.org/stable/modules/generated/sklearn.metric
I a bit confused regarding the Jaccard similarity score. The example given
on :
http://scikit-learn.org/stable/modules/generated/sklearn.metrics.jaccard_similarity_score.html#sklearn.metrics.jaccard_similarity_score
>>> import numpy as np>>> from sklearn.metrics import
>>> jaccard_similarity_sco
Hi Jacob
I went through the code. The 'fit' method in nearest neighbors does not do
any distance calculations. It only initializes the class variables. In that
case this is probably not a bug.
--
sp
On Wed, Feb 24, 2016 at 12:26 AM, Jacob Vanderplas <
jake...@cs.washington.edu> wrote:
> I have
I have been experimenting with the above code. I have noticed the following
things:
1. If we set algorithm = 'brute' the algorithm does not enter the
function tan, i.e., putting a breakpoint at the print statement does not
stop execution on it during the fit method. It does however use t
Hi
What properties of data should I look at to justify that mutual information
is a good feature selection method for the it.
--
sp
--
Site24x7 APM Insight: Get Deep Visibility into Application Performance
APM + Mobile A
Daniel
As you have pointed out on the comments section in:
https://gist.github.com/GaelVaroquaux/ead9898bd3c973c40429
That you are getting negative MI. How did you overcome this problem?
--
sp
On Thu, Feb 11, 2016 at 7:27 PM, Shishir Pandey
wrote:
> Just to get an idea. Do any of the pap
parately. At least in my understanding.
>
> Cheers,
> d
>
>
> On 11/02/16 11:12, Shishir Pandey wrote:
>
> Hi
>
> I would like to know if :
>
> https://github.com/scikit-learn/scikit-learn/blob/master/sklearn/feature_selection/mutual_info_.py
>
> supports Y to be a ma
Y, Y'.
--
sp
On Thu, Feb 11, 2016 at 4:42 PM, Shishir Pandey
wrote:
> Hi
>
> I would like to know if :
>
> https://github.com/scikit-learn/scikit-learn/blob/master/sklearn/feature_selection/mutual_info_.py
>
> supports Y to be a matrix. From what I see it seems lik
t; In any case you can just supply metric='chebyshev' to do that for you in
> NearestNeighbors.
>
> On Wed, Feb 10, 2016 at 10:10 PM, Shishir Pandey
> wrote:
>
>> Thanks.
>>
>> --
>> sp
>>
>> On Thu, Feb 11, 2016 at 6:41 AM, Daniel Ho
>
> If you want to do feature selection based on MI, check out the JMI method:
> https://github.com/danielhomola/mifs
>
> Cheers,
> d
>
>
> On 02/11/2016 01:07 AM, Shishir Pandey wrote:
>
> Hi
>
> I want to estimate the mutual information based on nearest
Hi
I want to estimate the mutual information based on nearest neighbor method:
http://arxiv.org/pdf/cond-mat/0305641.pdf
This requires me to use the max norm. For which I have defined a function
norm. Not I want Nearest neighbors to fit according to this norm and when I
find the kneighbors I wan
Hi
Just wanted to know what is the difference between PCA and KPCA with
linear kernel. They produce the same result on columns 1, 2, etc. But,
the values in column 0 of the fitted transform of one is negative of
other. Shouldn't they both be the same?
--
sp
On 24-09-2013 18:03, Denis-Alexander Engemann wrote:
> Hi Shishir,
>
> please note that the ProbabilisiticPCA got recently refactored which
> lead to API changes and improved documentation + examples.
>
> https://github.com/scikit-learn/scikit-learn/pull/2404
>
> Did you take these changes into ac
Hi
I am just pointing out that documentation page for both Probabilistic
PCA and PCA have the same example (a lot of documentation is also same).
Is there an example which demonstrates the difference between the two
methods? How to use ProbabilisticPCA on some data?
--
sp
-
On 15-08-2013 04:47, Mathieu Blondel wrote:
> On Thu, Aug 15, 2013 at 7:42 AM, Shishir Pandey <mailto:shishir...@gmail.com>> wrote:
>
> I might have conveyed the wrong thing here. I am using version 0.14.1 of
> sklearn. I have a multiple output problem. I am us
> Message: 4
> Date: Thu, 15 Aug 2013 01:22:31 +0900
> From: Mathieu Blondel
> Subject: Re: [Scikit-learn-general] RidgeClassifier
> To: scikit-learn-general
> Message-ID:
>
> Content-Type: text/plain; charset="iso-8859-1"
>
> On Thu, Aug 15
Hi
How does the RidgeClassifier work? How does it decide how many classes
are there. In my problem there are only two classes {-1, 1} but the
Predict() gives 12, 15 and all sorts of classes. How does the
RidgeClassifier decide the thresholds for each class?
Thanks.
--
sp
---
Hi
I would like to solve the standard Lasso optimization:
(1 / (2 * n_samples)) * ||Y - XW||^2_2 + alpha * ||W||_1
Only difference being that I want to take Y to be a matrix. This would
mean that W is also a matrix. Is it a good idea to use the lasso module
written in scikit-lea
rg> Content-Type: text/plain;
> charset=us-ascii On Fri, Apr 26, 2013 at 04:17:36PM +0530, Shishir
> Pandey wrote:
>> >@Jaques Grobler: I ran the libsvm GUI code on the sklearn version 13.1
>> >it was giving error importing - "from sklearn.externals.six.move import
>> &g
ting and scaling on
> Gradient Descent
> To: Scikit-Learn Mailing List
>
> Message-ID:
>
> Content-Type: text/plain; charset="iso-8859-1"
>
> @Shishir Pandey on a slight tangent, what problems are you having with
> running Libsvm GUI?
&
:31, scikit-learn-general-requ...@lists.sourceforge.net
wrote:
> Date: Fri, 26 Apr 2013 02:37:27 +0530
> From: Shishir Pandey
> Subject: Re: [Scikit-learn-general] Effects of shifting and scaling on
> Gradient Descent
> To:scikit-learn-general@lists.sourceforge.net
> Message
t the gradient descent will be different ans may converge to a
> different location. As Ga?l said, this is a generic
> optimization-related question, it is not machine-learning related.
> Matthieu 2013/4/25 Shishir Pandey
>> >Thanks Ronnie for pointing out the exact method in th
Thanks Ronnie for pointing out the exact method in the scikit-learn
library. Yes, that is exactly what I was asking how does the rescaling
of features affect the gradient descent algorithm. Since, stochastic
gradient descent is an algorithm which is used in machine learning quite
a lot. It wil
Hi
I am trying to trying to find the regression matrix \beta. In the following:
Y = X \beta + \epsilon
Y - m x n matrix. (sparse matrix)
X - m x k matrix. (sparse matrix)
\beta - k x n matrix
I try to fit the SGDRegressor as fit(X,Y). It gives a value error:
ValueError: Buffer has wrong number
Hi
I think the version of the present stable release is suppose to be 1.0
instead of 0.1 as mentioned on the website.
Thanks,
--sp
--
Virtualization & Cloud Management Using Capacity Planning
Cloud computing makes use of
Hi
I am working with a dataset which too big to fit in the memory. Is there a
way in scikits-learn to sub sample the existing dataset maintaining its
properties so that I can load it in my RAM?
with regards,
--Shishir Pandey
28 matches
Mail list logo
