I mentioned some literature I came across for short-cutting the all-pairs similarity search. These were for sparse matrices and not dense like I need. But they might be useful.
Optimizing Parallel Algorithms for All Pairs Similarity Search (2013), http://www.cs.ucsb.edu/projects/psc/wsdm2013.pdf
Scaling up all-pairs similarity search (2007) http://wwwconference.org/www2007/papers/paper342.pdf
An Incremental Prefix Filtering Approach for the All Pairs Similarity Search Problem (unknown) http://www.win.tue.nl/~lamthuy/MyPub/ippair.pdf
Parallel All Pairs Similarity Search (unknown) http://www.lidi.info.unlp.edu.ar/WorldComp2011-Mirror/IKE5242.pdf
Some early results from trying to compare lines of best fit aren't that promising but this is just early analysis. Full results here later.
Optimizing Parallel Algorithms for All Pairs Similarity Search (2013), http://www.cs.ucsb.edu/projects/psc/wsdm2013.pdf
Scaling up all-pairs similarity search (2007) http://wwwconference.org/www2007/papers/paper342.pdf
An Incremental Prefix Filtering Approach for the All Pairs Similarity Search Problem (unknown) http://www.win.tue.nl/~lamthuy/MyPub/ippair.pdf
Parallel All Pairs Similarity Search (unknown) http://www.lidi.info.unlp.edu.ar/WorldComp2011-Mirror/IKE5242.pdf
Some early results from trying to compare lines of best fit aren't that promising but this is just early analysis. Full results here later.
No comments:
Post a Comment