2017
DOI: 10.1155/2017/4323590
|View full text |Cite
|
Sign up to set email alerts
|

A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning

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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…The problem of optimal box positioning finds its applications in computer science, pattern recognition, and data analysis [1][2][3][4]. In this paper, we have proved that this problem is NP-hard.…”
Section: Discussionmentioning
confidence: 89%
See 3 more Smart Citations
“…The problem of optimal box positioning finds its applications in computer science, pattern recognition, and data analysis [1][2][3][4]. In this paper, we have proved that this problem is NP-hard.…”
Section: Discussionmentioning
confidence: 89%
“…On the one hand, this result means that algorithms based on optimal box positioning are in general inefficient for the analysis of high-dimensional data, thus it makes sense to develop algorithms that look for an approximately optimal box position. An example of such an algorithm used for data clustering can be found in [4].…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations