OpenRaiser/Intern-Atlas huggingface dataset:
Experiments on the Determination of the Reltionships Between Terms
Authors: Clement T. Yu, Vijay V. Raghavan
Venue: SIGIR
Year: 1978

The retrieval effectiveness of an automatic method that uses relevance judgements for the determination of positive as well as negative relationships between terms is evaluated. The term relationships are incorporated into the retrieval process by using a generalized similarity function that has a term match component, a positive term relationship component, and a negative term relationship component. Two strategies, query partitioning and query clustering, for the evaluation of the effectiveness of the term relationships are investigated. The latter appears to be more attractive from linguistic as well as economic points of view. The positive and the negative relationships are verified to be effective both when used individually, and in combination. The importance attached to the term relationship components relative to that of term match component is found to have a substantial effect on the retrieval performance. The usefulness of discriminant analysis as a technique for determining the relative importance of these components is investigated.
On the Implementation of Some Models of Document Retrieval
Authors: W. Bruce Croft
Venue: SIGIR
Year: 1979

Recently several models of the search process in a document retrieval system have been proposed and retrieval experiments have shown that they will improve system performance. These include models which use relevance judgements to rank documents in order of probability of relevance and models of retrieval from clusters of documents. In this paper various models are compared in terms of the ease with which they could be implemented. An important consideration is how this implementation would be affected by the introduction of new hardware such as content-addressable memories. The main conclusion is that models which concentrate on improving the effectiveness of the search process are not rendered redundant by the availability of new hardware. However, the efficiency of their implementation would be improved.
Use of Dynamic Discrimination Values in a Document Retrieval System
Authors: Robert T. Dattola
Venue: SIGIR
Year: 1979

The use of discrimination values as a term weighting function in document retrieval systems is examined. It is shown that regular discrimination values are too costly to compute after every update to the data base. Dynamic discrimination values that are easy to update are defined for use as approximations to regular values. Experiments are performed comparing regular vs. dynamic discrimination values. Actual user queries from an operational data base are used to evaluate dynamic discrimination values in a production environment. Generalized forms of normalized recall and precision are used as evaluation measures. Retrieval results indicate statistically significant improvements using dynamic discrimination weighting.
Automated Monitoring to Support the Analysis and Evaluation of Information Systems
Authors: Wayne D. Dominick, W. David Penniman
Venue: SIGIR
Year: 1979

This paper is based on, and extracted in part from, a much more expanded and detailed manuscript entitled "Monitoring and Evaluation of On-Line Information System Usage", accepted for publication in Information Processing and Management.
Online Personal Bibliographic Retrieval System
Authors: Emily G. Fayen, Susan B. Baird
Venue: SIGIR
Year: 1979

The Norris Cotton Cancer Center (NCCC) On-Line Personal Bibliographic Retrieval System was developed to assist researchers at the Center in managing personal or project-related collections of reference materials. The system supports on-line entry, storage, and retrieval of bibliographic citations for collections of books, journal articles, reprints, reports, manuscripts, other documents, and audio-visual materials.The NCCC system is intended for relatively small collections of materials (under 10,000 items) and is not intended to duplicate or compete in any way with MEDLARS, CANCERLINE, or any of the other on-line bibliographic retrieval services. It is similar in concept to Mitre's SHOEBOX (1), but is much less complex and requires far less computer resources. The major advantage of the NCCC system is that it is simple, small, and easy to use.None of the techniques used in developing the NCCC system is particularly new or innovative. Rather, several well-known approaches to bibliographic retrieval were combined to produce a system that was easy and inexpensive to develop and is easy and inexpensive to use. The system is now running on the Dartmouth College Computing system's equivalent of a Honeywell 66/DPS-3. The programs are all written in BASIC.
Document Storage and Retrieval
Authors: Salah A. Khairy, George C. Miller
Venue: SIGIR
Year: 1979

article Document storage and retrieval Share on Authors: Salah A. Khairy Arab Organization for Industrialization Arab Organization for IndustrializationView Profile , George C. Miller E-Systems, Inc. E-Systems, Inc.View Profile Authors Info & Claims ACM SIGIR ForumVolume 14Issue 2September 1979 pp 78–82https://doi.org/10.1145/1013232.511718Online:01 September 1979Publication History 0citation370DownloadsMetricsTotal Citations0Total Downloads370Last 12 Months3Last 6 weeks0 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
An Empirical Comparison: Tree and Lattice Structures for Symbolic Data Bases
Authors: Lawrence J. Mazlack
Venue: SIGIR
Year: 1979

