Object Recognition Supported by User Interaction for Service Robots
DOI: 10.1109/icpr.2002.1048281
|View full text |Cite
|
Sign up to set email alerts
|

Branch-and-bound technique for solving optimal clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 7 publications
0
4
0
Order By: Relevance
“…A cluster analysis based on Ward's Minimum Variance method and Euclidean distances was performed for each key function using the mean values of the first three principal components (Dumay et al, 2004). We used the merging cost to determine the best cut-off distance for each dendrogram (Fränti et al, 2002). To corroborate statistical differences among these groups, we used the first three PCA components and performed a multivariate analysis of variance (MANOVA) with Hotelling's pairwise comparisons, applying the Bonferroni correction.…”
Section: Methodsmentioning
confidence: 99%
“…A cluster analysis based on Ward's Minimum Variance method and Euclidean distances was performed for each key function using the mean values of the first three principal components (Dumay et al, 2004). We used the merging cost to determine the best cut-off distance for each dendrogram (Fränti et al, 2002). To corroborate statistical differences among these groups, we used the first three PCA components and performed a multivariate analysis of variance (MANOVA) with Hotelling's pairwise comparisons, applying the Bonferroni correction.…”
Section: Methodsmentioning
confidence: 99%
“…In other words, there is no known polynomial time algorithm for finding the optimal solution. In principle, the optimal codebook can be solved by using branch-and-bound technique as proposed in [27]. The method, however, has exponential time complexity and is applicable for small clustering problems only.…”
Section: Vector Quantizationmentioning
confidence: 99%
“…In principle, the optimal codebook can be solved by using a branch-and-bound technique, as proposed in Ref. 27. The method, however, has exponential time complexity and is applicable for small clustering problems only.…”
Section: Vector Quantizationmentioning
confidence: 99%