OpenRaiser/Intern-Atlas huggingface dataset:
On Extending the Vector Space Model for Boolean Query Processing
Authors: S. K. Michael Wong, Wojciech Ziarko, Vijay V. Raghavan, P. C. N. Wong
Venue: SIGIR
Year: 1986

An information retrieval model, named the Generalized Vector Space Model (GVSM), is extended to handle situations where queries are specified as (extended) Boolean expressions. It is shown that this unified model, unlike currently available alternatives, has the advantage of incorporating term correlations into the retrieval process. The query language extension is attractive in the sense that most of the algebraic properties of the strict Boolean language are still preserved. Although the experimental results for extended Boolean retrieval are not always better than the vector processing method, the developments here are significant in facilitating commercially available retrieval systems to benefit from the vector based methods. The proposed scheme is compared to the p-norm model advanced by Salton and coworkers. An important conclusion is that it is desirable to investigate further extensions that can offer the benefits of both proposals.
Non-Binary Independence Model
Authors: Clement T. Yu, T. C. Lee
Venue: SIGIR
Year: 1986

Article Free Access Share on Non-binary independence model Authors: C. T. Yu Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, Illinois Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, IllinoisView Profile , T. C. Lee Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, Illinois Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, IllinoisView Profile Authors Info & Claims SIGIR '86: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrievalSeptember 1986 Pages 265–268https://doi.org/10.1145/253168.253224Published:01 September 1986Publication History 3citation584DownloadsMetricsTotal Citations3Total Downloads584Last 12 Months33Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
The Use of Inference Mechanisms to Improve the Retrieval Facilities from Large Relational Databases
Authors: Gian Piero Zarri
Venue: SIGIR
Year: 1986

This paper describes the development of “intelligent” tools aimed at improving the retrieval facilities from large relational databases. When a natural language query does not correspond directly to the data contained in the base, a class of inferential processes called “transformations” is applied. The original query is thus automatically converted into one or more “semantically close” ones. “Semantically close” means that the data possibly obtained with the new query will give useful information about the data originally searched for.
Adaptive Linear Information Retrieval Models
Authors: Peter Bollmann, S. K. Michael Wong
Venue: SIGIR
Year: 1987

Missing, non-applicable and imprecise values arise frequently in Office Information Systems. There is a need to treat them in a consistent and useful manner. This paper proposes a method and gives the precise semantics of the retrieval operations in a system where imprecision is allowed. It also suggests a way to handle the uncertainty introduced by imprecise data values.
Outline of a Knowledge Base Model for an Intelligent Information Retrieval System
Authors: Marie-France Bruandet
Venue: SIGIR
Year: 1987

We attempt in this paper to outline a method for the automatic construction of a knowledge base. We propose some methods and a domain knowledge model. A new idea is to conceive a system that is able to each phase of its construction to acquire domain knowledge from all new information that it is building, in particular the indexing terms; the last section is an attempt in this sense.
TIRS: A Topological Information Retrieval System Satisfying the Requirements of the Waller-Kraft Wish List
Authors: Steven C. Cater, Donald H. Kraft
Venue: SIGIR
Year: 1987

Most document retrieval systems based on probabilistic models of feature distributions assume random selection of documents for retrieval. The assumptions of these models are met when documents are randomly selected from the database or when retrieving all available documents. A more suitable model for retrieval of a single document assumes that the best document available is to be retrieved first. Models of document retrieval systems assuming random selection and best-first selection are developed and compared under binary independence and two Poisson independence feature distribution models. Under the best-first model, feature discrimination varies with the number of documents in each relevance class in the database. A weight similar to the Inverse Document Frequency weight and consistent with the best-first model is suggested which does not depend on knowledge of the characteristics of relevant documents.
Improved Techniques for Processing Queries in Full-Text Systems
Authors: Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal
Venue: SIGIR
Year: 1987

In static full-text retrieval systems, which accommodate metrical as well as Boolean operators, the traditional approach to query processing uses a “concordance”, from which large sets of coordinates are retrieved and then merged and/or collated. Alternatively, in a system with l documents, the concordance can be replaced by a set of bit-maps of fixed length l, which are constructed for every different word of the database and serve as occurrence maps. We propose to combine the concordance and bit-map approaches, and show how this can speed up the processing of queries: fast ANDing and ORing of the maps in a preprocessing stage, lead to large I/O savings in collating coordinates of keywords needed to satisfy the metrical and Boolean constraints. Moreover, the bit-maps give partial information on the distribution of the coordinates of the keywords, which can be used when queries must be processed by stages, due to their complexity and the sizes of the involved sets of coordinates. The new techniques are partially implemented at the Responsa Retrieval Project.
An Approach to Natural Language Processing for Document Retrieval
Authors: W. Bruce Croft, David D. Lewis
Venue: SIGIR
Year: 1987

