Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
Organizing digital images into semantic categories is imperative for effective browsing and retrieval. In large image collections, an efficient algorithm is crucial to quickly cat...
Taufik Abidin, Aijuan Dong, Honglin Li, William Pe...
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...