Hubert, L., Arabie, P., & Meulman, J. (2006). The structural representation of proximity matrices with MATLAB. Philadelphia: SIAM. xvi+214 pp. US$79.00. ISBN 0898716071
Author
Abstract
Suggested Citation
DOI: 10.1007/s11336-007-9003-6
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Lawrence Hubert & Phipps Arabie & Jacqueline Meulman, 1998. "Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices," Psychometrika, Springer;The Psychometric Society, vol. 63(4), pages 341-358, December.
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.- Donatella Vicari & Maurizio Vichi, 2009. "Structural Classification Analysis of Three-Way Dissimilarity Data," Journal of Classification, Springer;The Classification Society, vol. 26(2), pages 121-154, August.
- Michael Brusco & Stephanie Stahl, 2005. "Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming," Psychometrika, Springer;The Psychometric Society, vol. 70(2), pages 253-270, June.
- Michael Brusco, 2002. "A branch-and-bound algorithm for fitting anti-robinson structures to symmetric dissimilarity matrices," Psychometrika, Springer;The Psychometric Society, vol. 67(3), pages 459-471, September.
- Michael Brusco & Hans-Friedrich Köhn & Stephanie Stahl, 2008. "Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis," Psychometrika, Springer;The Psychometric Society, vol. 73(3), pages 503-522, September.
- Köhn, Hans-Friedrich, 2010. "Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition," Computational Statistics & Data Analysis, Elsevier, vol. 54(10), pages 2343-2357, October.
- J.-P. Barthélemy & F. Brucker & C. Osswald, 2007. "Combinatorial optimisation and hierarchical classifications," Annals of Operations Research, Springer, vol. 153(1), pages 179-214, September.
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:spr:psycho:v:72:y:2007:i:4:p:655-656. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.