Article

Efficient top-k hyperplane query processing for multimedia information retrieval

Authors:

Edward Y. ChangAuthors Info & Claims

MM '06: Proceedings of the 14th ACM international conference on Multimedia

Pages 317 - 326

https://doi.org/10.1145/1180639.1180712

Published: 23 October 2006 Publication History

Abstract

A query can be answered by a binary classifier, which separates the instances that are relevant to the query from the ones that are not. When kernel methods are employed to train such a classifier, the class boundary is represented as a hyperplane in a projected space. Data instances that are farthest from the hyperplane are deemed to be most relevant to the query, and that are nearest to the hyperplane to be most uncertain to the query. In this paper, we address the twin problems of efficient retrieval of the approximate set of instances (a) farthest from and (b) nearest to a query hyperplane. Retrieval of instances for this hyperplane-based query scenario is mapped to the range-query problem allowing for the reuse of existing index structures. Empirical evaluation on large image datasets confirms the effectiveness of our approach.

References

[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.]]

Digital Library

[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.]]

Digital Library

[3]

A. Ben-Hur, D. Horn, H. Siegelmann, and V. Vapnik. Support vector clustering. Journal of Machine Learning Research, 2:125--137, 2001.]]

Digital Library

[4]

B. E. Boser, I. Guyon, and V. Vapnik. A training algorithm for optimal margin classifiers. In Computational Learing Theory, pages 144--152, 1992.]]

Digital Library

[5]

C. J. C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2):121--167, 1998.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[10]

R. Collobert and S. Bengio. SVMTorch: Support vector machines for large-scale regression problems. Journal of Machine Learning Research, 1:143--160, 2001.]]

Digital Library

[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.]]

Digital Library

[12]

A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In The VLDB Journal, pages 518--529, 1999.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[15]

M. E. Houle and J. Sakuma. Fast approximate similarity search in extremely high-dimensional data sets. In ICDE, 2004.]]

Digital Library

[16]

P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. of 30th STOC, pages 604--613, 1998.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[22]

A. P. Natsev, M. R. Naphade, and J. Te?si'c. Learning the semantics of multimedia queries and concepts from a small number of examples. In ACM Multimedia, pages 598--607, 2005.]]

Digital Library

[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. Scholkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods - Support Vector Learning, 1998.]]

Digital Library

[25]

H. Samet. The quadtree and related hierarchical data structures. ACM Computing Surveys, 16(2), pages 187--260, 1984.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[28]

V. Vapnik. Statistical Learning Theory. John Wiley and Sons, 1998.]]

Cited By

Kim YKo IHan WYu H(2014)iKernelInformation Sciences: an International Journal10.1016/j.ins.2013.09.017257(32-53)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1016/j.ins.2013.09.017
Chen YRen XZhang GXu R(2013)Ontology-guided organ detection to retrieve web images of disease manifestation: towards the construction of a consumer-based health image libraryJournal of the American Medical Informatics Association10.1136/amiajnl-2012-00138020:6(1076-1081)Online publication date: 1-Nov-2013
https://doi.org/10.1136/amiajnl-2012-001380
Leung CChan AMilani ALiu JLi Y(2012)Intelligent Social Media Indexing and Sharing Using an Adaptive Indexing Search EngineACM Transactions on Intelligent Systems and Technology10.1145/2168752.21687613:3(1-27)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1145/2168752.2168761
Show More Cited By

Index Terms

Efficient top-k hyperplane query processing for multimedia information retrieval
1. Information systems
  1. Information systems applications

Recommendations

Efficient Top-k Query Answering through its Top-N Rewritings Using Views
PIKM '15: Proceedings of the 8th Workshop on Ph.D. Workshop in Information and Knowledge Management

Recently, various algorithms were proposed to speed up top-k query answering by using multiple materialized query results. Nevertheless, for most of the proposed algorithms, a potentially costly view selection operation is required. In fact, the ...
Scalable and efficient processing of top-k multiple-type integrated queries
Abstract
In this paper, we define a new class of queries, the top-k multiple-type integrated query (simply, top-k MULTI query). It deals with multiple data types and finds the information in the order of relevance between the query and the object. Various ...
Nonparallel hyperplane support vector machine for binary classification problems

