A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning (Q2261029): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Conditioning on ancillary statistics and loss of information in the presence of nuisance parameters / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3241542 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the loss of information in conditional maximum likelihood estimation of item parameters / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On equivalence between a partial credit item and a set of independent Rasch binary items / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Rasch model for partial credit scoring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4850582 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4849481 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inference and missing data / rank | |||
Normal rank | |||
Latest revision as of 18:47, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning |
scientific article |
Statements
A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning (English)
0 references
6 March 2015
0 references
combinatorial data analysis
0 references
cluster analysis
0 references
\(K\)-means
0 references
branch and bound
0 references
0 references
0 references
0 references
