Classification of binary vectors by using ΔSC distance to minimize stochastic complexity (Q4421031): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:46, 5 March 2024
scientific article; zbMATH DE number 1967170
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classification of binary vectors by using ΔSC distance to minimize stochastic complexity |
scientific article; zbMATH DE number 1967170 |
Statements
Classification of binary vectors by using ΔSC distance to minimize stochastic complexity (English)
0 references
19 August 2003
0 references
Clustering
0 references
Stochastic complexity
0 references
Algorithms
0 references
Distance functions
0 references