Document retrieval systems have been restricted, by the nature of the task, to techniques that can be used with large numbers of documents and broad domains. The most effective techniques that have been developed are based on the statistics of word occurrences in text. In this paper, we describe an approach to using natural language processing (NLP) techniques for what is essentially a natural language problem - the comparison of a request text with the text of document titles and abstracts. The proposed NLP techniques are used to develop a request model based on “conceptual case frames” and to compare this model with the texts of candidate documents. The request model is also used to provide information to statistical search techniques that identify the candidate documents. As part of a preliminary evaluation of this approach, case frame representations of a set of requests from the CACM collection were constructed. Statistical searches carried out using dependency and relative importance information derived from the request models indicate that performance benefits can be obtained.
File Organizations and Incrementally Specified Queries
Authors: Caroline M. Eastman
Venue: SIGIR
Year: 1987

Queries to information retrieval systems are often incrementally specified as a result of user interaction with the system. However, most discussions of file organizations consider only completely specified queries. The choice of file organizations to support such incremental specification is discussed qualitatively in this extended abstract. (Quantitative comparisons are partially complete and are not presented here.) Organizations which are advantageous for completely specified queries are not necessarily so for incrementally specified queries (and vice versa).
Automatic Phrase Indexing for Document Retrieval: An Examination of Syntactic and Non-Syntactic Methods
Authors: Joel L. Fagan
Venue: SIGIR
Year: 1987

An automatic phrase indexing method based on the term discrimination model is described, and the results of retrieval experiments on five document collections are presented. Problems related to this non-syntactic phrase construction method are discussed, and some possible solutions are proposed that make use of information about the syntactic structure of document and query texts.
Probabilistic Search Term Weighting-Some Negative Results
Authors: Norbert Fuhr, Peter Müller
Venue: SIGIR
Year: 1987

The effect of probabilistic search term weighting on the improvement of retrieval quality has been demonstrated in various experiments described in the literature. In this paper, we investigate the feasibility of this method for boolean retrieval with terms from a prescribed indexing vocabulary. This is a quite different test setting in comparison to other experiments where linear retrieval with free text terms was used. The experimental results show that in our case no improvement over a simple coordination match function can be achieved. On the other hand, models based on probabilistic indexing outperform the ranking procedures using search term weights.
A Failure Analysis on the Limitations of Suffixing in an Online Environment
Authors: Donna Harman
Venue: SIGIR
Year: 1987

The interaction of suffixing algorithms and ranking techniques in retrieval performance, particularly in an online environment, was investigated. Three general purpose suffixing algorithms were used for retrieval on the Cranfield 1400, Medlars, and CACM collections, and the results analysed with several standard evaluation measures. An examination of the retrieval performance using suffixing suggested two modifications to ranking techniques: variable weighting of word variants and selective stemming depending on query length. The experimental data is presented, and the limitations of suffixing in an online environment is discussed.
Illustrated Description of an Interactive Knowledge-Based Indexing System
Authors: Susanne M. Humphrey
Venue: SIGIR
Year: 1987

This report discusses the Indexing Aid Project for conducting research in interactive knowledge-based indexing of the medical literature. After providing an overview and background, we describe and illustrate the Indexing Aid System using an extended example, highlighting the knowledge-based capabilities of the system, namely, inheritance and internal retrieval, enforcement of restrictions, and other functions implemented by procedural attachments, which are characteristic of frame-based knowledge representation languages. A feature which generates reports for evaluating the system is also shown. The paper concludes with discussion of the research plan. The project is part of the Automated Classification and Retrieval Program at the Lister Hill National Center for Biomedical Communications, the research and development arm of the National Library of Medicine.
A Retrieval System for On-Line English-Japanese Dictionaries
Authors: Tetsuro Ito, Mana Kubota
Venue: SIGIR
Year: 1987

Article A retrieval system for on-line English-Japanese dictionaries Share on Authors: T. Ito University of Library and Information Science, Kasuga 1-2, Yatabe-machi, Tsukuba-gun, Ibraki-ken 305, Japan University of Library and Information Science, Kasuga 1-2, Yatabe-machi, Tsukuba-gun, Ibraki-ken 305, JapanView Profile , M. Kubota University of Library and Information Science, Kasuga 1-2, Yatabe-machi, Tsukuba-gun, Ibraki-ken 305, Japan University of Library and Information Science, Kasuga 1-2, Yatabe-machi, Tsukuba-gun, Ibraki-ken 305, JapanView Profile Authors Info & Claims SIGIR '87: Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrievalNovember 1987 Pages 181–186https://doi.org/10.1145/42005.42026Published:01 November 1987 1citation369DownloadsMetricsTotal Citations1Total Downloads369Last 12 Months1Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
EP-X: A Demonstration of Semantically-Based Search of Bibliographic Databases
Authors: Deb A. Krawczak, Philip J. Smith, Steven J. Shute
Venue: SIGIR
Year: 1987

EP-X (Environmental Pollution eXpert) is a prototype knowledge-based system that assists users in conducting bibliographic searches of the environmental pollution literature. This system combines artificial intelligence and human factors engineering techniques, allowing us to redesign traditional bibliographic information retrieval interfaces. The result supports semantically-based search as opposed to the typical character-string matching approach. This paper discusses
Some Considerations for Approximate Optimal Queries
Authors: K. L. Kwok
Venue: SIGIR
Year: 1987

An optimal query has been defined as one which will recover all the known relevant documents of a query in their best probability of relevance ranking. We have slightly modified the definition so that it also allows one to trace its evolution from the original to the optimal via the various feedback stages. Such a query can be constructed by modifying the original query with terms from the known relevant documents. It is pointed out that such a term addition strategy differs materially from other approaches that add terms based on term association with all query terms, and calculated from the whole document collection. The effect of viewing a document as constituted of components, and hence affecting the weighting and retreival results of of the optimal query, is also discussed.
A Formal Treatment of Missing and Imprecise Information
Authors: Joan M. Morrissey, C. J. van Rijsbergen
Venue: SIGIR
Year: 1987

Missing, non-applicable and imprecise values arise frequently in Office Information Systems. There is a need to treat them in a consistent and useful manner. This paper proposes a method and gives the precise semantics of the retrieval operations in a system where imprecision is allowed. It also suggests a way to handle the uncertainty introduced by imprecise data values.
A VLSI Chip for Efficient Transmission and Retrieval of Information
Authors: Amar Mukherjee, Mostafa A. Bassiouni
Venue: SIGIR
Year: 1987

