Descriptor
| Algorithms | 2 |
| Information Retrieval | 2 |
| Search Strategies | 2 |
| Validity | 2 |
| Access to Information | 1 |
| Bibliometrics | 1 |
| Cluster Analysis | 1 |
| Comparative Analysis | 1 |
| Evaluation Methods | 1 |
| Information Storage | 1 |
| Literature Reviews | 1 |
| More ▼ | |
Publication Type
| Journal Articles | 2 |
| Information Analyses | 1 |
| Reports - Descriptive | 1 |
| Reports - Evaluative | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedShishibori, Masami; Koyama, Masafumi; Okada, Makoto; Aoe, Jun-ichi – Information Processing & Management, 2000
Discusses information retrieval and the use of binary trees as a fast access method for search strategies such as hashing. Proposes new methods based on compact binary trees that provide faster access and more compact storage, explains the theoretical basis, and confirms the validity of the methods through empirical observations. (LRW)
Descriptors: Access to Information, Algorithms, Information Retrieval, Information Storage
Peer reviewedWillett, Peter – Information Processing and Management, 1988
Reviews recent research into the use of hierarchic agglomerative clustering methods for document retrieval. The topics discussed include the calculation of interdocument similarities, algorithms used to implement clustering methods on large databases, validity testing of document hierarchies, appropriate search strategies, and other applications…
Descriptors: Algorithms, Bibliometrics, Cluster Analysis, Comparative Analysis
