Publication Date
In 2025 | 0 |
Since 2024 | 1 |
Since 2021 (last 5 years) | 1 |
Since 2016 (last 10 years) | 1 |
Since 2006 (last 20 years) | 1 |
Descriptor
Algorithms | 16 |
Mathematical Models | 16 |
Probability | 16 |
Equations (Mathematics) | 4 |
Maximum Likelihood Statistics | 4 |
Statistical Analysis | 4 |
Computer Simulation | 3 |
Automatic Indexing | 2 |
Bayesian Statistics | 2 |
Classification | 2 |
Cluster Grouping | 2 |
More ▼ |
Source
Psychometrika | 3 |
Applied Psychological… | 1 |
Educational Studies in… | 1 |
Information Processing and… | 1 |
Journal of Computers in… | 1 |
Journal of Multivariate… | 1 |
Journal of the American… | 1 |
Research Synthesis Methods | 1 |
Author
White, Lee J. | 2 |
Andrich, David | 1 |
Besel, Ronald | 1 |
Chang, Chih-Hsin | 1 |
Choppin, Bruce | 1 |
Choros, Kazimierz | 1 |
Croft, W. Bruce | 1 |
Danilowicz, Czeslaw | 1 |
De Soete, Geert | 1 |
Elizabeth Tipton | 1 |
Engel, Arthur | 1 |
More ▼ |
Publication Type
Journal Articles | 8 |
Reports - Research | 8 |
Reports - Evaluative | 4 |
Guides - Classroom - Teacher | 1 |
Reports - Descriptive | 1 |
Education Level
Audience
Researchers | 1 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Zhipeng Hou; Elizabeth Tipton – Research Synthesis Methods, 2024
Literature screening is the process of identifying all relevant records from a pool of candidate paper records in systematic review, meta-analysis, and other research synthesis tasks. This process is time consuming, expensive, and prone to human error. Screening prioritization methods attempt to help reviewers identify most relevant records while…
Descriptors: Meta Analysis, Research Reports, Identification, Evaluation Methods
Gibbons, Robert D.; And Others – 1990
The probability integral of the multivariate normal distribution (ND) has received considerable attention since W. F. Sheppard's (1900) and K. Pearson's (1901) seminal work on the bivariate ND. This paper evaluates the formula that represents the "n x n" correlation matrix of the "chi(sub i)" and the standardized multivariate…
Descriptors: Algorithms, Equations (Mathematics), Estimation (Mathematics), Generalizability Theory

Engel, Arthur – Educational Studies in Mathematics, 1975
The author describes a new graphing algorithm for computing probabilities, and presents problems for these algorithms for use in the classroom. (SD)
Descriptors: Algorithms, Computation, Diagrams, Elementary Secondary Education
Young, Forrest W. – 1969
A model permitting construction of algorithms for the polynomial conjoint analysis of similarities is presented. This model, which is based on concepts used in nonmetric scaling, permits one to obtain the best approximate solution. The concepts used to construct nonmetric scaling algorithms are reviewed. Finally, examples of algorithmic models for…
Descriptors: Algorithms, Conceptual Schemes, Factor Analysis, Mathematical Applications

Rennie, Robert R.; Villegas, C. – Journal of Multivariate Analysis, 1976
An asymptotic theory is developed for a new time series model introduced in TM 502 289. An algorithm for computing estimates of the parameters of this time series model is given, and it is shown that these estimators are asymptotically efficient in that they have the same asymptotic distribution as the maximum likelihood estimators. (Author/RC)
Descriptors: Algorithms, Analysis of Covariance, Mathematical Models, Matrices

De Soete, Geert; Winsberg, Suzanne – Psychometrika, 1993
A probabilistic choice model, based on L. L. Thurstone's Law of Comparative Judgment Case V, is developed for paired comparisons data about psychological stimuli. The model assumes that each stimulus is measured on a small number of physical variables. An algorithm for estimating parameters is illustrated with real data. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Estimation (Mathematics), Graphs

Fox, William P.; And Others – Journal of Computers in Mathematics and Science Teaching, 1996
Explains a proposed block of instruction that would give students in industrial engineering, operations research, systems engineering, and applied mathematics the basic understanding required to begin more advanced courses in simulation theory or applications. (DDR)
Descriptors: Algorithms, Computer Science, Computer Simulation, Computer Software

Mislevy, Robert J.; Verhelst, Norman – Psychometrika, 1990
A model is presented for item responses when different subjects use different strategies, but only responses--not choice of strategy--can be observed. Substantive theory is used to differentiate the likelihoods of response vectors under a fixed set of strategies, and response probabilities are modeled via item parameters for each strategy. (TJH)
Descriptors: Algorithms, Guessing (Tests), Item Response Theory, Mathematical Models

White, Lee J.; And Others – 1975
The major advantage of sequential classification, a technique for automatically classifying documents into previously selected categories, is that the entire document need not be processed before it is classified. This method assumes the availability of a priori categories, a selection of keywords representative of these categories, and the a…
Descriptors: Algorithms, Automatic Indexing, Bayesian Statistics, Classification

Liou, Michelle; Chang, Chih-Hsin – Psychometrika, 1992
An extension is proposed for the network algorithm introduced by C.R. Mehta and N.R. Patel to construct exact tail probabilities for testing the general hypothesis that item responses are distributed according to the Rasch model. A simulation study indicates the efficiency of the algorithm. (SLD)
Descriptors: Algorithms, Computer Simulation, Difficulty Level, Equations (Mathematics)
Choppin, Bruce – 1982
On well-constructed multiple-choice tests, the most serious threat to measurement is not variation in item discrimination, but the guessing behavior that may be adopted by some students. Ways of ameliorating the effects of guessing are discussed, especially for problems in latent trait models. A new item response model, including an item parameter…
Descriptors: Ability, Algorithms, Guessing (Tests), Item Analysis
Kar, B. Gautam; White, Lee J. – 1975
The feasibility of using a distance measure, called the Bayesian distance, for automatic sequential document classification was studied. Results indicate that, by observing the variation of this distance measure as keywords are extracted sequentially from a document, the occurrence of noisy keywords may be detected. This property of the distance…
Descriptors: Algorithms, Automatic Indexing, Bayesian Statistics, Classification
Besel, Ronald – 1973
The contention is made that group performance data are useful in the construction and interpretation of criterion-referenced tests. The Mastery Learning Test Model, which was developed for analyzing criterion-referenced test data, is described. An estimate of the proportion of students in an instructional group having achieved the referent…
Descriptors: Algorithms, Correlation, Criterion Referenced Tests, Decision Making

Croft, W. Bruce – Journal of the American Society for Information Science, 1986
Proposes approach to integrating Boolean and statistical systems where Boolean queries are interpreted as a means of specifying term dependencies in relevant set of documents. Highlights include series of retrieval experiments designed to test retrieval strategy based on term dependence model and relation of results to other work. (18 references)…
Descriptors: Algorithms, Feedback, Information Systems, Mathematical Models

Choros, Kazimierz; Danilowicz, Czeslaw – Information Processing and Management, 1982
Discusses methods of weighting of descriptors in document search patterns together with the concept of relative indexing and conditions which should be satisfied by descriptor weight. A procedure for modifiying document search patterns based on users' informational needs and opinions is outlined, and examples are given. Sixteen references are…
Descriptors: Algorithms, Indexing, Information Retrieval, Information Seeking
Previous Page | Next Page ยป
Pages: 1 | 2