Unidirectional trees and lattices may both be used to hold a symbolic data base consisting of lexes, lexemes or other symbol strings. This paper empirically compares placing symbolic information into both trees and lattices (a lattice may be thought of as a unidirectional network with single and initiating and terminating nodes).
A Clustering Strategy Based on a Formalism of the Reproductive Process in Natural Systems
Authors: Vijay V. Raghavan, Kim Birchard
Venue: SIGIR
Year: 1979

Given a set of objects each of which is represented by a finite number of attributes or features and a clustering criterion that associates a value of utility to any classification, the objective of a clustering method is to identify that classification of the objects which optimizes the criterion. A new strategy to solve this problem is developed. The approach is, in essence, a modification of the reproductive plan, a type of adaptive procedure devised by Holland [2], which embodies many principles found in the adaptation of natural systems through evolution. The proposed approach differs from conventional methods in the sense that the search through the space of possible solutions proceeds in a parallel fashion.The adaptive clustering strategy requires the specification of methods for the generation of an initial population of classifications, the parent selection, the modifications and the replacement of current classifications with new ones. The effects of changing several of these features are investigated. Experimental results show that it is possible to devise clustering strategies based on the principles of adaptation in natural systems that are both effective and efficient.
The Role of Information Retrieval in the Second Computer Revolution
Authors: R. K. Wiersba
Venue: SIGIR
Year: 1979

Information retrieval is conceptually fundamental in human communication as well as in man-computer communication. Computing and Information Retrieval professionals have the opportunity to apply information retrieval techniques within the second computer revolution to foster a new potential revolution in education, brought about by the advent of the personal computer.
Restricted Evaluation in Information Retrieval
Authors: Peter Bollmann, Vladimir S. Cherniavsky
Venue: SIGIR
Year: 1981

article Restricted evaluation in information retrieval Share on Authors: P. Bollmann Technische Universität Berlin Technische Universität BerlinView Profile , V. S. Cherniavsky Technische Universität Braunschweig Technische Universität BraunschweigView Profile Authors Info & Claims ACM SIGIR ForumVolume 16Issue 1Summer 1981 pp 15–21https://doi.org/10.1145/1013228.511757Online:31 May 1981Publication History 5citation252DownloadsMetricsTotal Citations5Total Downloads252Last 12 Months1Last 6 weeks0 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
The Generalized Retrieval Problem
Authors: Abraham Bookstein
Venue: SIGIR
Year: 1981

article Free Access Share on The generalized retrieval problem Author: A. Bookstein University of Chicago University of ChicagoView Profile Authors Info & Claims ACM SIGIR ForumVolume 16Issue 1Summer 1981 pp 4–14https://doi.org/10.1145/1013228.511756Published:31 May 1981Publication History 1citation231DownloadsMetricsTotal Citations1Total Downloads231Last 12 Months5Last 6 weeks0 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
Performance Measurement in a Fuzzy Retrieval Environment
Authors: Duncan A. Buell, Donald H. Kraft
Venue: SIGIR
Year: 1981

We shall consider retrieval performance measures for generalized (non-Boolean) queries and indexing functions. The meanings of recall and precision in such a generalized system will be discussed. Finally, we shall explore the meaning and difficulty of using such measures to compare Boolean and non-Boolean retrieval systems.
Content Analysis as a Word-Processing Option
Authors: John M. Carroll
Venue: SIGIR
Year: 1981

A simple content-analysis program incorporated in a word-processing system can display the most significant sentence of a page of text and give a short list of the more important words. This could help authors write titles, summaries, and descriptor lists. The content-analysis program relies on word frequency, precedence, and co-occurrence as indicators of content significance. Test show it performs at least as well as some trained indexers.
Incorporating Different Search Models into One Document Retrieval System
Authors: W. Bruce Croft
Venue: SIGIR
Year: 1981

Many effective search strategies derived from different models are available for document retrieval systems. However, it does not appear that there is a single most effective strategy. Instead, different strategies perform optimally under different conditions. This paper outlines the design of an adaptive document retrieval system that chooses the best search strategy for a particular situation and user. In order to be able to support a variety of search strategies, a general network representation of the documents and terms in the database is proposed. This network representation leads to efficient methods of generating and using document and term classifications.One of the most desirable features of an adaptive system would be the ability to learn from experience. A method of incorporating this learning ability into the system is described. The adaptive control strategy for choosing search strategies enables the system to base its actions on a number of factors, including a model of the current user.Finally, some ideas for a flexible interface for casual users are suggested. Part of this interface is the heuristic search, which is used when searches based on formal models have failed. The heuristic search provides a browsing capability for the user.
The Basis for a Theory of Information Retrieval
Authors: Jason Farradane
Venue: SIGIR
Year: 1981

