Please use this identifier to cite or link to this item:
|Title:||N-dimensional Hilbert scanned hierarchical histogram representation for cluster analysis|
|Authors:||Ablameyko, Sergey V.|
|Keywords:||ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетика|
|Citation:||Proceedings of 6th International Conference on Pattern Recognition and Information Processing (PRIP’2001), May 15–17, 2001, Minsk, Belarus. – Minsk, 2001. – Vol. 1. – P. 113–120.|
|Abstract:||We propose a hierarchical representation of histograms using the Hilbert scanning algorithm in order to analyze distribution of A-dimensional data. Previous methods typically used a linear transformation such as principal component analysis. The merits of our method are that cluster information can be found from the display easily, and the distance between data in TV-dimensional space is not required to compute the clusters|
|Appears in Collections:||1997-2009|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.