Efficient top-k hyperplane query processing for multimedia information retrieval

Proceedings of the 14th Annual ACM International Conference on Multimedia, MM 2006

Volumn , Issue , 2006, Pages 317-326

  Panda, Navneet ^a   Chang, Edward Y ^a  

^a University of California   (United States)

Author keywords

Kernel based methods; Retrieval; Support vector machines

Indexed keywords

HYPERPLANE-BASED QUERY; KERNEL BASED METHODS; RANGE-QUERY PROBLEMS;

BOUNDARY CONDITIONS; INFORMATION RETRIEVAL; MULTIMEDIA SYSTEMS; PROBLEM SOLVING; SUPPORT VECTOR MACHINES; UNCERTAIN SYSTEMS;

QUERY PROCESSING;

EID: 34547223405     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1180639.1180712     Document Type: Conference Paper

References (28)

1. S. Arya, D. Mount, N. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. In Proceedings of the 5th SODA, pages 573-82, 1994.
2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, May 23-25, 1990, pages 322-331. ACM Press, 1990.
3. A. Ben-Hur, D. Horn, H. Siegelmann, and V. Vapnik. Support vector clustering. Journal of Machine Learning Research, 2:125-137, 2001.
4. B. E. Boser, I. Guyon, and V. Vapnik. A training algorithm for optimal margin classifiers. In Computational Learing Theory, pages 144-152, 1992.
5. C. J. C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2):121-167, 1998.
6. C-C. Chang and C-J. Lin. LIBSVM: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/cjlin/ libsvm.
7. M.-Y. Chen, M. Christel, A. Hauptmann, and H. Wactlar. Putting active learning into multimedia applications; dynamic definition and refinement of concept classifiers. In ACM Multimedia, 2005.
8. P. Ciaccia and M. Patella. Pac nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In In Proceedings of International Conference on Data Engineering, pages 244-255, 2000.
9. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. VLDB, pages 426-435, 1997.
10. R. Collobert and S. Bengio. SVMTorch: Support vector machines for large-scale regression problems. Journal of Machine Learning Research, 1:143-160, 2001.
11. D. DeCoste and K. WagstafF. Alpha seeding for support vector machines. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, pages 345-359, 2000.
12. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In The VLDB Journal, pages 518-529, 1999.
13. A. Guttman. R-trees: A dynamic index structure for spatial searching. In B. Yormark, editor, SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, June 18-21, 1984, pages 47-57. ACM Press, 1984.
14. X. He, W.-Y. Ma, O. King, M. Li, and H. Zhang. Learning and inferring a semantic space from user's relevance feedback for image retrieval. In ACM Multimedia, pages 343-346, 2002.
15. M. E. Houle and J. Sakuma. Fast approximate similarity search in extremely high-dimensional data sets. In ICDE, 2004.
16. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. of 30th STOC, pages 604-613, 1998.
17. T. Joachims. Making large-scale svm learning practical. In Schölkopf, Burges, and Smola, editors, Advances in Kernel Methods - Support Vector Learning. MIT-Press, 1999.
18. N. Katayama and S. Satoh. The SR-tree: an index structure for high-dimensional nearest neighbor queries. In ACM SIGMOD Int. Conf. on Management of Data, pages 369-380, 1997.
19. D. A. Keim. Tutorial on high-dimensional index structures: Database support for next decades applications. In Proceedings of the ICDE, 2000.
20. K.-I. Lin, H. V. Jagadish, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. VLDB Journal: Very Large Data Bases, 3(4):517-542, 1994.
21. K.-I. Lin, H. V. Jagadish, and C. Faloutsos. The tv-tree: An index structure for high-dimensional data. VLDB Journal, 3(4):517-542, 1994.
22. A. P. Natsev, M. R. Naphade, and J. Tešić. Learning the semantics of multimedia queries and concepts from a small number of examples. In ACM Multimedia, pages 598-607, 2005.
23. N. Panda and E. Y. Chang. Exploiting geometry for support vector machine indexing. In SIAM International Data Mining Conference, 2005.
24. J. Platt. Fast training of support vector machines using sequential minimal optimization. In B. Schölkopf, C Burges, and A. Smola, editors, Advances in Kernel Methods -Support Vector Learning, 1998.
25. H. Samet. The quadtree and related hierarchical data structures. ACM Computing Surveys, 16(2), pages 187-260, 1984.
26. S. Tong and E. Y. Chang. Support vector machine active learning for image retrieval. In ACM International Conference on Multimedia (MM), pages 107-118, 2001.
27. S. Tong and D. Koller. Support vector machine active learning with applications to text classification. In P. Langley, editor, Proceedings of ICML, pages 999-1006, Stanford, US, 2000. Morgan Kaufmann Publishers, San Francisco, US.
28. V. Vapnik. Statistical Learning Theory. John Wiley and Sons, 1998.