摘要：In this paper, the diagonal majorization algorithm (DMA) has been investigated. The research focuses on the possibilities to increase the efficiency of the algorithm by disclosing its properties. The diagonal majorization algorithm is oriented at the multidimensional data visualization. The experiments have proved that, when visualizing large data set with DMA, it is possible to save the computing time taking into account several factors: the strategy of numbering of multidimensional vectors in the analysed data set and the neighbourhood order parameter.