article Free Access Share on The basis for a theory of information retrieval Author: J. Farradane University of Western Ontario, London, Ontario, Canada N6A 5B9 University of Western Ontario, London, Ontario, Canada N6A 5B9View Profile Authors Info & Claims ACM SIGIR ForumVolume 16Issue 1Summer 1981 pp 1–3https://doi.org/10.1145/1013228.511755Published:31 May 1981Publication History 0citation359DownloadsMetricsTotal Citations0Total Downloads359Last 12 Months19Last 6 weeks6 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
Document Classification, Indexing and Abstracting May be Inherently Difficult Problems
Authors: Aviezri S. Fraenkel
Venue: SIGIR
Year: 1981

The main features of document indexing are abstracted. It is shown that the easy part of indexing, namely the question whether there is a bounded number of descriptors for indexing a document is NP-complete. Thus even the most efficient algorithm for exact indexing is not, at least at the present time, bounded by a polynomial-time function.
Outline of a Dynamic Self-Tuning and Adaptive Information Retrieval System
Authors: Hans-Ludwig Hausen
Venue: SIGIR
Year: 1981

A self-tuning adaptive information retrieval system as an extension of the concept of a "classical" document retrieval system, is outlined. This system accepts documents and search requests in natural language, as well as the system-proposals previously produced by the system itself or prepared by the system operator. It produces a system-proposal that consists of a list of documents ranked according to their relevance to the query.Incorporated into the system is a system valuation subsystem that uses weighted relevance judgements. This subsystem gives as output an effectiveness value and an efficiency value: both together measure the quality of an information retrieval system.The computation of the quality values and the values themselves are independent of a specific implementation. The retrieval process in this system consists of two parts, namely a query-document match and a query-query match.
Document Contents Representation Model of Sentence Retrieval System SCAT-IR
Authors: Michiyo Nikkuni, Hajime Tanaka
Venue: SIGIR
Year: 1981

A "Document Contents Representation" (DCR) model is introduced from a formal viewpoint to deal with the entire contents of a document such as individual sentences of a text, bibliography, references, etc. in a scientific information system. A "Mapping Definition Language" (MDL) is proposed to map directly and naturally the document contents into the DCR model. An application of the DCR model and MDL to scientific documents is shown. Some examples of advanced retrieval by SCAT-IR system implemented on the basis of the DCR model and MDL are illustrated.
Spatial Representations of Knowledge: Validity and Applications to Information Science
Authors: Terry Noreault, John F. Dovidio
Venue: SIGIR
Year: 1981

This research examined the relationship between subjects' knowledge of an area and their similarity ratings of pairs of concepts. Knowledge was operationalized as (1) test score performance, and (2) correspondence with an expert's similarity judgments. Subjects (n=55) were exposed to a three-week module on social psychology as part of their introductory psychology course. At the end of this course segment they were administered an examination and, later, a term similarity questionnaire. Students' similarity ratings related to both exam score and similarity ratings of the expert. Furthermore, as expected, test performance was strongly related (r=+.55) to the correlation with the expert's similarity judgments. A model based on term similarity judgments was proposed as a theoretical explanation of how term dependence models influence information retrieval system performance.
Term Frequency and Term Value
Authors: Stephen E. Robertson
Venue: SIGIR
Year: 1981

article Free Access Share on Term frequency and term value Author: S. E. Robertson City University, London, U.K. City University, London, U.K.View Profile Authors Info & Claims ACM SIGIR ForumVolume 16Issue 1Summer 1981pp 22–29https://doi.org/10.1145/1013228.511758Published:31 May 1981Publication History 4citation583DownloadsMetricsTotal Citations4Total Downloads583Last 12 Months54Last 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 Publisher SiteeReaderPDF
The Nearest Neighbour Problem in Information Retrieval: An Algorithm Using Upperbounds
Authors: Alan F. Smeaton, C. J. van Rijsbergen
Venue: SIGIR
Year: 1981

article Free Access Share on The nearest neighbour problem in information retrieval: an algorithm using upperbounds Authors: A. F. Smeaton University College Dublin, Belfield, Dublin University College Dublin, Belfield, DublinView Profile , C. J. van Rijsbergen University College Dublin, Belfield, Dublin University College Dublin, Belfield, DublinView Profile Authors Info & Claims ACM SIGIR ForumVolume 16Issue 1Summer 1981 pp 83–87https://doi.org/10.1145/1013228.511767Published:31 May 1981Publication History 45citation583DownloadsMetricsTotal Citations45Total Downloads583Last 12 Months54Last 6 weeks3 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
On the Limitations of Document Ranking Algorithms in Information Retrieval
Authors: Keith H. Stirling
Venue: SIGIR
Year: 1981

