Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1404958
Jump to:navigation, search

DOI10.1016/S0022-2496(02)00026-3zbMath1041.91050MaRDI QIDQ1404958

Daniel J. Navarro

Publication date: 25 August 2003

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)


zbMATH Keywords

complexityclusteringHadamard inequality


Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20)




Cites Work

  • Unnamed Item
  • Generating additive clustering models with minimal stochastic complexity.
  • On the complexity of additive clustering models
  • Counting probability distributions: Differential geometry and model selection
  • Bayes Factors
  • Fisher information and stochastic complexity
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1404958&oldid=13563101"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 17:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki