
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
The presentation was presented by Nenad Tomasev at the 7th International Conference on Machine Learning and Data Mining in Pattern Recognition (MLDM 2011) in New York, NY, USA on August 30th, 2011.
Publication: http://bit.ly/yQQsOq
Abstract:
Highdimensional data are by their very nature often difficult to handle by conventional machinelearning algorithms, which is usually characterized as an aspect of the curse of dimensionality. However, it was shown that some of the arising highdimensional phenomena can be exploited to increase algorithm accuracy. One such phenomenon is hubness, which refers to the emergence of hubs in highdimensional spaces, where hubs are influential points included in many kneighbor sets of other points in the data. This phenomenon was previously used to devise a crisp weighted voting scheme for the knearest neighbor classifier. In this paper we go a step further by embracing the soft approach, and propose several fuzzy measures for knearest neighbor classification, all based on hubness, which express fuzziness of elements appearing in kneighborhoods of other points. Experimental evaluation on real data from the UCI repository and the image domain suggests that the fuzzy approach provides a useful measure of confidence in the predicted labels, resulting in improvement over the crisp weighted method, as well the standard kNN classifier.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment