Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2016, Article ID 4075257, 12 pages
http://dx.doi.org/10.1155/2016/4075257
Research Article

A Novel Accuracy and Similarity Search Structure Based on Parallel Bloom Filters

1Faculty of Electric Power Engineering, Kunming University of Science and Technology, Kunming 650051, China
2Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650051, China
3Faculty of Transportation Engineering, Kunming University of Science and Technology, Kunming 650051, China

Received 21 April 2016; Revised 25 September 2016; Accepted 26 October 2016

Academic Editor: Hong Man

Copyright © 2016 Chunyan Shuai et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. H. Samet, Foundations of Multidimensional and Metric Data Structures, Morgan Kaufmann, Burlington, Mass, USA, 2006.
  2. H. Jégou, M. Douze, and C. Schmid, “Product quantization for nearest neighbor search,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 1, pp. 117–128, 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. H. Lejsek, F. H. Ásmundsson, B. P. Jónsson, and L. Amsaleg, “NV-tree: an efficient disk-based index for approximate search in very large high-dimensional collections,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 5, pp. 869–883, 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Andoni and P. Indyk, “Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions,” Communications of the ACM, vol. 51, no. 1, pp. 117–122, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. H. Burton, “Space/time trade-offs in hash coding with allowable errors,” Communications of the ACM, vol. 13, no. 7, pp. 422–426, 1970. View at Publisher · View at Google Scholar
  6. S. Geravand and M. Ahmadi, “Bloom filter applications in network security: a state-of-the-art survey,” Computer Networks, vol. 57, no. 18, pp. 4047–4064, 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. D. Guo, J. Wu, H. Chen, Y. Yuan, and X. Luo, “The dynamic bloom filters,” IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 1, pp. 120–133, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. B. Xiao and Y. Hua, “Using parallel bloom filters for multiattribute representation on network services,” IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 1, pp. 20–32, 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. M.-Z. Xiao, Y.-F. Dai, and X.-M. Li, “Split bloom filter,” Acta Electronica Sinica, vol. 32, no. 2, pp. 241–245, 2004. View at Google Scholar · View at Scopus
  10. Kirsch and M. Michael, “Distance-sensitive bloom filters,” in Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX '06), pp. 41–51, Philadelphia, Pa, USA, 2006.
  11. A. Andoni, P. Indyk, H. L. Nguyen, and I. Razenshteyn, “Beyond locality-sensitive hashing,” in Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1018–1028, SIAM, Portland, Ore, USA, January 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  12. H. V. Jagadish, B. C. Ooi, K.-L. Tan, C. Yu, and R. Zhang, “IDistance: an adaptive B+tree based indexing method for nearest neighbor search,” ACM Transactions on Database Systems, vol. 30, no. 2, pp. 364–397, 2005. View at Publisher · View at Google Scholar · View at Scopus
  13. R. Fagin, R. Kumar, and D. Sivakumar, “Efficient similarity search and classification via rank aggregation,” in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD '03), pp. 301–312, San Diego, Calif, USA, June 2003. View at Publisher · View at Google Scholar
  14. J. Wang, H. T. Shen, J. Song et al., “Hashing for similarity search: a survey,” https://arxiv.org/abs/1408.2927.
  15. P. Indyk and R. Motwani, “Approximate nearest neighbors: towards removing the curse of dimensionality,” in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 604–613, 1998.
  16. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, “Locality-sensitive hashing scheme based on p-stable distributions,” in Proceedings of the 20th Annual Symposium on Computational Geometry (SCG '04), pp. 253–262, ACM, June 2004. View at Scopus
  17. A. Gionis, P. Indyk, and R. Motwani, “Similarity search in high dimensions via hashing,” in Proceedings of the 25th International Conference on Very Large Data Bases (VLDB '99), pp. 518–529, Edinburgh, UK, September 1999.
  18. Y. Tao, K. Yi, C. Sheng, and P. Kalnis, “Efficient and accurate nearest neighbor and closest pair search in high-dimensional space,” ACM Transactions on Database Systems (TODS), vol. 35, no. 3, article 20, 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. R. O'Donnell, Y. Wu, and Y. Zhou, “Optimal lower bounds for locality-sensitive hashing (except when q is tiny),” ACM Transactions of Computation Theory, vol. 6, no. 1, article 5, 2014. View at Google Scholar · View at MathSciNet
  20. D. Gorisse, M. Cord, F. Precioso, and S. Philipp-Foliguet, “Fast approximate kernel based similarity search for image retrieval task,” in Proceedings of the IEEE 19th International Conference on Pattern Recognition (ICPR '08), pp. 1873–1876, Tempa, Fla, USA, December 2008.
  21. D. Gorisse, M. Cord, and F. Precioso, “Locality-sensitive hashing for chi2 distance,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 2, pp. 402–409, 2012. View at Publisher · View at Google Scholar · View at Scopus
  22. W. H. Lee, Continuous and discrete properties of stochastic processes [Ph.D. thesis], The University of Nottingham, Nottingham, UK, 2010.
  23. G. M. Morton, “A computer oriented geodetic data base and a new technique in file sequencing,” Tech. Rep., IBM, Ottawa, Canada, 1966. View at Google Scholar
  24. A. Broder and M. Mitzenmacher, “Network applications of Bloom filters: a survey,” Internet Mathematics, vol. 1, no. 4, pp. 485–509, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. S. Tarkoma, E. R. Christian, and L. Eemil, “Theory and practice of bloom filters for distributed systems,” IEEE Communications Surveys and Tutorials, vol. 14, no. 1, pp. 131–155, 2012. View at Publisher · View at Google Scholar · View at Scopus
  26. Y. Hua, B. Xiao, B. Veeravalli, and D. Feng, “Locality-sensitive Bloom filter for approximate membership query,” IEEE Transactions on Computers, vol. 61, no. 6, pp. 817–830, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. K.-Y. Whang, B. T. Vander-Zanden, and H. M. Taylor, “Linear-time probabilistic counting algorithm for database applications,” ACM Transactions on Database Systems, vol. 15, no. 2, pp. 208–229, 1990. View at Publisher · View at Google Scholar · View at Scopus
  28. L. Fan, P. Cao, J. Almeida, and A. Z. Broder, “Summary cache: a scalable wide-area Web cache sharing protocol,” IEEE/ACM Transactions on Networking, vol. 8, no. 3, pp. 281–293, 2000. View at Publisher · View at Google Scholar · View at Scopus
  29. General Purpose Hash Function Algorithms, http://partow.net/programming/hashfunctions/index.html.
  30. A. R. Barron, “Entropy and the central limit theorem,” The Annals of Probability, vol. 14, no. 1, pp. 336–342, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  31. Reuters-21578 Text Categorization Collection, http://kdd.ics.uci.edu/databases/reuters21578/reuters21578.html.