๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complexity of classification problems

โœ Scribed by I. V. Sergienko; A. M. Gupal; S. V. Pashko

Publisher
Springer US
Year
1996
Tongue
English
Weight
650 KB
Volume
32
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimum-cost strong network orientation
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
โœ Burkard, Rainer E.; Feldbacher, Karin; Klinz, Bettina; Woeginger, Gerhard J. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 184 KB

In the minimum-cost strong network orientation problem (MCSO), we are given an undirected graph G ร… (V, E) with nonnegative edge lengths แ‰(e) and a transportation schedule T ร… {(s 1 , t 1 , w 1 ), . . . , (s k , t k , w k )}, where w i units of weight have to be transported from the source vertex s

Classification of Binary Vectors by Stoc
Classification of Binary Vectors by Stochastic Complexity
โœ Mats Gyllenberg; Timo Koski; Martin Verlaan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 336 KB

Stochastic complexity is treated as a tool of classification, i.e., of inferring the number of classes, the class descriptions, and the class memberships for a given data set of binary vectors. The stochastic complexity is evaluated with respect to the family of statistical models defined by finite