IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v44y2003i1-2p297-304.html
   My bibliography  Save this article

General balance, large data sets and extensions to unbalanced treatment structures

Author

Listed:
  • Payne, Roger W.

Abstract

No abstract is available for this item.

Suggested Citation

  • Payne, Roger W., 2003. "General balance, large data sets and extensions to unbalanced treatment structures," Computational Statistics & Data Analysis, Elsevier, vol. 44(1-2), pages 297-304, October.
    • Handle: RePEc:eee:csdana:v:44:y:2003:i:1-2:p:297-304
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(03)00094-X
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Angelis, L. & Bora-Senta, E. & Moyssiadis, C., 2001. "Optimal exact experimental designs with correlated errors through a simulated annealing algorithm," Computational Statistics & Data Analysis, Elsevier, vol. 37(3), pages 275-296, September.
    2. Goos, Peter & Vandebroek, Martina, 2001. "-optimal response surface designs in the presence of random block effects," Computational Statistics & Data Analysis, Elsevier, vol. 37(4), pages 433-453, October.
    3. Vichi, Maurizio & Kiers, Henk A. L., 2001. "Factorial k-means analysis for two-way data," Computational Statistics & Data Analysis, Elsevier, vol. 37(1), pages 49-64, July.
    4. Ogliari, Paulo J. & Andrade, Dalton F., 2001. "Analysing longitudinal data via nonlinear models in randomized block designs," Computational Statistics & Data Analysis, Elsevier, vol. 36(3), pages 319-332, May.
    5. R. W. Payne & G. N. Wilkinson, 1977. "A General Algorithm for Analysis of Variance," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 26(3), pages 251-260, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alfonso Iodice D’Enza & Francesco Palumbo, 2013. "Iterative factor clustering of binary data," Computational Statistics, Springer, vol. 28(2), pages 789-807, April.
    2. GOOS, Peter & VERMEULEN, Bart & VANDEBROEK, Martina, 2008. "D-optimal conjoint choice designs with no-choice options for a nested logit model," Working Papers 2008020, University of Antwerp, Faculty of Business and Economics.
    3. Payne, Roger W., 1998. "Design keys, pseudo-factors and general balance," Computational Statistics & Data Analysis, Elsevier, vol. 29(2), pages 217-229, December.
    4. Uno, Kohei & Satomura, Hironori & Adachi, Kohei, 2016. "Fixed factor analysis with clustered factor score constraint," Computational Statistics & Data Analysis, Elsevier, vol. 94(C), pages 265-274.
    5. DeSarbo, Wayne S. & Selin Atalay, A. & Blanchard, Simon J., 2009. "A three-way clusterwise multidimensional unfolding procedure for the spatial representation of context dependent preferences," Computational Statistics & Data Analysis, Elsevier, vol. 53(8), pages 3217-3230, June.
    6. Roberto Rocci & Stefano Gattone & Maurizio Vichi, 2011. "A New Dimension Reduction Method: Factor Discriminant K-means," Journal of Classification, Springer;The Classification Society, vol. 28(2), pages 210-226, July.
    7. Arnouts, Heidi & Goos, Peter, 2010. "Update formulas for split-plot and block designs," Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3381-3391, December.
    8. Vichi, Maurizio & Saporta, Gilbert, 2009. "Clustering and disjoint principal component analysis," Computational Statistics & Data Analysis, Elsevier, vol. 53(8), pages 3194-3208, June.
    9. Masaki Mitsuhiro & Hiroshi Yadohisa, 2015. "Reduced $$k$$ k -means clustering with MCA in a low-dimensional space," Computational Statistics, Springer, vol. 30(2), pages 463-475, June.
    10. Patan, Maciej & Bogacka, Barbara, 2007. "Optimum experimental designs for dynamic systems in the presence of correlated errors," Computational Statistics & Data Analysis, Elsevier, vol. 51(12), pages 5644-5661, August.
    11. Hertel, Ida & Kohler, Michael, 2013. "Estimation of the optimal design of a nonlinear parametric regression problem via Monte Carlo experiments," Computational Statistics & Data Analysis, Elsevier, vol. 59(C), pages 1-12.
    12. Naoto Yamashita & Shin-ichi Mayekawa, 2015. "A new biplot procedure with joint classification of objects and variables by fuzzy c-means clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 9(3), pages 243-266, September.
    13. J. Vera & Rodrigo Macías & Willem Heiser, 2013. "Cluster Differences Unfolding for Two-Way Two-Mode Preference Rating Data," Journal of Classification, Springer;The Classification Society, vol. 30(3), pages 370-396, October.
    14. Jérome SARACCO & Marie CHAVENT & Vanessa KUENTZ, 2010. "Clustering of categorical variables around latent variables," Cahiers du GREThA (2007-2019) 2010-02, Groupe de Recherche en Economie Théorique et Appliquée (GREThA).
    15. Dirk Depril & Iven Mechelen & Tom Wilderjans, 2012. "Lowdimensional Additive Overlapping Clustering," Journal of Classification, Springer;The Classification Society, vol. 29(3), pages 297-320, October.
    16. Donatella Vicari & Paolo Giordani, 2023. "CPclus: Candecomp/Parafac Clustering Model for Three-Way Data," Journal of Classification, Springer;The Classification Society, vol. 40(2), pages 432-465, July.
    17. Michael C. Thrun & Alfred Ultsch, 2021. "Using Projection-Based Clustering to Find Distance- and Density-Based Clusters in High-Dimensional Data," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 280-312, July.
    18. Winker, Peter & Gilli, Manfred, 2004. "Applications of optimization heuristics to estimation and modelling problems," Computational Statistics & Data Analysis, Elsevier, vol. 47(2), pages 211-223, September.
    19. M. Velden & A. Iodice D’Enza & F. Palumbo, 2017. "Cluster Correspondence Analysis," Psychometrika, Springer;The Psychometric Society, vol. 82(1), pages 158-185, March.
    20. Goos, P. & Donev, A.N., 2006. "Blocking response surface designs," Computational Statistics & Data Analysis, Elsevier, vol. 51(2), pages 1075-1088, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:44:y:2003:i:1-2:p:297-304. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.