Publication Date
| In 2026 | 0 |
| Since 2025 | 7 |
| Since 2022 (last 5 years) | 72 |
| Since 2017 (last 10 years) | 79 |
| Since 2007 (last 20 years) | 79 |
Descriptor
| Algorithms | 133 |
| Classification | 133 |
| Artificial Intelligence | 43 |
| Information Retrieval | 26 |
| Prediction | 25 |
| Models | 21 |
| Accuracy | 19 |
| Learning Analytics | 17 |
| Foreign Countries | 14 |
| Automation | 12 |
| Comparative Analysis | 12 |
| More ▼ | |
Source
Author
| White, Lee J. | 3 |
| Sangjin Kim | 2 |
| Sijia Huang | 2 |
| Yu, Clement T. | 2 |
| A. I. Makinde | 1 |
| Abdullahi Yusuf | 1 |
| Adam Fleischhacker | 1 |
| Aissaoui, Karima | 1 |
| Alanah Grant St. James | 1 |
| Alexander von Eye | 1 |
| Altmann, G. | 1 |
| More ▼ | |
Publication Type
Education Level
| Higher Education | 25 |
| Postsecondary Education | 25 |
| Elementary Education | 7 |
| Secondary Education | 4 |
| Early Childhood Education | 3 |
| Middle Schools | 3 |
| Primary Education | 3 |
| Grade 2 | 2 |
| Junior High Schools | 2 |
| Grade 3 | 1 |
| Grade 6 | 1 |
| More ▼ | |
Audience
| Researchers | 7 |
| Practitioners | 2 |
| Teachers | 2 |
Location
| Massachusetts (Boston) | 2 |
| South Korea | 2 |
| Turkey | 2 |
| China | 1 |
| Delaware | 1 |
| Estonia | 1 |
| Ghana | 1 |
| Indiana | 1 |
| Netherlands | 1 |
| Pennsylvania (Philadelphia) | 1 |
| Texas | 1 |
| More ▼ | |
Laws, Policies, & Programs
Assessments and Surveys
| National Assessment of… | 2 |
| Program for International… | 2 |
| Eysenck Personality Inventory | 1 |
| SAT (College Admission Test) | 1 |
What Works Clearinghouse Rating
Peer reviewedZaki, M.; Elboraey, F. – Information Processing and Management, 1985
Investigates applicability of inverted file processing in magnetic bubble memories by presenting four magnetic bubble memory models as storage mediums: one based on a major-minor loop configuration; one utilizing a decoder design on a magnetic bubble memory chip; and two based on different structural configurations of the first two. (MBR)
Descriptors: Algorithms, Classification, Computer Storage Devices, Data Processing
Peer reviewedGonzales, Michael G. – Computer Education, 1984
Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)
Descriptors: Algorithms, Classification, College Mathematics, Computer Programs
Peer reviewedMacready, George B.; Dayton, C. Mitchell – Psychometrika, 1992
An adaptive testing algorithm is presented based on an alternative modeling framework, and its effectiveness is investigated in a simulation based on real data. The algorithm uses a latent class modeling framework in which assessed latent attributes are assumed to be categorical variables. (SLD)
Descriptors: Adaptive Testing, Algorithms, Bayesian Statistics, Classification
Peer reviewedPrice, Lydia J. – Multivariate Behavioral Research, 1993
The ability of the NORMIX algorithm to recover overlapping population structures was compared to the OVERCLUS procedure and another clustering procedure in a Monte Carlo study. NORMIX is found to be more accurate than other procedures in recovering overlapping population structure when appropriate implementation options are specified. (SLD)
Descriptors: Algorithms, Classification, Cluster Analysis, Comparative Analysis
Peer reviewedSander, H. D.; Altmann, G. – Phonetica, 1973
Descriptors: Algorithms, Classification, Graphs, Linguistic Theory
Peer reviewedSchweizer, Karl – Multivariate Behavioral Research, 1991
A mathematical formula is introduced for the effect of integrating data. A method is then derived to eliminate the effect from correlations of variables, including mean composites, thus allowing for a clustering algorithm that requires allocation of variables according to the magnitude of their correlations. Examples illustrate the procedure. (SLD)
Descriptors: Algorithms, Classification, Cluster Analysis, Computer Simulation
Lau, C. Allen; Wang, Tianyou – 2000
This paper proposes a new Information-Time index as the basis for item selection in computerized classification testing (CCT) and investigates how this new item selection algorithm can help improve test efficiency for item pools with mixed item types. It also investigates how practical constraints such as item exposure rate control, test…
Descriptors: Algorithms, Classification, Computer Assisted Testing, Elementary Secondary Education
Peer reviewedOrwig, Richard E.; Chen, Hsinchun; Nunamaker, Jay F., Jr. – Journal of the American Society for Information Science, 1997
Describes research using an artificial intelligence approach in the application of a Kohonen Self-Organizing Map (SOM) to the problem of classification of electronic brainstorming output and an evaluation of the results. The graphical representation of textual data produced by the Kohonen SOM suggests many opportunities for improving information…
Descriptors: Algorithms, Artificial Intelligence, Brainstorming, Classification
Peer reviewedEggen, T. J. H. M.; Straetmans, G. J. J. M. – Educational and Psychological Measurement, 2000
Studied the use of adaptive testing when examinees are classified into three categories. Established testing algorithms with two different statistical computation procedures and evaluated them through simulation using an operative item bank from Dutch basic adult education. Results suggest a reduction of at least 22% in the mean number of items…
Descriptors: Adaptive Testing, Adult Education, Algorithms, Classification
Tatsuoka, Kikumi K. – 1991
Diagnosing cognitive errors possessed by examinees can be considered as a pattern classification problem that is designed to classify a sequential input of stimuli into one of several predetermined groups. The sequential inputs in this paper's context are item responses, and the predetermined groups are various states of knowledge resulting from…
Descriptors: Algorithms, Classification, Cognitive Processes, Equations (Mathematics)
CHIEN, R.T.; PREPARATA, F.P. – 1967
ONE OF THE PROBLEMS ENCOUNTERED IN CLUSTERING TECHNIQUES AS APPLIED TO DOCUMENT RETRIEVAL SYSTEMS USING BIBLIOGRAPHIC COUPLING DEVICES IS THAT THE COMPUTATIONAL EFFORT REQUIRED GROWS ROUGHLY AS THE SQUARE OF THE COLLECTION SIZE. IN THIS STUDY GRAPH THEORY IS APPLIED TO THIS PROBLEM BY FIRST MAPPING THE CITATION GRAPH OF THE DOCUMENT COLLECTION…
Descriptors: Algorithms, Bibliographic Coupling, Classification, Cluster Grouping
Peer reviewedDuncan, David R.; Litwiller, Bonnie H. – School Science and Mathematics, 1984
Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)
Descriptors: Algorithms, Classification, College Mathematics, High Schools
Shim, Minsuk; Felner, Robert; Shim, Eunjae; Brand, Stephen; Gu, Kenneth – 1999
This study examined factors related to survey response rate, particularly for teachers who participated in a nationwide survey. Using a newly developed statistical technique, the classification tree algorithm (CART), this study classified the lowest response rate and highest response rate groups based on their school demographic characteristics.…
Descriptors: Algorithms, Classification, Middle School Teachers, Middle Schools
Peer reviewedBockenholt, Ulf; Bockenholt, Ingo – Psychometrika, 1991
A reparameterization of a latent class model is presented to classify and scale nomial and ordered categorical choice data simultaneously. The model extension represents a nonhomogeneous population as a mixture of homogeneous subpopulations. Simulated data and data from a magazine preference survey of 347 college students illustrate the model.…
Descriptors: Algorithms, Classification, College Students, Computer Simulation
Peer reviewedBoley, Daniel; Gini, Maria; Hastings, Kyle; Mobasher, Bamshad; Moore, Jerry – Internet Research, 1998
Describes WebACE, the architecture of a client-side agent that explores and classifies Web documents in clusters automatically and discusses the details of the algorithms within its key components. Highlights principal direction divisive partitioning (PDDP), a scalable hierarchical clustering algorithm; compares it to other clustering methods; and…
Descriptors: Algorithms, Automation, Classification, Cluster Grouping


