DocumentCode
2897589
Title
Shapiro-Wilk index: discriminatory index
Author
Chinrungrueng, J.
Author_Institution
Signal Process. for Telecommun. Sect., Pathumthani, Thailand
Volume
2
fYear
2004
fDate
26-29 Oct. 2004
Firstpage
1144
Abstract
We propose to employ the Shapiro-Wilk statistic (W statistic) as discriminatory index in the best clustering basis algorithm. The original work on the best clustering basis requires a clustering algorithm to partition clusters of data in order to obtain discriminatory index associated to a wavelet packet. The use of the W statistic eliminates the need for a clustering algorithm and therefore reduces the computational complexity introduced by a clustering algorithm. The use of the W statistic is based on testing for normality of data projection. The relationship between the W statistic and distance between cluster centroids is provided empirically. The experiments performed show that the algorithm with the W statistic can find basis functions with large discriminatory powers.
Keywords
computational complexity; entropy; functional equations; pattern clustering; statistical analysis; wavelet transforms; Shapiro-Wilk statistic; best clustering basis algorithm; cluster centroid distance; computational complexity; data projection normality; discriminatory index; entropy functional; wavelet packet; Clustering algorithms; Entropy; Fourier transforms; Matching pursuit algorithms; Partitioning algorithms; Pursuit algorithms; Signal processing algorithms; Statistics; Time series analysis; Wavelet packets;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Information Technology, 2004. ISCIT 2004. IEEE International Symposium on
Print_ISBN
0-7803-8593-4
Type
conf
DOI
10.1109/ISCIT.2004.1413898
Filename
1413898
Link To Document