Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
This paper studies the effect of covariance regularization for classific ation of high-dimensional data. This is done by fitting a mixture of Gaussians with a regularized covaria...
Daniel L. Elliott, Charles W. Anderson, Michael Ki...
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
We demonstrate the use of context features, namely, names of places, and unlabelled data for the detection of personal name language of origin. While some early work used either r...
Vladimir Pervouchine, Min Zhang, Ming Liu, Haizhou...
In this paper we propose a novel method for learning a Mahalanobis distance measure to be used in the KNN classification algorithm. The algorithm directly maximizes a stochastic v...
Jacob Goldberger, Sam T. Roweis, Geoffrey E. Hinto...