Improved Consistent Sampling, Weighted Minhash and L1 Sketching
暂无分享,去创建一个
[1] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[2] Éva Tardos,et al. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[3] G. Marsaglia,et al. The Ziggurat Method for Generating Random Variables , 2000 .
[4] Alan M. Frieze,et al. Min-Wise Independent Permutations , 2000, J. Comput. Syst. Sci..
[5] Moses Charikar,et al. Similarity estimation techniques from rounding algorithms , 2002, STOC '02.
[6] Nicole Immorlica,et al. Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.
[7] Alexandr Andoni,et al. Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[8] Nonlinear Estimators and Tail Bounds for Dimension Reduction in l1 Using Cauchy Random Projections , 2006, J. Mach. Learn. Res..
[9] Kunal Talwar,et al. Consistent Weighted Sampling , 2007 .
[10] Andrew Zisserman,et al. Near Duplicate Image Detection: min-Hash and tf-idf Weighting , 2008, BMVC.
[11] Antonio Torralba,et al. Spectral Hashing , 2008, NIPS.
[12] Geoffrey E. Hinton,et al. Semantic hashing , 2009, Int. J. Approx. Reason..
[13] Ping Li,et al. b-Bit minwise hashing , 2009, WWW '10.