A Supervised Learning Algorithm for Binary Domain Classification of Web Queries using SERPs

April 30, 2016 Β· Declared Dead Β· πŸ› ACM/IEEE Joint Conference on Digital Libraries

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Alexander Nwala, Michael Nelson arXiv ID 1605.00184 Category cs.IR: Information Retrieval Citations 3 Venue ACM/IEEE Joint Conference on Digital Libraries Last Checked 4 months ago
Abstract
General purpose Search Engines (SEs) crawl all domains (e.g., Sports, News, Entertainment) of the Web, but sometimes the informational need of a query is restricted to a particular domain (e.g., Medical). We leverage the work of SEs as part of our effort to route domain specific queries to local Digital Libraries (DLs). SEs are often used even if they are not the "best" source for certain types of queries. Rather than tell users to "use this DL for this kind of query", we intend to automatically detect when a query could be better served by a local DL (such as a private, access-controlled DL that is not crawlable via SEs). This is not an easy task because Web queries are short, ambiguous, and there is lack of quality labeled training data (or it is expensive to create). To detect queries that should be routed to local, specialized DLs, we first send the queries to Google and then examine the features in the resulting Search Engine Result Pages (SERPs), and then classify the query as belonging to either the scholar or non-scholar domain. Using 400,000 AOL queries for the non-scholar domain and 400,000 queries from the NASA Technical Report Server (NTRS) for the scholar domain, our classifier achieved a precision of 0.809 and F-measure of 0.805.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted