|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioningстатья
- Авторы: Nersisyan Stepan A., Pankratieva Vera V., Staroverov Vladimir M., Podolskii Vladimir E.
- Журнал: Journal of Applied Mathematics
- Год издания: 2017
- Издательство: Hindawi Publishing Corporation
- Местоположение издательства: United States
- DOI: 10.1155/2017/4323590
- Аннотация: 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.
- Добавил в систему: Нерсисян Степан Ашотович