British Journal of Mathematical and Statistical Psychology, Nov 1, 1983
A general strategy is proposed for measuring and testing the agreement between two raters who use... more A general strategy is proposed for measuring and testing the agreement between two raters who use some common scheme for assessing each of n objects. As long as a numerical measure of correspondence or proximity can be obtained between any two assessments, an agreement index can be defined and tested for significance under a null conjecture of rater independence. The usual weighted kappa index appropriate for nominal scale response agreement is a special case of our more comprehensive framework.
British Journal of Mathematical and Statistical Psychology, May 1, 1974
The concept of a spanning tree for a weighted graph is used to characterize several methods of cl... more The concept of a spanning tree for a weighted graph is used to characterize several methods of clustering a set of objects. In particular, most of the paper is devoted to stating relationships between spanning trees, single‐link and complete‐link hierarchical clustering, network flow and two divisive clustering procedures. Several related topics using the notion of a spanning tree are also mentioned.
Studies in Classification, Data Analysis, and Knowledge Organization, 1998
Optimal scaling is reviewed in the framework of a comprehensive multidimensional data analysis st... more Optimal scaling is reviewed in the framework of a comprehensive multidimensional data analysis strategy, called the Data Theory Scaling System (DTSS). The optimal scaling methodology has a lot of potential for the analysis of multivariate data that are qualitative, non-normally distributed, or incomplete. Also, the system can easily deal with nonlinear relationships between the variables to be analyzed. A crucial aspect of DTSS is the graphical display of the results of the analysis. The most recent developments of DTSS include the integration of optimal scaling with combinatorial data analysis, e.g., ordering tasks in one dimension, and the fitting of graphs to multivariate data.
British Journal of Mathematical and Statistical Psychology, Nov 1, 1983
A general strategy is proposed for measuring and testing the agreement between two raters who use... more A general strategy is proposed for measuring and testing the agreement between two raters who use some common scheme for assessing each of n objects. As long as a numerical measure of correspondence or proximity can be obtained between any two assessments, an agreement index can be defined and tested for significance under a null conjecture of rater independence. The usual weighted kappa index appropriate for nominal scale response agreement is a special case of our more comprehensive framework.
British Journal of Mathematical and Statistical Psychology, May 1, 1974
The concept of a spanning tree for a weighted graph is used to characterize several methods of cl... more The concept of a spanning tree for a weighted graph is used to characterize several methods of clustering a set of objects. In particular, most of the paper is devoted to stating relationships between spanning trees, single‐link and complete‐link hierarchical clustering, network flow and two divisive clustering procedures. Several related topics using the notion of a spanning tree are also mentioned.
Studies in Classification, Data Analysis, and Knowledge Organization, 1998
Optimal scaling is reviewed in the framework of a comprehensive multidimensional data analysis st... more Optimal scaling is reviewed in the framework of a comprehensive multidimensional data analysis strategy, called the Data Theory Scaling System (DTSS). The optimal scaling methodology has a lot of potential for the analysis of multivariate data that are qualitative, non-normally distributed, or incomplete. Also, the system can easily deal with nonlinear relationships between the variables to be analyzed. A crucial aspect of DTSS is the graphical display of the results of the analysis. The most recent developments of DTSS include the integration of optimal scaling with combinatorial data analysis, e.g., ordering tasks in one dimension, and the fitting of graphs to multivariate data.
Uploads
Papers by Lawrence Hubert