Translator Disclaimer
2017 A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning
Stepan A. Nersisyan, Vera V. Pankratieva, Vladimir M. Staroverov, Vladimir E. Podolskii
J. Appl. Math. 2017: 1-9 (2017). DOI: 10.1155/2017/4323590

Abstract

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 reformulation and shows a good rate of convergence and adequate accuracy for experimental high-dimensional data. Particularly, the algorithm provided high-quality clustering of tactile frames registered by Medical Tactile Endosurgical Complex.

Citation

Download Citation

Stepan A. Nersisyan. Vera V. Pankratieva. Vladimir M. Staroverov. Vladimir E. Podolskii. "A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning." J. Appl. Math. 2017 1 - 9, 2017. https://doi.org/10.1155/2017/4323590

Information

Received: 19 June 2017; Accepted: 15 August 2017; Published: 2017
First available in Project Euclid: 11 October 2017

zbMATH: 07037477
MathSciNet: MR3709605
Digital Object Identifier: 10.1155/2017/4323590

Rights: Copyright © 2017 Hindawi

JOURNAL ARTICLE
9 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.2017 • 2017
Back to Top