Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rodger J. McNab

dblp:08/6242 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorArtificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 56% Query processing and optimization · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization › cost estimation
query execution time prediction
0.011998
Predicting Query Times · SIGIR 1998
Information retrieval
search engines
0.011998
Predicting Query Times · SIGIR 1998
Information retrieval › user interaction
user feedback
0.011998
Predicting Query Times · SIGIR 1998

Methods — techniques the papers use, named apart from their topics

query time modeling · 0.0learning from sample queries · 0.0
YearPublicationVenuePosition
2000 A compression-based algorithm for Chinese word segmentation
abstract
Chinese is written without using spaces or other word delimiters. Although a text may be thought of as a corresponding sequence of words, there is considerable ambiguity in the placement of boundaries. Interpreting a text as a sequence of words is beneficial for some information retrieval and storage tasks: for example, full-text search, word-based compression, and keyphrase extraction. We describe a scheme that infers appropriate positions for word boundaries using an adaptive language model that is standard in text compression. It is trained on a corpus of presegmented text, and when applied to new text, interpolates word boundaries so as to maximize the compression obtained. This simple and general method performs well with respect to specialized schemes for Chinese language segmentation.
William John Teahan, Yingying Wen, Rodger J. McNab, Ian H. Witten
Comput. Linguistics3
2000 Tune Retrieval in the Multimedia Library
Rodger J. McNab, Lloyd A. Smith, Ian H. Witten, Clare L. Henderson
Multim. Tools Appl.1
1998 Predicting Query Times
abstract
We outline the need for search engines to provide user feedback on the expected time for a query, describe a scheme for learning a model of query time by observing sample queries, and discuss the results obtained for a set of actual user queries on a document collection using the MG search engine.
Rodger J. McNab, Ian H. Witten, Carl Gutwin
SIGIR1
1997 Visualising sequences of queries: a new tool for information retrieval
abstract
This paper describes a system that uses visualisation to assist a user in dealing with the information returned from a search engine. The user's queries, and the documents they return, are represented by a 3D spatial structure that shows their relationships and provides a way of accessing and exploring the documents retrieved. It is implemented to work with the New Zealand Digital Library, a set of large document collections that is available over the Web. The visualisation scheme is a Java applet that is updated dynamically whenever the user makes a new search, and can be browsed alongside the search engine.
Russell Beale, Rodger J. McNab, Ian H. Witten
IV2