Thanks! And does it make sense to use L1 regularisation here (irrespective
of the graph structure)?
Best,
Mathias
On Mon, Feb 20, 2012 at 11:06 AM, Gael Varoquaux <
[email protected]> wrote:
> On Mon, Feb 20, 2012 at 10:35:51AM +0100, Mathias Verbeke wrote:
> > I would have around 10000 features. I'm working on a sentence
> > classification problem,
>
> Graph lasso won't work on such a problem.
>
> > I would like to do feature selection, to reduce the number of
> > dimensions, and was thinking to take the graph structure into account
> > for that. Would you have any ideas on what would be the best way to do
> > that (with or without considering the graph structure)?
>
> I would try hierarchical clustering, constraining it with the graph:
>
>
> http://scikit-learn.org/dev/modules/clustering.html#adding-connectivity-constraints
>
> Gael
>
>
> ------------------------------------------------------------------------------
> Try before you buy = See our experts in action!
> The most comprehensive online learning library for Microsoft developers
> is just $99.99! Visual Studio, SharePoint, SQL - plus HTML5, CSS3, MVC3,
> Metro Style Apps, more. Free future releases when you subscribe now!
> http://p.sf.net/sfu/learndevnow-dev2
> _______________________________________________
> Scikit-learn-general mailing list
> [email protected]
> https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
>
------------------------------------------------------------------------------
Try before you buy = See our experts in action!
The most comprehensive online learning library for Microsoft developers
is just $99.99! Visual Studio, SharePoint, SQL - plus HTML5, CSS3, MVC3,
Metro Style Apps, more. Free future releases when you subscribe now!
http://p.sf.net/sfu/learndevnow-dev2
_______________________________________________
Scikit-learn-general mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