In this paper, we present a functional description of a VLSI chip aimed at reducing the cost of data transmission and data access within information processing machines and distributed information systems. The chip maps standard character codes (e.g., ASCII) into more efficient codes (e.g., Huffman's codes) using a tree module of basic cells. In bit-serial communication controllers, for example, the parallel-to-serial transformation unit can be simply replaced by the proposed chip. The VLSI design can provide speeds that far exceed current and projected peak transfer rates of high-speed disks and communication controllers.
Fast Object Partitioning Using Stochastic Learning Automata
Authors: B. John Oommen, Daniel C. Y. Ma
Venue: SIGIR
Year: 1987

Let Ω = {A1, …, AW} be a set of W objects to be partitioned into R classes {P1, …, PR}. The objects are accessed in groups of unknown size and the size of these groups need not be equal. Additionally, the joint access probabilities of the objects are unknown. The intention is that the objects accessed more frequently together are located in the same class. This problem has been shown to be NP-hard [15, 16]. In this paper, we propose two stochastic learning automata solutions to the problem. Although the first one is relatively fast, its accuracy is not so remarkable in some environments. The second solution, which uses a new variable structure stochastic automation, demonstrates an excellent partitioning capability. Experimentally, this solution converges an order of magnitude faster than the best known algorithm in the literature [15, 16].
An Approach to Image Retrieval from Large Image Databases
Authors: Fausto Rabitti, Peter L. Stanchev
Venue: SIGIR
Year: 1987

In this paper we address the problem of retrieving images from large image databases, giving a partial description of the image content. This approach allows a limited automatic analysis for image belonging to a domain described in advance to the system using a formalism based on fuzzy sets. The image query processing is based on special access structures generated from the image analysis process.
Optimal Determination of User-Oriented Clusters
Authors: Vijay V. Raghavan, Jitender S. Deogun
Venue: SIGIR
Year: 1987

User-oriented clustering schemes enable the classification of documents based upon the user perception of the similarity between documents, rather than on some similarity function presumed by the designer to represent the user criteria. In this paper, an enhancement of such a clustering scheme is presented. This is accomplished by the formulation of the user-oriented clustering as a function-optimization problem. The problem formulated is termed the Boundary Selection Problem (BSP). Heuristic approaches to solve the BSP are proposed and a preliminary for evaluation of these approaches is provided.
Predictive Text Compression by Hashing
Authors: Timo Raita, Jukka Teuhola
Venue: SIGIR
Year: 1987

The knowledge of a short substring constitutes a good basis for guessing the next character in a natural language text. This observation, i.e. repeated guessing and encoding of subsequent characters, is very fundamental for the predictive text compression. The paper describes a family of such compression methods, using a hash table for searching the prediction information. The experiments show that the methods produce good compression gains and, moreover, are very fast. The one-pass versions are especially apt for “on-the-fly” compression of transmitted data, and could be a basis for specialized hardware.
Non-Hierarchic Document Clustering Using the ICL Distributed Array Processor
Authors: Edie M. Rasmussen, Peter Willett
Venue: SIGIR
Year: 1987

This paper considers the suitability and efficiency of a highly parallel computer, the ICL Distributed Array Processor (DAP), for document clustering. Algorithms are described for the implementation of the single-pass and reallocation clustering methods on the DAP and on a conventional mainframe computer. These methods are used to classify the Cranfield, Vaswani and UKCIS document test collections. The results suggest that the parallel architecture of the DAP is not well suited to the variable-length records which characterise bibliographic data.
A Relational Model for Unstructured Documents
Authors: Airi Salminen
Venue: SIGIR
Year: 1987

The logical structure of a document is usually a tree in which the order of the nodes is important at least at some level of the tree. We call a document unstructured if its structure is a single-level ordered tree. The purpose of this paper is to present a many-sorted algebra for handling unstructured documents. The documents in the model are represented by relations. An algebra for handling documents of one type can be extended to an algebra for handling documents of several types. Further, an algebra for handling documents can be extended by the relational algebra for handling documents and relations in a common algebra. The model of this paper can be regarded as a part of a general document model. On the other hand, unstructured documents themselves are an important group of documents. We will show by examples that the simple model covers a wide range of document handling and information retrieval problems.
Thesaurus Based Concept Spaces
Authors: Peter Schäuble
Venue: SIGIR
Year: 1987

b) ~ NT* R-axioms R) p(a b) for all (a,b) ~ RT (7 p(a b)) for all (a,b) ~ RT U-axiom U) (Vxl) (~(xt al) v... v o(x 1 an) ) where T = {a 1 .... a n}
Data Caching in Information Retrieval Systems
Authors: Patricia Simpson, Rafael Alonso
Venue: SIGIR
Year: 1987

Information retrieval (IR) systems provide individual remote access to centrally managed data. The current proliferation of personal computer systems, as well as advances in storage and communication technology, have created new possibilities for designing information systems which are easily accessible, economical, and responsive to user needs. This paper outlines methods of integrating personal computers (PCs) into large information systems, with emphasis on effective use of the storage and processing capabilities of these computers. In particular we discuss means for caching retrieved data at PC-equipped user sites, noting that caching in this environment poses unique problems. An event-driven simulation program is described which models information system operation. This simulator is being used to examine caching strategies. Some results of these studies are presented.
MICROARRAS: An Advanced Full-Text Retrieval and Analysis System
Authors: John B. Smith, Stephen F. Weiss, Gordon J. Ferguson
Venue: SIGIR
Year: 1987

MICROARRAS is an advanced full-text retrieval and analysis system. It supports fast, efficient browsing of a document's vocabulary as well as its text, recursive analytic categories, Boolean search with flexible context specifications, evaluation of arithmetic expressions, and graphical display of various numeric distributions. The system is designed to work with large textbases stored on remote mainframes or on a local store for a micro-computer or workstation. The description covers system architecture, design principals, as well as user functions.
Generating an Individualized User Interface: From Novice to Expert
Authors: Jean Tague
Venue: SIGIR
Year: 1987

A model of the interface to an information retrieval system is developed based on the semantic data model. Using this framework, a method of developing customized user interfaces is described, in general terms and in a specific implementation in the Interface Builder module of the Western Information Retrieval System.
Enriched Knowledge Representations for Information Retrieval
Authors: F. N. Teskey
Venue: SIGIR
Year: 1987

In this paper we identify the need for a new theory of information. An information model is developed which distinguishes between data, as directly observable facts, information, as structured collections of data, and knowledge as methods of using information. The model is intended to support a wide range of information systems. In the paper we develop the use of the model for a semantic information retrieval system using the concept of semantic categories. The likely benefits of this area discussed, though as yet no detailed evaluation has been conducted.