Sharp bounds for the maximum of the Goodman-Kruskal \(\tau\) index (Q1979099)

From MaRDI portal
!
WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use the normal view instead:

scientific article; zbMATH DE number 1452445
Language Label Description Also known as
default for all languages
No label defined
    English
    Sharp bounds for the maximum of the Goodman-Kruskal \(\tau\) index
    scientific article; zbMATH DE number 1452445

      Statements

      Sharp bounds for the maximum of the Goodman-Kruskal \(\tau\) index (English)
      0 references
      24 May 2000
      0 references
      In many situations one variable (say, \(Y\)) is a response variable and the other one (\(Z\)) an explanatory variable, and it is of interest to analyze the dependency of \(Y\) upon \(Z.\) To this aim, \textit{N. Lauro} and \textit{L. D'Ambra} [E. Diday et al. (eds.), Data Analysis and Informatics III, 433-446 (1984)] developed the so called ``non symmetrical correspondence analysis'', a factorial analysis whose aim is to visualize the dependence of \(Y\) on \(Z\) on factorial planes. In this situation, one important index measuring the strength of the dependency of \(Y\) on \(Z,\) namely the Goodman and Kruskal's \(\tau_{Y/Z}\) index, plays a great role. For given marginals, \(\tau\) seldom reaches its theoretical upper bound, \(1.\) It seems therefore reasonable to determine the maximum value the index can assume in a class of contingency tables with given marginals. Three kinds of heuristics developed to this aim are presented in this paper. An upper bound for the maximum is determined so that it is possible to estimate the relative error of the proposed heuristics.
      0 references
      contingency tables
      0 references
      Frechet classes
      0 references
      Goodman and Kruskal's tau
      0 references
      minimax approach
      0 references
      non symmetrical correspondence analysis
      0 references
      quadratic programming
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references