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 and Vladimir E. Podolskii

Journal of Applied Mathematics, 2017, vol. 2017, issue 1

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.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2017/4323590

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2017:y:2017:i:1:n:4323590

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().