A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning. (25th September 2017)

• Record Type: Journal Article
• Authors: Nersisyan, Stepan A.; Pankratieva, Vera V.; Staroverov, Vladimir M.; Podolskii, Vladimir E.
• Other Names: Fotakis Dimitris Academic Editor.
• Is Part Of: Journal of applied mathematics. Volume 2017(2017)
• Publication Date: 2017-09-25
• Subjects: Mathematics -- Periodicals; 519.05
• DOI: 10.1155/2017/4323590
• Languages: English
• ISSNs: 1110-757X

Abstract

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.