Zhang, Dell and Lee, W.S. (2008) Learning with support vector machines for query-by-multiple-examples. In: Oard, D.W. and Sebastiani, F. and Chua, T.-S. and Leong, M.-K. (eds.) Proceedings of the 31st Annual International ACM SIGIR conference on Research and Development in information Retrieval - SIGIR '08. ACM conference proceedings series 906. New York, U.S.: ACM Press, pp. 835-836. ISBN 9781605581644.
Abstract
We explore an alternative Information Retrieval paradigm called Query-By-Multiple-Examples (QBME) where the information need is described not by a set of terms but by a set of documents. Intuitive ideas for QBME include using the centroid of these documents or the well-known Rocchio algorithm to construct the query vector. We consider this problem from the perspective of text classification, and find that a better query vector can be obtained through learning with Support Vector Machines (SVMs). For online queries, we show how SVMs can be learned from one-class examples in linear time. For offline queries, we show how SVMs can be learned from positive and unlabeled examples together in linear or polynomial time. The effectiveness and efficiency of the proposed approaches have been confirmed by our experiments on four real-world datasets.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Birkbeck Knowledge Lab |
| Depositing User: | Administrator |
| Date Deposited: | 30 May 2013 08:43 |
| Last Modified: | 09 Aug 2023 12:33 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7077 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
