SnFFT: a Julia toolkit for Fourier analysis of functions over permutations. 𝕊 n FFT is an easy to use software library written in the Julia language to facilitate Fourier analysis on the symmetric group (set of permutations) of degree n, denoted 𝕊 n and make it more easily deployable within statistical machine learning algorithms. Our implementation internally creates the irreducible matrix representations of 𝕊 n , and efficiently computes fast Fourier transforms (FFTs) and inverse fast Fourier transforms (iFFTs). Advanced users can achieve scalability and promising practical performance by exploiting various other forms of sparsity. Further, the library also supports the partial inverse Fourier transforms which utilizes the smoothness properties of functions by maintaining only the first few Fourier coefficients. Out of the box, 𝕊 n FFT currently offers two non-trivial operations for functions defined on 𝕊 n , namely convolution and correlation. While the potential applicability of 𝕊 n FFT is fairly broad, as an example, we show how it can be used for clustering ranked data, where each ranking is modeled as a distribution on 𝕊 n .
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.
- Plumb, Gregory; Pachauri, Deepti; Kondor, Risi; Singh, Vikas: $\Bbb S_n$FFT: a Julia toolkit for Fourier analysis of functions over permutations (2015)