The influence of weighting the k-occurrences on hubness-aware classification methods
published: Nov. 4, 2011, recorded: October 2011, views: 55
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Hubness is a phenomenon present in many highdimensional data sets. It is related to the skewness in the distribution of k-occurrences, i.e. occurrences of data points in k-neighbor sets of other data points. Several hubnessaware methods that focus on exploiting this phenomenon have recently been proposed. In this paper, we examine the potential impact of weighting the k-occurrences, by taking into account the distance between the respective data points, on hubness-aware nearest-neighbor methods, more specifically hw-kNN, h-FNN and HIKNN. We show that such distance-based weighting can be both advantageous and detrimental and that it influences different methods in different ways.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !