Publication Date
| In 2025 | 0 |
| Since 2024 | 0 |
| Since 2021 (last 5 years) | 0 |
| Since 2016 (last 10 years) | 0 |
| Since 2006 (last 20 years) | 1 |
Descriptor
| Data Analysis | 4 |
| Graphs | 4 |
| Algorithms | 2 |
| Mathematical Models | 2 |
| Tables (Data) | 2 |
| Charts | 1 |
| Cluster Analysis | 1 |
| Correlation | 1 |
| Data Interpretation | 1 |
| Estimation (Mathematics) | 1 |
| Evaluation Methods | 1 |
| More ▼ | |
Source
| Psychometrika | 4 |
Publication Type
| Journal Articles | 3 |
| Reports - Evaluative | 2 |
| Reports - Research | 1 |
| Speeches/Meeting Papers | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Direct linkChoulakian, V. – Psychometrika, 2008
The aim of this paper is to study the analysis of contingency tables with one heavyweight column or one heavyweight entry by taxicab correspondence analysis (TCA). Given that the mathematics of TCA is simpler than the mathematics of correspondence analysis (CA), the influence of one heavyweight column on the outputs of TCA is studied explicitly…
Descriptors: Statistical Analysis, Tables (Data), Correlation, Data Analysis
Peer reviewedKlauer, Karl Christoph – Psychometrika, 1989
Concepts of ordinal network representation are discussed. Notation (the type of data that can be represented) and the type of representation given are reviewed. The idea of reduced ordinal networks is explored; and the algorithm, uniqueness results, and error handling problems are presented. Examples of data analysis are included. (SLD)
Descriptors: Algorithms, Data Analysis, Data Interpretation, Graphs
Peer reviewedHubert, Lawrence – Psychometrika, 1973
The intent of this paper is to generalize the min and max clustering procedures in such a way that the assumption of a symmetric similarity measure is unnecessary. (Author)
Descriptors: Algorithms, Cluster Analysis, Data Analysis, Evaluation Methods
Peer reviewedWasserman, Stanley; Pattison, Philippa – Psychometrika, 1996
The Markov random graphs of O. Frank and D. Strauss (1986) and the estimation strategy for these models developed by Strauss and M. Ikeda (1990) are promising contributions. This paper describes a large class of models that can be used to investigate structure in social networks and illustrates their use. (SLD)
Descriptors: Data Analysis, Estimation (Mathematics), Graphs, Markov Processes
