Аннотация
Abstract: The known quadratic NP-hard (in the strong sense) M-variance problem is considered. It arises in the following typical problem of data analysis: in a set of N objects determined by their characteristics (features), find a subset of M elements close to each other. For the one-dimensional case, an accelerated exact algorithm with complexity (Formula presented.)(N logN) is proposed.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 573-576 |
Число страниц | 4 |
Журнал | Pattern Recognition and Image Analysis |
Том | 29 |
Номер выпуска | 4 |
DOI | |
Состояние | Опубликовано - 1 окт 2019 |