The Curse of Dimensionality in Classification
visiondummy.com
The Curse of Dimensionality in Classification
1–10 of 27 posts
Re: The Curse of Dimensionality in Classification
#2Re: The Curse of Dimensionality in Classification
#3one counter-example: face recognition using 100k features ( http://research.microsoft.com/pubs/192106/HighDimFeature.pdf )
Re: The Curse of Dimensionality in Classification
#4one counter-example: face recognition using 100k features ( http://research.microsoft.com/pubs/192106/HighDimFeature.pdf )
Not really. The article mentions that using linear methods (i.e., LIBLINEAR) is one way to avoid the curse. LIBLINEAR is specifically designed for situations in which you have many features and relatively few training instances. When using a linear classifier it may make sense to simply generate as many features as you can, and then use, i.e., lasso regression in order to do feature selection. http://www.csie.ntu.edu…
A simple example of this is in natural language processing. Adding dependency or phrase structure parse features to an n-gram bag-of-words model might result in an order of magnitude increase in the number of dimensions in your feature space, and ends up harming classification accuracy, even with tightly controlled and elegant feature selection methods.
Re: The Curse of Dimensionality in Classification
#5Re: The Curse of Dimensionality in Classification
#6When I was starting my masters course I was interested in learning what the concept of bag of words in computer vision was all about. Although it is straightforward technique, there are few examples on the Web explaining how to implement it (clustering the feature vectors and etc.)
Re: The Curse of Dimensionality in Classification
#7Re: The Curse of Dimensionality in Classification
#8A cool thing about LDA is that it allows you to express the latent characteristics of a given document as a point in Euclidean space. This gives you the ability to use spatial distance metrics such as cosine distance to express document similarity. I specifically use this for recommending large-scale UGC communities based on their latent characteristics. Furthermore, since you've turned your language data into spatial data, you're able to use spatial classifiers such as SVMs more effectively over natural language data, which is normally a bit better suited for Bayesian classifiers.
I'm a huge fan of Gensim for its LDA library. It's even capable of distributed computing using Pyro4. It's relatively trivial to deploy an LDA pipeline for extremely large datasets using EC2 and the Boto AWS library.
Edit: If you haven't heard of it, scikit-learn is an awesome Python library for highly performant machine learning using Python's C extensions for numerical computing (scipy, numpy). It's easy to take the data you get above and perform learning on it using the classifiers provided.
Re: The Curse of Dimensionality in Classification
#9one counter-example: face recognition using 100k features ( http://research.microsoft.com/pubs/192106/HighDimFeature.pdf )
Not really. The article mentions that using linear methods (i.e., LIBLINEAR) is one way to avoid the curse. LIBLINEAR is specifically designed for situations in which you have many features and relatively few training instances. When using a linear classifier it may make sense to simply generate as many features as you can, and then use, i.e., lasso regression in order to do feature selection. http://www.csie.ntu.edu…
I think the missing piece is regularisation. It doesn't have to do feature selection and actually reduce the number of dimensions, but you're right that using L1 for such data is usually a good idea.
Re: The Curse of Dimensionality in Classification
#10is there some kind of test to know if we are past the optimal number of dimensions? I guess overfitting could be detected by the ratio between volume and area of the classification boundary.