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 | 12 |
Probability | 12 |
Statistical Analysis | 12 |
Mathematical Models | 4 |
Bayesian Statistics | 3 |
Automatic Indexing | 2 |
Classification | 2 |
Cluster Grouping | 2 |
Computation | 2 |
Computer Programs | 2 |
Databases | 2 |
More ▼ |
Source
Information Processing and… | 1 |
Journal of Multivariate… | 1 |
Phonetica | 1 |
Psychological Review | 1 |
Psychometrika | 1 |
Sociological Methods &… | 1 |
Author
White, Lee J. | 2 |
Altmann, G. | 1 |
Choros, Kazimierz | 1 |
Coombs, Clyde H. | 1 |
Danilowicz, Czeslaw | 1 |
DeJong, Gerald | 1 |
Gigerenzer, Gerd | 1 |
Gratch, Jonathan | 1 |
Hoffrage, Ulrich | 1 |
Jose M. Pavía | 1 |
Kar, B. Gautam | 1 |
More ▼ |
Publication Type
Reports - Research | 5 |
Journal Articles | 3 |
Books | 1 |
Dissertations/Theses | 1 |
Information Analyses | 1 |
Reports - Evaluative | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Jose M. Pavía; Rafael Romero – Sociological Methods & Research, 2024
The estimation of RxC ecological inference contingency tables from aggregate data is one of the most salient and challenging problems in the field of quantitative social sciences, with major solutions proposed from both the ecological regression and the mathematical programming frameworks. In recent decades, there has been a drive to find…
Descriptors: Elections, Voting, Social Science Research, Programming

McClelland, Gary; Coombs, Clyde H. – Psychometrika, 1975
ORDMET is applicable to structures obtained from additive conjoint measurement designs, unfolding theory, general Fechnerian scaling, types of multidimensional scaling, and ordinal multiple regression. A description is obtained of the space containing all possible numerical representations which can satisfy the structure, size, and shape of which…
Descriptors: Algorithms, Computer Programs, Data Analysis, Matrices
Kirk, David B. – 1971
In this paper a reliable method is found for approximating the value of the Bivariate Normal Correlation Coefficient, rho, given values of the joint probability and the normal deviates, h and k, or the related areas. This technique finds useful application in the computation of the tetrachoric correlation coefficient, r, when the underlying…
Descriptors: Algorithms, Computer Programs, Correlation, Mathematical Applications

Gigerenzer, Gerd; Hoffrage, Ulrich – Psychological Review, 1995
It is shown that Bayesian algorithms are computationally simpler in frequency formats than in the probability formats used in previous research. Analysis of several thousand solutions to Bayesian problems showed that when information was presented in frequency formats, statistically naive participants derived up to 50% of inferences by Bayesian…
Descriptors: Algorithms, Bayesian Statistics, Computation, Estimation (Mathematics)

Altmann, G. – Phonetica, 1973
Descriptors: Algorithms, Consonants, Distinctive Features (Language), Intonation
Weide, Bruce W. – 1978
The use of statistical methods in the design and analysis of discrete algorithms is explored. The introductory chapter contains a literature survey and background material on probability theory. In Chapter 2, probabilistic approximation algorithms are discussed with the goal of exposing and correcting some oversights in previous work. Chapter 3…
Descriptors: Algorithms, Computer Science, Higher Education, Mathematics Education
Wolff, Hans – 1970
Stochastic approximation algorithms for least square error approximation to density and distribution functions are considered. The main results are necessary and sufficient parameter conditions for the convergence of the approximation processes and a generalization to some time-dependent density and distribution functions. (Author)
Descriptors: Algorithms, Computation, Mathematics, Measurement

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

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
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
Gratch, Jonathan; DeJong, Gerald – 1992
In machine learning there is considerable interest in techniques which improve planning ability. Initial investigations have identified a wide variety of techniques to address this issue. Progress has been hampered by the utility problem, a basic tradeoff between the benefit of learned knowledge and the cost to locate and apply relevant knowledge.…
Descriptors: Algorithms, Artificial Intelligence, Comparative Analysis, Computer System Design

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