Now showing items 1-9 of 9
A searcher in MARIAN is a class manager that can map abstract descriptions into weighted sets of matching class instances. This presentation focuses on linked-based, class-based, node-based, and context-based searchers.
The World According to MARIAN: How the Document Universe is Represented and Searched in the MARIAN/ Academy Digital Library Search System
This presentation focuses on MARIAN (Multiple Access Retrieval of library Information with ANotations), an online library catalog information system. MARIAN is intended for library end-users rather than catalogers, provides ...
Use and Usability in a Digital Library Search System
(Virginia Tech Digital Library Research Laboratory, 1999)
Digital libraries must reach out to users from all walks of life, serving information needs at all levels. To do this, they must attain high standards of usability over an extremely broad audience. This paper details the ...
Weights and Measures: An Axiomatic Model for Similarity Computations
This paper proposes a formal model for similarity functions, first over arbitrary objects, then over sets and the sorts of weighted sets that are found in text retrieval systems. Using a handful of axioms and constraints, ...
Information Interactions: User Interface Objects for CODER, INCARD, and MARIAN, v. 2.5
Any information system needs a user interface: a program or program module that eases the communication between the system's users and the underlying search and storage software. This document describes (part of) the ...
MARIAN (Multiple Access Retrieval of library Information with ANotations) is an online library catalog information system. Intended for library end-users rather than catalogers, it provides controlled search by author, ...
Indexing Large Collections of Small Text Records for Ranked Retrieval
The MARIAN online public access catalog system at Virginia Tech has been developed to apply advanced information retrieval methods and object-oriented technology to the needs of library patrons. We give a description of ...
When Stopping Rules Don't Stop
Performing ranked retrieval on large document collections can be slow. The method of stopping rules has been proposed to make it more efficient. Stopping rules, which terminate search when the highest ranked documents have ...
The Academy: A Community of Information Retrieval Agents
We commonly picture text as a sequence of words; or alternatively as a sequence of paragraphs, each of which is composed of a sequence of sentences, each of which is itself a sequence of words. It is also worth noting that ...