Article

Extracting query modifications from nonlinear SVMs

Authors:

Eric J. Glover,

Steve Lawrence,

C. Lee GilesAuthors Info & Claims

WWW '02: Proceedings of the 11th international conference on World Wide Web

Pages 317 - 324

https://doi.org/10.1145/511446.511488

Published: 07 May 2002 Publication History

Abstract

When searching the WWW, users often desire results restricted to a particular document category. Ideally, a user would be able to filter results with a text classifier to minimize false positive results; however, current search engines allow only simple query modifications. To automate the process of generating effective query modifications, we introduce a sensitivity analysis-based method for extracting rules from nonlinear support vector machines. The proposed method allows the user to specify a desired precision while attempting to maximize the recall. Our method performs several levels of dimensionality reduction and is vastly faster than searching the combination feature space; moreover, it is very effective on real-world data.

References

[1]

W. Cohen. Fast effective rule induction. In Proc. of the Twelfth Int. Conf. on Machine Learning, pages 115--123. Morgan Kaufmann, 1995.]]

Digital Library

[2]

G. W. Flake and S. Lawrence. Efficient SVM regression training with SMO. Machine Learning, 46(1/3):271--290, 2002.]]

Digital Library

[3]

S. Gauch, G. Wang, and M. Gomez. ProFusion: Intelligent fusion from multiple, distributed search engines. Journal of Universal Computer Science, 2(9), 1996.]]

[4]

S. Gauch, G. Wang, and M. Gomez. ProFusion: Intelligent fusion from multiple, distributed search engines. Journal of Universal Computer Science, 2(9), 1996.Glover, S. Lawrence, W. P. Birmingham, and C. L. Giles. Architecture of a metasearch engine that supports user information needs. In Eighth International Conference on Information Knowledge Management (CIKM'99), pages 210--216, Kansas City, MO, November 1999. ACM Press.]]

Digital Library

[5]

E. J. Glover, S. Lawrence, M. D. Gordon, W. P. Birmingham, and C. L. Giles. Recommending web documents based on user preferences. In ACM SIGIR 99 Workshop on Recommender Systems, Berkeley, CA, August 1999. ACM Press.]]

[6]

E. Glover, G. Flake, S. Lawrence, W. P. Birmingham, A. Kruger, C. L. Giles, and D. Pennock. Improving category specific web search by learning query modifications. In Symposium on Applications and the Internet, SAINT, San Diego, CA, January 8--12 2001.]]

Digital Library

[7]

A. E. Howe and D. Dreilinger. SavvySearch: A meta-search engine that learns which search engines to query. AI Magazine, 18(2), 1997.]]

[8]

T. Joachims. Text categorization with support vector machines: learning with many relevant features. In C. Nédellec and C.~Rouveirol, editors, Proceedings of ECML-98, 10th European Conference on Machine Learning, number 1398, pages 137--142, Chemnitz, DE, 1998. Springer-Verlag, Heidelberg, DE.]]

Digital Library

[9]

T. Joachims. Transductive inference for text classification using support vector machines. In Proc. 16th International Conf. on Machine Learning, pages 200--209. Morgan Kaufmann, San Francisco, CA, 1999.]]

Digital Library

[10]

S. Lawrence and C. L. Giles. Context and page analysis for improved web search. IEEE Internet Computing, July-August, pages 38--46, 1998.]]

Digital Library

[11]

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. MIT Press, 1998.]]

Digital Library

[12]

J. Platt. Using sparseness and analytic QP to speed training of support vector machines. In M. S. Kearns, S. A. Solla, and D. A. Cohn, editors, Advances in Neural Information Processing Systems 11. MIT Press, 1999.]]

Digital Library

[13]

E. Selberg and O. Etzioni. The MetaCrawler architecture for resource aggregation on the Web. IEEE Expert, (January--February):11--14, 1997.]]

[14]

G. G. Towell and J. W. Shavlik. Extracting refined rules from knowledge-based neural networks. Machine Learning, 13:71, 1993.]]

Digital Library

[15]

V. Vapnik. The Nature of Statistical Learning Theory. Springer Verlag, New York, 1995.]]

Cited By

Yan SLin WWu TXiao DZheng XWu BLiu KChampin PGandon FMédini LLalmas MIpeirotis P(2018)Beyond Keywords and RelevanceProceedings of the 2018 World Wide Web Conference10.1145/3178876.3186172(1919-1928)Online publication date: 10-Apr-2018
https://dl.acm.org/doi/10.1145/3178876.3186172
Borisyuk FKenthapadi KStein DZhao BKrishnapuram BShah MSmola AAggarwal CShen DRastogi R(2016)CaSMoSProceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining10.1145/2939672.2939718(441-450)Online publication date: 13-Aug-2016
https://dl.acm.org/doi/10.1145/2939672.2939718
Liu BMobasher BNasraoui OLiu B(2011)Web Usage MiningWeb Data Mining10.1007/978-3-642-19460-3_12(527-603)Online publication date: 15-Apr-2011
https://doi.org/10.1007/978-3-642-19460-3_12
Show More Cited By

Index Terms

Extracting query modifications from nonlinear SVMs
1. Information systems
  1. Information retrieval
    1. Information retrieval query processing

Recommendations

Disjunctive Sets of Phrase Queries for Diverse Query Suggestion
WI '19: IEEE/WIC/ACM International Conference on Web Intelligence

This paper proposes a method of suggesting expanded queries that disambiguate the original Web query which has multiple interpretations. In order to produce a diverse set of queries including those corresponding to infrequent query intents, our method ...
Characterizing stages of a multi-session complex search task through direct and indirect query modifications
SIGIR '13: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval

Search systems use context to effectively satisfy a user's information need as expressed by a query. Tasks are important factors in determining user context during search and many studies have been conducted that identify tasks and task stages through ...
The semantics of query modification
RIAO '10: Adaptivity, Personalization and Fusion of Heterogeneous Information

We present a method that exploits 'linked data' to determine semantic relations between consecutive user queries. Our method maps queries onto concepts in linked data and searches the linked data graph for direct or indirect relations between the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

WWW '02: Proceedings of the 11th international conference on World Wide Web

May 2002

754 pages

ISBN:1581134495

DOI:10.1145/511446

Conference Chairs:
David Lassner
University of Hawaii
,
Dave De Roure
University of Southampton
,
Arun Iyengar
IBM T.J. Watson Research Center

Copyright © 2002 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: 07 May 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

WWW02

Sponsor:

ACM

WWW02: Hypermedia Track of the Eleventh International World-Wide Web Conference

May 7 - 11, 2002

Hawaii, Honolulu, USA

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
351
Total Downloads

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

Reflects downloads up to 29 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yan SLin WWu TXiao DZheng XWu BLiu KChampin PGandon FMédini LLalmas MIpeirotis P(2018)Beyond Keywords and RelevanceProceedings of the 2018 World Wide Web Conference10.1145/3178876.3186172(1919-1928)Online publication date: 10-Apr-2018
https://dl.acm.org/doi/10.1145/3178876.3186172
Borisyuk FKenthapadi KStein DZhao BKrishnapuram BShah MSmola AAggarwal CShen DRastogi R(2016)CaSMoSProceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining10.1145/2939672.2939718(441-450)Online publication date: 13-Aug-2016
https://dl.acm.org/doi/10.1145/2939672.2939718
Liu BMobasher BNasraoui OLiu B(2011)Web Usage MiningWeb Data Mining10.1007/978-3-642-19460-3_12(527-603)Online publication date: 15-Apr-2011
https://doi.org/10.1007/978-3-642-19460-3_12
Guo SRamakrishnan NCheung DSong IChu WHu XLin J(2009)Mining linguistic cues for query expansionProceedings of the 18th ACM conference on Information and knowledge management10.1145/1645953.1645998(335-344)Online publication date: 2-Nov-2009
https://dl.acm.org/doi/10.1145/1645953.1645998
Anagnostopoulos ABroder APunera K(2008)Effective and efficient classification on a search-engine modelKnowledge and Information Systems10.5555/3227237.322751016:2(129-154)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.5555/3227237.3227510
Sarawagi S(2008)Information ExtractionFoundations and Trends in Databases10.1561/19000000031:3(261-377)Online publication date: 1-Mar-2008
https://dl.acm.org/doi/10.1561/1900000003
Ipeirotis PGravano L(2008)Classification-aware hidden-web text database selectionACM Transactions on Information Systems10.1145/1344411.134441226:2(1-66)Online publication date: 8-Apr-2008
https://dl.acm.org/doi/10.1145/1344411.1344412
Okabe MYamada S(2007)Semisupervised Query Expansion with Minimal FeedbackIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2007.19064619:11(1585-1589)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1109/TKDE.2007.190646
Anagnostopoulos ABroder APunera K(2007)Effective and efficient classification on a search-engine modelKnowledge and Information Systems10.1007/s10115-007-0102-616:2(129-154)Online publication date: 13-Sep-2007
https://doi.org/10.1007/s10115-007-0102-6
Anagnostopoulos ABroder APunera KYu PTsotras VFox ELiu B(2006)Effective and efficient classification on a search-engine modelProceedings of the 15th ACM international conference on Information and knowledge management10.1145/1183614.1183648(208-217)Online publication date: 6-Nov-2006
https://dl.acm.org/doi/10.1145/1183614.1183648
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