Descriptor
| Algorithms | 2 |
| Validity | 2 |
| Access to Information | 1 |
| Cluster Grouping | 1 |
| Comparative Analysis | 1 |
| Information Retrieval | 1 |
| Information Storage | 1 |
| Mathematical Formulas | 1 |
| Mathematical Logic | 1 |
| Search Strategies | 1 |
Source
| Information Processing &… | 2 |
Author
| Aoe, Jun-ichi | 1 |
| Koyama, Masafumi | 1 |
| Kraft, Donald | 1 |
| Nieto Sanchez, Salvador | 1 |
| Okada, Makoto | 1 |
| Shishibori, Masami | 1 |
| Triantaphyllou, Evangelos | 1 |
Publication Type
| Journal Articles | 2 |
| Reports - Descriptive | 1 |
| Reports - Research | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedNieto Sanchez, Salvador; Triantaphyllou, Evangelos; Kraft, Donald – Information Processing & Management, 2002
Proposes a new approach for classifying text documents into two disjoint classes. Highlights include a brief overview of document clustering; a data mining approach called the One Clause at a Time (OCAT) algorithm which is based on mathematical logic; vector space model (VSM); and comparing the OCAT to the VSM. (Author/LRW)
Descriptors: Algorithms, Cluster Grouping, Comparative Analysis, Mathematical Logic
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
