Can you comment a bit how they combine the random sign matrix and the subsample random subsample fourrier basis?
Best regards, Arnaud Joly On 29 Oct 2014, at 14:24, Michal Romaniuk <[email protected]> wrote: > Hi everyone, > > I'm thinking of adding the Unrestricted Fast Johnson-Lindenstrauss > Transform [1] to the random_projections module and would like to ask if > maybe someone is already working on this. > > (If you know of a competing algorithm that would be worth looking at, > please let me know ;)) > > Thanks, > Michal > > [1] Ailon, N. and Liberty, E. 2013. An almost optimal unrestricted fast > Johnson-Lindenstrauss transform. ACM Trans. Algorithms 9, 3, Article 21 > (June 2013), 12 pages. > DOI:http://dx.doi.org/10.1145/2483699.2483701 > > ------------------------------------------------------------------------------ > _______________________________________________ > Scikit-learn-general mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/scikit-learn-general ------------------------------------------------------------------------------ _______________________________________________ Scikit-learn-general mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
