28 citations · 41 across the 5 of their papers we have counts for
5 papers
Hashing with binary autoencoders
Miguel Á. Carreira-Perpiñán, Ramin Raziperchikolaei
An attractive approach for fast search in image databases is binary hashing, where each high-dimensional, real-valued image is mapped onto a low-dimensional, binary vector and the…
An ADMM algorithm for solving a proximal bound-constrained quadratic program
Miguel Á. Carreira-Perpiñán
We consider a proximal operator given by a quadratic function subject to bound constraints and give an optimization algorithm using the alternating direction method of multipliers…
The Laplacian K-modes algorithm for clustering
Weiran Wang, Miguel Á. Carreira-Perpiñán
In addition to finding meaningful clusters, centroid-based clustering algorithms such as K-means or mean-shift should ideally find centroids that are valid patterns in the input sp…
The role of dimensionality reduction in linear classification
Weiran Wang, Miguel Á. Carreira-Perpiñán
Dimensionality reduction (DR) is often used as a preprocessing step in classification, but usually one first fixes the DR mapping, possibly using label information, and then learns…
LASS: a simple assignment model with Laplacian smoothing
Miguel Á. Carreira-Perpiñán, Weiran Wang
We consider the problem of learning soft assignments of items to categories given two sources of information: an item-category similarity matrix, which encourages items to…