Publication Date
In 2025 | 77 |
Since 2024 | 391 |
Since 2021 (last 5 years) | 767 |
Since 2016 (last 10 years) | 793 |
Since 2006 (last 20 years) | 796 |
Descriptor
Source
Author
van der Linden, Wim J. | 17 |
Kiers, Henk A. L. | 13 |
ten Berge, Jos M. F. | 10 |
Gongjun Xu | 9 |
Gerlach, Vernon S. | 8 |
Willett, Peter | 8 |
Chun Wang | 7 |
Stocking, Martha L. | 7 |
Charp, Sylvia | 6 |
Chen, Hsinchun | 6 |
Craven, Timothy C. | 6 |
More ▼ |
Publication Type
Education Level
Audience
Practitioners | 255 |
Teachers | 126 |
Researchers | 114 |
Policymakers | 6 |
Administrators | 5 |
Students | 4 |
Counselors | 1 |
Media Staff | 1 |
Support Staff | 1 |
Location
China | 17 |
Australia | 16 |
Netherlands | 14 |
Turkey | 13 |
USSR | 10 |
United States | 9 |
California | 8 |
United Kingdom (England) | 7 |
Brazil | 6 |
Europe | 6 |
Germany | 6 |
More ▼ |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating

Milligan, Glenn W. – Multivariate Behavioral Research, 1981
Monte Carlo validation studies of clustering algorithms, including Ward's minimum variance hierarchical method, are reviewed. Caution concerning the uncritical selection of Ward's method for recovering cluster structure is advised. Alternative explanations for differential recovery performance are explored and recommendations are made for future…
Descriptors: Algorithms, Cluster Analysis, Literature Reviews, Methods

Borg, Ingiver; Lingoes, James C. – Psychometrika, 1980
A method for externally constraining certain distances in multidimensional scaling configurations is introduced and illustrated. The method is described in detail and several examples are presented. (Author/JKS)
Descriptors: Algorithms, Hypothesis Testing, Mathematical Models, Multidimensional Scaling

Lehner, Paul E.; Norma, Elliot – Psychometrika, 1980
A new algorithm is used to test and describe the set of all possible solutions for any linear model of an empirical ordering derived from techniques such as additive conjoint measurement, unfolding theory, general Fechnerian scaling, and ordinal multiple regression. The algorithm is computationally faster and numerically superior to previous…
Descriptors: Algorithms, Mathematical Models, Measurement, Multiple Regression Analysis

Bookstein, Abraham; Klein, Shmuel T.; Raita, Timo – Information Processing & Management, 1997
Discussion of text compression focuses on a method to reduce the amount of storage needed to represent a Markov model with an extended alphabet, by applying a clustering scheme that brings together similar states. Highlights include probability vectors; algorithms; implementation details; and experimental data with natural languages. (Author/LRW)
Descriptors: Algorithms, Computer Science, Markov Processes, Models

Karakos, Alexandros – Journal of the American Society for Information Science and Technology, 2003
Explains transliteration and describes Greeklish, a Windows application that automatically produces English to Greek transliteration and back-transliteration (retransliteration), based on an algorithm with a table of associations between the two character sets. Describes how the table can be modified for personal preferences and discusses its…
Descriptors: Algorithms, Computer Interfaces, Computer Software, English

Quesada, Antonio R. – Mathematics Teacher, 1997
Presents recently developed generalizations to the sieve of Eratosthenes, showing the principles underlying these improvements, which increase its efficiency without changing too much of its simplicity. Offers several possibilities to propose good investigations for students to explore, find patterns, and make generalizations. (JRH)
Descriptors: Algorithms, Educational Technology, Mathematical Concepts, Mathematics Instruction

Robertson, Alexander M.; Willett, Peter – Journal of Documentation, 1996
Describes a genetic algorithm (GA) that assigns weights to query terms in a ranked-output document retrieval system. Experiments showed the GA often found weights slightly superior to those produced by deterministic weighting (F4). Many times, however, the two methods gave the same results and sometimes the F4 results were superior, indicating…
Descriptors: Algorithms, Comparative Analysis, Information Retrieval, Online Searching

Watters, Carolyn; Amoudi, Ghada – Journal of the American Society for Information Science and Technology, 2003
Discussion of Web queries with geospatial dimensions focuses on an algorithm that assigns location coordinates dynamically to Web sites based on the URL. Describes a prototype search system that uses the algorithm to re-rank search engine results for queries with a geospatial dimension, thus providing an alternative ranking order for search engine…
Descriptors: Algorithms, Geography, Search Engines, Web Sites
Ginat, David – JCSE Online, 2002
Discusses algorithmic problem solving in computer science education, particularly algorithmic insight, and focuses on the relevance and effectiveness of the heuristic simplifying constraints which involves simplification of a given problem to a problem in which constraints are imposed on the input data. Presents three examples involving…
Descriptors: Algorithms, Computer Science Education, Heuristics, Mathematical Formulas

Bass, Hyman – Teaching Children Mathematics, 2003
Suggests that algorithms, both traditional and student-invented, are proper objects of study not only as tools for computation, but also for understanding the nature of the operations of arithmetic. (Author/NB)
Descriptors: Algorithms, Arithmetic, Computation, Concept Formation

Raita, Timo; Teuhola, Jukka – Information Processing and Management, 1989
Presents three text compression methods of increasing power and evaluates each based on the trade-off between compression gain and processing time. The advantages of using hash coding for speed and optimal arithmetic coding to successor information for compression gain are discussed. (26 references) (Author/CLB)
Descriptors: Algorithms, Comparative Analysis, Data Processing, Efficiency

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

Clarkson, Douglas B.; Jennrich, Robert I. – Psychometrika, 1988
Most of the current analytic rotation criteria for simple structure in factor analysis are summarized and identified as members of a general symmetric family of quartic criteria. A unified development of algorithms for orthogonal and direct oblique rotation using arbitrary criteria from this family is presented. (Author/TJH)
Descriptors: Algorithms, Equations (Mathematics), Evaluation Criteria, Factor Structure

Winsberg, Suzanne; Carroll, J. Douglas – Psychometrika, 1989
An Extended Two-Way Euclidean Multidimensional Scaling (MDS) model that assumes both common and specific dimensions is described and contrasted with the "standard" (Two-Way) MDS model. Illustrations with both artificial and real data on the judged similarity of nations are provided. (TJH)
Descriptors: Algorithms, Chi Square, Maximum Likelihood Statistics, Multidimensional Scaling

Nevels, Klaas – Psychometrika, 1989
In FACTALS, an alternating least squares algorithm is used to fit the common factor analysis model to multivariate data. A. Mooijaart (1984) demonstrated that the algorithm is based on an erroneous assumption. This paper gives a proper solution for the loss function used in FACTALS. (Author/TJH)
Descriptors: Algorithms, Factor Analysis, Goodness of Fit, Least Squares Statistics