In this paper the algorithm on page 4 describes computing a weight matrix for a data adjacency graph, and a kernel matrix.

I was wondering if it would make sense to substitute the weight matrix for the kernel matrix in order to reduce the amount of memory needed to compute the full kernel matrix.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.