1. What are the contributions in "Fine: information embedding for document classification" ?
In this paper, the authors propose calculating a low-dimensional, information based embedding of documents into Euclidean space.. One component of their approach motivated by information geometry is the Fisher information distance to define similarities between documents.. The authors demonstrate that in the classification task, this information driven embedding outperforms both a standard PCA embedding and other Euclidean embeddings of the term frequency vector.
read more
2. What have the authors stated for future works in "Fine: information embedding for document classification" ?
In future work the authors intend to test their FINE algorithm with various different manifold learning methods.. In this paper the authors focused on unsupervised methods in order to garner a fair comparison to PCA, however they plan to utilize supervised methods of dimensionality reduction to see if they can generate better classification performance than an SVM ( with a linear or diffusion kernel [ 5 ] ) on the full dimensional data set.. While the authors currently choose to use Laplacian Eigenmaps to generate their low dimensional representation, they will look into other multidimensional scaling methods to determine which gives the best performance.
read more