A document retrieval system should rank documents in order of their usefulness or satisfaction to the users. This principle was first explicated in the classic paper by Maron and Kuhns (1). Additional considerations concerning document ranking have been suggested by other researchers (2,3). Particular attention will be given here to the ranking algorithm appropriate for those presenting the same request, but having different information needs. The research on which this report is based identifies limitations associated with sequencing rules that use a probability ranking technique (4). Three basic and somewhat interdependent limitations will be discussed.
Simulation of User Judgments in Bibliographic Retrieval Systems
Authors: Jean Tague, Michael J. Nelson
Venue: SIGIR
Year: 1981

The general model and simulation algorithms for bibliographic retrieval systems presented in an earlier paper are expanded. The new model integrates the physical as well as the logical and semantic elements of these systems. A modified algorithm is developed for the simulation of user relevance judgments, and is validated, by means of recall-precision curves and a Kolmogorov-Smirnov test of recall, for two test collections. Other approaches to goodness-of-fit testing are suggested.
A Comparison of Search Term Weighting: Term Relevance vs. Inverse Document Frequency
Authors: Harry Wu, Gerard Salton
Venue: SIGIR
Year: 1981

The term relevance weighting method has been shown to produce optimal information retrieval queries under well-defined conditions. The parameters needed to generate the term relevance factors cannot unfortunately be estimated accurately in practice; futhermore, in realistic test situations, it appears difficult to obtain improved retrieval results using the term relevance weights over much simpler term weighting systems such as, for example, the inverse document frequency weights.It is shown in this study that the inverse document frequency weights and the term relevance weights are closely related over a wide range of the frequency spectrum. Methods are introduced for estimating the term relevance weights, and experimental results are given comparing the inverse document frequency with the estimated term relevance weights.
An Approach to Probabilistic Retrieval
Authors: Clement T. Yu, K. Lam
Venue: SIGIR
Year: 1981

The objective is to relate the effectiveness of retrieval, the fuzzy set concept and the processing of Boolean query. The use of a probabilistic retrieval scheme is motivated. It is found that there is a correspondence between probabilistic retrieval schmes and fuzzy sets. A fuzzy set corresponding to a potentially optimal probabilistic retrieval scheme is obtained. Then the retrieval scheme for the fuzzy set is constructed.
An Evaluation of Term Dependence Models in Information Retrieval
Authors: Gerard Salton, Chris Buckley, Clement T. Yu
Venue: SIGIR
Year: 1982

In practical retrieval environments the assumption is normally made that the terms assigned to the documents of a collection occur independently of each other. The term independence assnmption is unrealistic in many cases, but its use leads to a simple retrieval algorithm. More realistic retrieval systems take into account dependencies between certain term pairs and possibly between term triples. In this study, methods are outlined for generating dependency factors for term pairs and term triples and for using them in retrieval. Evaluation output is included to demonstrate the effectiveness of the suggested methodologies. i. Term Dependency Models From a decision-theoretic viewpoint, the information retrieval task is con-trolled by two probabilistic parameters which specify for each document of a collec-tion the probability of relevance, and the probability of nonrelevance, with respect to a particular query. The larger the probability of relevance, and the smaller the probability of nonrelevance, the greater is the retrieval probability for the given item. Consider in particular an item ~ in the data base represented by binary attri-butes (Xl,X2,...,Xn), where x i takes on the values i or 0 depending on whether the ith attribute is or is not assigned to item ~. For each item ~ and each query Q, it is in principle possible to generate the two parameters P(xJrel) and P(x[nonrel), representing the probabilities that a relevant and a nonrelevant item, respectively, has vector representation ~. Using decision theoretic considerations, it is easy to show that an optimal retrieval rule will rank the documents in decreasing order according to the expression P(x!ret) P(~[nonrel) (I) That is, given two items x and v, x should be retrieved ahead of ~ whenever the value of expression (I) for x exceeds the corresponding value for ~. [1-5]
The Normalized Recall and Related Measures
Authors: Peter Bollmann
Venue: SIGIR
Year: 1983

The normalized recall is one of the most popular evaluation measures for information retrieval systems. In this paper an overview of its development is given. It is then shown that the normalized recall is closely related to other measures such as the CRE-measure and the expected search length. Some implications are analysed.