Information Retrieval

Perturbation based Large Margin Approach for Ranking AISTATS 2012 Super-Bit Locality-Sensitive Hashing NeurIPS 2012 Convergent Bounds on the Euclidean Distance NeurIPS 2011 Generative Modeling for Maximizing Precision and Recall in Information Visualization AISTATS 2011 Hashing Algorithms for Large-Scale Learning NeurIPS 2011 Learning a Robust Relevance Model for Search Using Kernel Methods JMLR 2011 On NDCG Consistency of Listwise Ranking Methods AISTATS 2011 Reconstructing Patterns of Information Diffusion from Incomplete Observations NeurIPS 2011 Half Transductive Ranking AISTATS 2010 Optimal Web-Scale Tiering as a Flow Problem NeurIPS 2010 Single versus Multiple Sorting in All Pairs Similarity Search ACML 2010 Subgraph Detection Using Eigenvector L1 Norms NeurIPS 2010 Two-Layer Generalization Analysis for Ranking Using Rademacher Average NeurIPS 2010 Adapting to the Shifting Intent of Search Queries NeurIPS 2009 A Gaussian Tree Approximation for Integer Least-Squares NeurIPS 2009 Exponential Family Graph Matching and Ranking NeurIPS 2009 Learning to Hash with Binary Reconstructive Embeddings NeurIPS 2009 Learning to Rank by Optimizing NDCG Measure NeurIPS 2009 Locality-sensitive binary codes from shift-invariant kernels NeurIPS 2009 Modeling Social Annotation Data with Content Relevance using a Topic Model NeurIPS 2009 Polynomial Semantic Indexing NeurIPS 2009 Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions NeurIPS 2009 Ranking Measures and Loss Functions in Learning to Rank NeurIPS 2009 Statistical Consistency of Top-k Ranking NeurIPS 2009 Empirical performance maximization for linear rank statistics NeurIPS 2008