[scikit-learn] Recurrent Decision Tree
Dale T Smith
Dale.T.Smith at macys.com
Mon Nov 7 08:10:03 EST 2016
Searching the mailing list would be the best way to find out this information.
It may be in the contrib packages on github – have you checked?
Dale T. Smith | Macy's Systems and Technology | IFS eCom CSE Data Science
5985 State Bridge Road, Johns Creek, GA 30097 | dale.t.smith at macys.com
From: scikit-learn [mailto:scikit-learn-bounces+dale.t.smith=macys.com at python.org] On Behalf Of KevNo
Sent: Friday, November 4, 2016 4:44 PM
To: scikit-learn at python.org
Subject: [scikit-learn] Recurrent Decision Tree
⚠ EXT MSG:
Just wondering if Recurrent Decision Tree has been investigated
by Scikit previously.
Main interest is in path dependant (time series data) problems,
the recurrence is often necessary to model the path dependent state.
In other words, wrong prediction will affect the subsequent predictions.
Here, a research paper on Recurrent Decision Tree,
from Walt Disney Research (!)
Any thought is welcome.
scikit-learn-request at python.org<mailto:scikit-learn-request at python.org> wrote:
Send scikit-learn mailing list submissions to
scikit-learn at python.org<mailto:scikit-learn at python.org>
To subscribe or unsubscribe via the World Wide Web, visit
or, via email, send a message with subject or body 'help' to
scikit-learn-request at python.org<mailto:scikit-learn-request at python.org>
You can reach the person managing the list at
scikit-learn-owner at python.org<mailto:scikit-learn-owner at python.org>
When replying, please edit your Subject line so it is more specific
than "Re: Contents of scikit-learn digest..."
1. Re: hierarchical clustering (Gael Varoquaux)
2. Naive Bayes - Multinomial Naive Bayes tf-idf (Marcin Miro?czuk)
3. Re: hierarchical clustering (Jaime Lopez Carvajal)
4. Re: Naive Bayes - Multinomial Naive Bayes tf-idf (Andy)
Date: Fri, 4 Nov 2016 10:36:49 +0100
From: Gael Varoquaux <gael.varoquaux at normalesup.org><mailto:gael.varoquaux at normalesup.org>
To: Scikit-learn user and developer mailing list
<scikit-learn at python.org><mailto:scikit-learn at python.org>
Subject: Re: [scikit-learn] hierarchical clustering
Message-ID: <20161104093649.GA137008 at phare.normalesup.org><mailto:20161104093649.GA137008 at phare.normalesup.org>
Content-Type: text/plain; charset=us-ascii
AgglomerativeClustering internally calls scikit learn's version of
cut_tree. I would be curious to know whether this is equivalent to
It differs in that it enable to add connectivity contraints.
Date: Fri, 4 Nov 2016 11:45:39 +0100
From: Marcin Miro?czuk <m.marcinmichal at gmail.com><mailto:m.marcinmichal at gmail.com>
To: scikit-learn at python.org<mailto:scikit-learn at python.org>
Subject: [scikit-learn] Naive Bayes - Multinomial Naive Bayes tf-idf
<CAH6=PuCebYLz32-YqpEUtRrYQvn7EQUiymWCy38Vi9_9Jr+-Fg at mail.gmail.com><mailto:CAH6=PuCebYLz32-YqpEUtRrYQvn7EQUiymWCy38Vi9_9Jr+-Fg at mail.gmail.com>
Content-Type: text/plain; charset="utf-8"
In our experiments, we use a Multinomial Naive Bayes (MNB). The traditional
MNB implies the TF weight of the words. We read in documentation
http://scikit-learn.org/stable/modules/naive_bayes.html which describes
Multinomial Naive Bayes that "... where the data are typically represented
as word vector counts, although tf-idf vectors are also known to work well
in practice". The "word vector counts" is a TF and it is well known. We
have a problem which the "tf-idf vectors". In this case, i.e. tf-idf it
was implemented the approach of the D. M. Rennie et all Tackling the Poor
Assumptions of Naive Bayes Text Classification? In the documentation, there
are not any citation of this solution.
* This is an EXTERNAL EMAIL. Stop and think before clicking a link or opening attachments.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the scikit-learn