Multivariate permutation tests for the k-sample problem with clustered data
The present paper deals with the choice of clustering algorithms before treating a k-sample problem. We investigate multivariate data sets that are quantized by algorithms that define partitions by maximal support planes (MSP) of a convex function. These algorithms belong to a wide class containing...
Main Author: | Rahnenführer, Jörg |
---|---|
Format: | Others |
Language: | en |
Published: |
SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business
1999
|
Subjects: | |
Online Access: | http://epub.wu.ac.at/1364/1/document.pdf |
Similar Items
-
ON GENERATING MULTIVARIATE SAMPLES WITH ARCHIMEDEAN COPULAS
by: Jacek Stelmach
Published: (2014-11-01) -
A Multivariate Extension of McNemar’s Test Based on Permutations
by: Grzegorz Kończak
Published: (2020-11-01) -
Overview of NonParametric Combination-based permutation tests for Multivariate multi-sample problems
by: Rosa Arboretti Giancristofaro, et al.
Published: (2014-09-01) -
Ranks of permutative matrices
by: Hu Xiaonan, et al.
Published: (2016-06-01) -
Multimodal Optimization of Permutation Flow-Shop Scheduling Problems Using A Clustering-Genetic-Algorithm-Based Approach
by: Pan Zou, et al.
Published: (2021-04-01)