Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/3313
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | Regarding the complexity of additive clustering models: Comment on Lee (2001) |
Author: | Navarro, D. |
Citation: | Journal of Mathematical Psychology, 2003; 47(3):241-243 |
Publisher: | Academic Press Inc |
Issue Date: | 2003 |
ISSN: | 0022-2496 |
Statement of Responsibility: | Daniel J. Navarro |
Abstract: | The additive clustering approach to modeling pairwise similarity of entities is a powerful tool for deriving featural stimulus representations. In a recent paper, Lee (2001) proposes a statistically principled measure for choosing between clustering models that accounts for model complexity as well as data fit. Importantly, complexity is understood to be a property, not merely of the number of clusters, but also their size and pattern of overlap. However, some caution is required when interpreting the measure, with regard to the applicability of the Hadamard inequality to the complexity matrix. © 2003 Elsevier Science (USA). All rights reserved. |
Description: | Copyright © 2003 Elsevier Science (USA). All rights reserved. |
DOI: | 10.1016/S0022-2496(02)00026-3 |
Published version: | http://dx.doi.org/10.1016/s0022-2496(02)00026-3 |
Appears in Collections: | Aurora harvest Psychology publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.