Publication Date
In 2025 | 81 |
Since 2024 | 396 |
Since 2021 (last 5 years) | 772 |
Since 2016 (last 10 years) | 798 |
Since 2006 (last 20 years) | 801 |
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
Australia | 17 |
China | 17 |
Netherlands | 14 |
Turkey | 13 |
USSR | 10 |
United States | 10 |
California | 8 |
United Kingdom (England) | 7 |
Brazil | 6 |
Europe | 6 |
Germany | 6 |
More ▼ |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating

Commandeur, Jacques J. F.; Groenen, Patrick J. F.; Meulman, Jacqueline J. – Psychometrika, 1999
Presents two methods for including weights in distance-based nonlinear multivariate data analysis. One method assigns weights to the objects, while the other is concerned with differential weighing of groups of variables. Discusses applications of these weighting schemes and proposed an algorithm to minimize the corresponding loss function. (SLD)
Descriptors: Algorithms, Multidimensional Scaling, Multivariate Analysis, Research Methodology

Sanders, Piet F.; Verschoor, Alfred J. – Applied Psychological Measurement, 1998
Presents minimization and maximization models for parallel test construction under constraints. The minimization model constructs weakly and strongly parallel tests of minimum length, while the maximization model constructs weakly and strongly parallel tests with maximum test reliability. (Author/SLD)
Descriptors: Algorithms, Models, Reliability, Test Construction

van der Linden, Wim J.; Adema, Jos J. – Journal of Educational Measurement, 1998
Proposes an algorithm for the assembly of multiple test forms in which the multiple-form problem is reduced to a series of computationally less intensive two-form problems. Illustrates how the method can be implemented using 0-1 linear programming and gives two examples. (SLD)
Descriptors: Algorithms, Linear Programming, Test Construction, Test Format

Mather, Laura A. – Journal of the American Society for Information Science, 2000
Discussion of models for information retrieval focuses on an application of linear algebra to text clustering, namely, a metric for measuring cluster quality based on the theory that cluster quality is proportional to the number of terms that are disjoint across the clusters. Explains term-document matrices and clustering algorithms. (Author/LRW)
Descriptors: Algorithms, Cluster Analysis, Information Retrieval, Mathematical Formulas

Mostafa, J.; Lam, W. – Information Processing & Management, 2000
Presents a multilevel model of the information filtering process that permits document classification. Evaluates a document classification approach based on a supervised learning algorithm, measures the accuracy of the algorithm in a neural network that was trained to classify medical documents on cell biology, and discusses filtering…
Descriptors: Algorithms, Classification, Cytology, Evaluation Methods

Savoy, Jacques; Picard, Justin – Information Processing & Management, 2001
Discusses the role of search engines in Web usability and analyzes and evaluates the retrieval effectiveness of various indexing and searching strategies on a new Web text collection. Highlights include preprocessing techniques that might improve retrieval effectiveness; and hyperlinks as useful sources of evidence in improving retrieval…
Descriptors: Algorithms, Indexing, Information Retrieval, Search Strategies

Okada, Makoto; Ando, Kazuaki; Lee, Samuel Sangkon; Hayashi, Yoshitaka; Aoe, Jun-ichi – Information Processing & Management, 2001
Discusses information retrieval systems and extracting appropriate keywords from documents and proposes an effective substring search method by extending a pattern matching machine for multi-keywords called delayed keyword extraction (DKE). Also proposes a construction algorithm of the retrieval structure for speeding up the substring search.…
Descriptors: Algorithms, Information Retrieval, Keywords, Search Strategies

Chan, Samuel W. K. – Journal of Information Science, 2000
Discusses natural language processing and proposes a novel approach to automatic text segmentation using heterogeneous linguistic knowledge and cluster algorithms. Represents the diversity of textual relations in a discourse network in order to analyze the linguistic bonds and determine the degree of coherence that a text may exhibit. (Author/LRW)
Descriptors: Algorithms, Coherence, Information Retrieval, Linguistic Theory

Sweeney-Starke, Nancy L.; Episcopo, Shelly – New York State Mathematics Teachers' Journal, 1996
Describes a lesson on long division using chip trading which follows that algorithm for long division. (MKR)
Descriptors: Algorithms, Arithmetic, Division, Elementary Education

Ayoub, Ayoub B. – Mathematics and Computer Education, 1996
Examines the relation between the sequence of approximations to the square root of a number and the harmonic, geometric, and arithmetic means using the TI-85 graphing calculator. (MKR)
Descriptors: Algorithms, Estimation (Mathematics), Graphing Calculators, High Schools

Cheng, Philip E.; Liou, Michelle – Applied Psychological Measurement, 2000
Reviewed methods of estimating theta suitable for computerized adaptive testing (CAT) and discussed the differences between Fisher and Kullback-Leibler information criteria for selecting items. Examined the accuracy of different CAT algorithms using samples from the National Assessment of Educational Progress. Results show when correcting for…
Descriptors: Ability, Adaptive Testing, Algorithms, Computer Assisted Testing

Tan, Chade-Meng; Wang, Yuan-Fang; Lee, Chan-Do – Information Processing & Management, 2002
Presents an efficient text categorization (or text classification) algorithm for document retrieval of natural language texts that generates bigrams (two-word phrases) and uses the information gain metric, combined with various frequency thresholds. Experimental results suggest that the bigrams can substantially raise the quality of feature sets.…
Descriptors: Algorithms, Classification, Information Retrieval, Natural Language Processing

Benoit, Gerald – Annual Review of Information Science and Technology (ARIST), 2002
Discusses data mining (DM) and knowledge discovery in databases (KDD), taking the view that KDD is the larger view of the entire process, with DM emphasizing the cleaning, warehousing, mining, and visualization of knowledge discovery in databases. Highlights include algorithms; users; the Internet; text mining; and information extraction.…
Descriptors: Algorithms, Databases, Information Science, Internet

Batchelder, Eleanor Olds – Cognition, 2002
Details BootLex, a model using distributional cues to build a lexicon and achieving significant segmentation results with English, Japanese, and Spanish; child- and adult-directed speech, and written text; and variations in coding structure. Compares BootLex with three groups of computational models of the infant segmentation process. Discusses…
Descriptors: Algorithms, Cognitive Development, Cues, Infants

Ross, Susan C.; Pratt-Cotter, Mary – School Science and Mathematics, 1999
Reviews the historical use of each of the three algorithms used for subtraction in the United States: (1) the equal additions; (2) the decomposition; and (3) the Austrian method. Discusses the modification to the decomposition algorithm and gives a brief overview of the current status of subtraction algorithms. Contains 12 references. (Author/ASK)
Descriptors: Algorithms, Elementary Secondary Education, Mathematics Education, Mathematics History