Descriptor
Source
Information Processing and… | 19 |
Author
Craven, Timothy C. | 2 |
Bookstein, A. | 1 |
Bookstein, Abraham | 1 |
Can, Fazli | 1 |
Danilowicz, Czeslaw | 1 |
Eastman, Caroline M. | 1 |
Egghe, L. | 1 |
Elata, Smadar | 1 |
Kamel, M. | 1 |
Klein, S. T. | 1 |
Lu, Xin | 1 |
More ▼ |
Publication Type
Journal Articles | 19 |
Reports - Research | 15 |
Opinion Papers | 7 |
Information Analyses | 2 |
Reports - Descriptive | 2 |
Speeches/Meeting Papers | 1 |
Education Level
Audience
Researchers | 5 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating

Craven, Timothy C. – Information Processing and Management, 1991
Discussion of graph-drawing algorithms compares and evaluates five algorithms for generated automatic graphic display of sentence dependency structures that have been implemented in the TEXTNET text structure management system. Evaluation criteria are discussed, and a test of the algorithms with a database of newspaper articles is described. (16…
Descriptors: Algorithms, Comparative Analysis, Database Management Systems, Databases

Wisniewski, Janusz L. – Information Processing and Management, 1986
Discussion of a new method of index term dictionary compression in an inverted-file-oriented database highlights a technique of word coding, which generates short fixed-length codes obtained from the index terms themselves by analysis of monogram and bigram statistical distributions. Substantial savings in communication channel utilization are…
Descriptors: Algorithms, Database Management Systems, Databases, Information Retrieval

Savoy, Jacques – Information Processing and Management, 1994
Proposes a new learning algorithm to improve the retrieval effectiveness of the search system used in the hypertext environment using an extended Boolean model with links to improve the ranking of retrieved items. Highlights include the basic retrieval scheme, the learning scheme, and a review of basic probabilistic retrieval models. (Contains 32…
Descriptors: Algorithms, Database Design, Databases, Hypermedia

Shen, Sheldon – Information Processing and Management, 1988
Describes a model for a front end query processor to deal with incomplete information in a database. The effectiveness of the processor in restricting the number of objects to be processed in a query and in aiding the interpretation of a query is discussed. (26 references) (Author/CLB)
Descriptors: Algorithms, Computational Linguistics, Databases, Mathematical Formulas

Kamel, M.; And Others – Information Processing and Management, 1990
Discusses the problem of processing fuzzy queries in databases and information retrieval systems and presents a prototype of a fuzzy query processing system for databases that is based on data clustering and uses Pascal programing language. Clustering schemes are explained, and the system architecture that uses natural language is described. (14…
Descriptors: Algorithms, Cluster Grouping, Computer System Design, Databases

Lu, Xin – Information Processing and Management, 1990
Describes the development of a structural model of document retrieval based on lexical-semantic relationships between index terms. An algorithm that uses tree-to-tree distance to measure structural closeness between a document and a query statement is explained, and the proposed model is compared to a vector retrieval model. (18 references) (LRW)
Descriptors: Algorithms, Databases, Distance, Documentation

Voorhees, Ellen M. – Information Processing and Management, 1986
Describes a computerized information retrieval system that uses three agglomerative hierarchic clustering algorithms--single link, complete link, and group average link--and explains their implementations. It is noted that these implementations have been used to cluster a collection of 12,000 documents. (LRW)
Descriptors: Algorithms, Cluster Analysis, Databases, Information Retrieval

Margulis, Eugene L. – Information Processing and Management, 1993
Reports on the validity of the Multiple Poisson (nP) model of word distribution in full-text document collections. A practical algorithm for determining whether a certain word is distributed according to an nP distribution and the results of a test of this algorithm in three different document collections are described. (14 references) (KRN)
Descriptors: Algorithms, Full Text Databases, Graphs, Information Retrieval

Bookstein, A.; Klein, S. T. – Information Processing and Management, 1990
Describes the theoretical framework of a retrieval system that uses data structures called bitmaps to improve search algorithms for medium-sized systems. Information retrieval systems that contain the full text of the documents are discussed, and the use of inverted files such as concordances for small texts is explained. (24 references) (LRW)
Descriptors: Algorithms, Data Processing, Full Text Databases, Indexes

Motzkin, D. – Information Processing and Management, 1994
Describes fast, dynamic update algorithms for document retrieval systems. B-trees are discussed; the M-B-T file directory structure is explained; insertions and deletions in inverted files are described; and performance evaluation is discussed. An appendix provides the formal definition of an M-B-T directory. (Contains 18 references.) (LRW)
Descriptors: Algorithms, Database Management Systems, Information Retrieval, Subject Index Terms

Egghe, L. – Information Processing and Management, 1988
Presents a mathematical theory that can be used to define concentration places of objects within unordered classes. The application to research on the evolution of journals and subject areas is illustrated, and an online method of calculating concentration evolution is described. (1 references) (CLB)
Descriptors: Algorithms, Bibliometrics, Classification, Databases

Nageswara Rao, S. V.; And Others – Information Processing and Management, 1985
Discusses properties of multiple attribute tree (MAT) and inverted file structures; establishes suitability of MAT data structure for bibliographic files using worst-case performance measures; provides arguments to establish MAT average case superiority; and proposes an efficient adaptation of MAT data structure to exploit special features of MAT…
Descriptors: Algorithms, Comparative Analysis, Data Processing, Databases

Eastman, Caroline M. – Information Processing and Management, 1989
Compares the performance of inverted and signature file organizations in handling incrementally specified Boolean queries to an information retrieval system. The discussion covers the impact of more sophisticated signature file organizations, related problems, and possible future work. (65 references) (CLB)
Descriptors: Algorithms, Comparative Analysis, Database Management Systems, Information Retrieval

Danilowicz, Czeslaw – Information Processing and Management, 1994
Discusses end-user searching in Boolean information retrieval systems considers the role of search intermediaries and proposes a model of user preferences that incorporates a user's profile. Highlights include document representation; information queries; document output ranking; calculating user profiles; and selecting documents for a local…
Descriptors: Algorithms, Comparative Analysis, Databases, Information Retrieval

Sheridan, Paraic; Smeaton, Alan F. – Information Processing and Management, 1992
Describes a process of morpho-syntactic language analysis for information retrieval. Tree Structured Analytics (TSA) used for text representation is summarized; the matching process developed for such structures is outlined with an example appended; and experiments carried out to evaluate the effectiveness of TSA matching are discussed. (26…
Descriptors: Algorithms, Full Text Databases, Information Retrieval, Research Needs
Previous Page | Next Page ยป
Pages: 1 | 2