Regarding the complexity of additive clustering models: Comment on Lee (2001)

✍ Scribed by Daniel J Navarro

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 97 KB
• Volume: 47
• Category: Article
• ISSN: 0022-2496
• DOI: 10.1016/s0022-2496(02)00026-3

✦ Synopsis

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.