In this paper, we propose a nonparallel hyperplane support vector machine (NHSVM) for binary classification problems. Our proposed NHSVM is formulated by clustering the training points according to the similarity between classes. It constructs two ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MM '06: Proceedings of the 14th ACM international conference on Multimedia

October 2006

1072 pages

ISBN:1595934472

DOI:10.1145/1180639

General Chairs:
Klara Nahrstedt
UIUC
,
Matthew Turk
UCSB
,
Program Chairs:
Yong Rui
Microsoft Research
,
Wolfgang Klas
Universität Wien
,
Ketan Mayer-Patel
UNC

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 October 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

MM06

Sponsor:

MM06: The 14th ACM International Conference on Multimedia 2006

October 23 - 27, 2006

CA, Santa Barbara, USA

Acceptance Rates

Overall Acceptance Rate 2,145 of 8,556 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
355
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kim YKo IHan WYu H(2014)iKernelInformation Sciences: an International Journal10.1016/j.ins.2013.09.017257(32-53)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1016/j.ins.2013.09.017
Chen YRen XZhang GXu R(2013)Ontology-guided organ detection to retrieve web images of disease manifestation: towards the construction of a consumer-based health image libraryJournal of the American Medical Informatics Association10.1136/amiajnl-2012-00138020:6(1076-1081)Online publication date: 1-Nov-2013
https://doi.org/10.1136/amiajnl-2012-001380
Leung CChan AMilani ALiu JLi Y(2012)Intelligent Social Media Indexing and Sharing Using an Adaptive Indexing Search EngineACM Transactions on Intelligent Systems and Technology10.1145/2168752.21687613:3(1-27)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1145/2168752.2168761
Chen YZhang GXu RLuo GLiu JYang C(2012)Semi-supervised image classification for automatic construction of a health image libraryProceedings of the 2nd ACM SIGHIT International Health Informatics Symposium10.1145/2110363.2110379(111-120)Online publication date: 28-Jan-2012
https://dl.acm.org/doi/10.1145/2110363.2110379
Zhou GTing KLiu FYin Y(2012)Relevance feature mapping for content-based multimedia information retrievalPattern Recognition10.1016/j.patcog.2011.09.01645:4(1707-1720)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1016/j.patcog.2011.09.016
Yu HKo IKim YHwang SHan WSellis TMiller RKementsietsidis AVelegrakis Y(2011)Exact indexing for support vector machinesProceedings of the 2011 ACM SIGMOD International Conference on Management of data10.1145/1989323.1989398(709-720)Online publication date: 12-Jun-2011
https://dl.acm.org/doi/10.1145/1989323.1989398
Chang EChang E(2011)Approximate High-Dimensional Indexing with KernelFoundations of Large-Scale Multimedia Information Management and Retrieval10.1007/978-3-642-20429-6_11(231-258)Online publication date: 26-Aug-2011
https://doi.org/10.1007/978-3-642-20429-6_11
Zhou GTing KLiu FYin Y(2010)Relevance feature mapping for content-based image retrievalProceedings of the Tenth International Workshop on Multimedia Data Mining10.1145/1814245.1814247(1-10)Online publication date: 25-Jul-2010
https://dl.acm.org/doi/10.1145/1814245.1814247
Liu DHua KCheung DSong IChu WHu XLin J(2009)Incremental query evaluation for support vector machinesProceedings of the 18th ACM conference on Information and knowledge management10.1145/1645953.1646238(1815-1818)Online publication date: 2-Nov-2009
https://dl.acm.org/doi/10.1145/1645953.1646238
Litayem SJoly ABoujemaa NGao WRui YHanjalic AXu CSteinbach EEl Saddik AZhou M(2009)Interactive objects retrieval with efficient boostingProceedings of the 17th ACM international conference on Multimedia10.1145/1631272.1631352(545-548)Online publication date: 23-Oct-2009
https://dl.acm.org/doi/10.1145/1631272.1631352
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents