We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...