A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning

We consider a clustering approach based on interval pattern concepts. Exact algorithms developed within the framework of this approach are unable to produce a solution for high-dimensional data in a reasonable time, so we propose a fast greedy algorithm which solves the problem in geometrical reform...

Full description

Bibliographic Details
Main Authors: Stepan A. Nersisyan, Vera V. Pankratieva, Vladimir M. Staroverov, Vladimir E. Podolskii
Format: Article
Published: Hindawi Limited 2017-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2017/4323590