NotesFAQContact Us
Collection
Advanced
Search Tips
Descriptor
Algorithms2
Information Retrieval2
Access to Information1
Evaluation Methods1
Information Storage1
Knowledge Representation1
Mathematical Formulas1
Search Strategies1
Semantics1
Validity1
Source
Information Processing &…2
Author
Koyama, Masafumi2
Aoe, Jun-Ichi1
Aoe, Jun-ichi1
Fuketa, Masao1
Morita, Kazuhiro1
Okada, Makoto1
Shishibori, Masami1
Publication Type
Journal Articles2
Reports - Descriptive2
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Showing all 2 results Save | Export
A Fast Retrieving Algorithm of Hierarchical Relationships Using Trie Structures.
Peer reviewed Peer reviewed
Koyama, Masafumi; Morita, Kazuhiro; Fuketa, Masao; Aoe, Jun-Ichi – Information Processing & Management, 1998
Presents a faster method for determining hierarchical relationships in information retrieval by using trie structures instead of a linear storage of a concept code. Highlights include case structures, a knowledge representation for natural-language understanding with semantic constraints; a compression algorithm of tries; and evaluation.…
Descriptors: Algorithms, Evaluation Methods, Information Retrieval, Knowledge Representation
Two Improved Access Methods on Compact Binary (CB) Trees.
Peer reviewed Peer reviewed
Shishibori, 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