Discrete Binary Hashing Towards Efficient Fashion Recommendation
- 13 May 2018
- book chapter
- Published by Springer Nature
- p. 116-132
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Learning Compatibility Across Categories for Heterogeneous Item Recommendation2016
- Where to Buy It: Matching Street Clothing Photos in Online Shops2015
- Who are the Devils Wearing Prada in New York City?2015
- Optimal Data-Dependent Hashing for Approximate Near Neighbors2015
- Deep hashing for compact binary codes learning2015
- Large scale visual recommendations from street fashion images2014
- Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image RetrievalIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
- Matrix Factorization Techniques for Recommender SystemsComputer, 2009
- Near-optimal hashing algorithms for approximate nearest neighbor in high dimensionsCommunications of the ACM, 2008
- Content-based multimedia information retrievalACM Transactions on Multimedia Computing, Communications, and Applications, 2006