You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The current implementation assumes all matrices to be dense (i.e. fully filled), but this isn't always the case. For example, in out uses, a ranking isn't defined for the majority of participant-dogroup pairs.
As such, it may be worthwhile to implement a sparse matrix format based on a non-sequential data array (Matrix#data) or even Compressed Row Storage. But the colReduce and rowReduce steps may be difficult or impossible to optimize on such a datastructure.
The text was updated successfully, but these errors were encountered:
The current implementation assumes all matrices to be dense (i.e. fully filled), but this isn't always the case. For example, in out uses, a ranking isn't defined for the majority of participant-dogroup pairs.
As such, it may be worthwhile to implement a sparse matrix format based on a non-sequential data array (
Matrix#data
) or even Compressed Row Storage. But thecolReduce
androwReduce
steps may be difficult or impossible to optimize on such a datastructure.The text was updated successfully, but these errors were encountered: