I would like to find a faster way of computing a similarity distance matrix.
My current solution is the following:
time=: 6!:2
9!:3(5) NB. set system for linear display of verbs
$ t2 =: 5000 40 $ ?.200000#5 NB. data table of integers, 40
variables, 5000 records
find_similarity_distance_matrix =: 13 : '+/@:="1/~ y'
time '$ find_similarity_distance_matrix t2'
NB. 6.73964
Is there a way to improve it, with special code perhaps?
-Tarmo
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
