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...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2017-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2017/4323590 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832550209712816128 |
---|---|
author | Stepan A. Nersisyan Vera V. Pankratieva Vladimir M. Staroverov Vladimir E. Podolskii |
author_facet | Stepan A. Nersisyan Vera V. Pankratieva Vladimir M. Staroverov Vladimir E. Podolskii |
author_sort | Stepan A. Nersisyan |
collection | DOAJ |
description | 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. |
format | Article |
id | doaj-art-4a026174d0a4438fb9b8d9c2b6795a8c |
institution | Kabale University |
issn | 1110-757X 1687-0042 |
language | English |
publishDate | 2017-01-01 |
publisher | Wiley |
record_format | Article |
series | Journal of Applied Mathematics |
spelling | doaj-art-4a026174d0a4438fb9b8d9c2b6795a8c2025-02-03T06:07:22ZengWileyJournal of Applied Mathematics1110-757X1687-00422017-01-01201710.1155/2017/43235904323590A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box PositioningStepan A. Nersisyan0Vera V. Pankratieva1Vladimir M. Staroverov2Vladimir E. Podolskii3Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Leninskie Gory 1, Moscow 119991, RussiaFaculty of Mechanics and Mathematics, Lomonosov Moscow State University, Leninskie Gory 1, Moscow 119991, RussiaFaculty of Mechanics and Mathematics, Lomonosov Moscow State University, Leninskie Gory 1, Moscow 119991, RussiaFaculty of Mechanics and Mathematics, Lomonosov Moscow State University, Leninskie Gory 1, Moscow 119991, RussiaWe 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.http://dx.doi.org/10.1155/2017/4323590 |
spellingShingle | 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 Journal of Applied Mathematics |
title | A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning |
title_full | A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning |
title_fullStr | A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning |
title_full_unstemmed | A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning |
title_short | A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning |
title_sort | greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning |
url | http://dx.doi.org/10.1155/2017/4323590 |
work_keys_str_mv | AT stepananersisyan agreedyclusteringalgorithmbasedonintervalpatternconceptsandtheproblemofoptimalboxpositioning AT veravpankratieva agreedyclusteringalgorithmbasedonintervalpatternconceptsandtheproblemofoptimalboxpositioning AT vladimirmstaroverov agreedyclusteringalgorithmbasedonintervalpatternconceptsandtheproblemofoptimalboxpositioning AT vladimirepodolskii agreedyclusteringalgorithmbasedonintervalpatternconceptsandtheproblemofoptimalboxpositioning AT stepananersisyan greedyclusteringalgorithmbasedonintervalpatternconceptsandtheproblemofoptimalboxpositioning AT veravpankratieva greedyclusteringalgorithmbasedonintervalpatternconceptsandtheproblemofoptimalboxpositioning AT vladimirmstaroverov greedyclusteringalgorithmbasedonintervalpatternconceptsandtheproblemofoptimalboxpositioning AT vladimirepodolskii greedyclusteringalgorithmbasedonintervalpatternconceptsandtheproblemofoptimalboxpositioning |