An Accelerated Exact Algorithm for the One-Dimensional M-Variance Problem

A. V. Kel’manov, P. S. Ruzankin

Результат исследования: Научные публикации в периодических изданияхстатья

Аннотация

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

Цитировать