to be presented at the next Simbad Workshop. We present a way to get linear
runtime complexity for the iKFD algorithm given the input matrix is (approximately)
low rank. The original iKFD has cubic runtime complexity. iKFD is a very good
classification algorithm for indefinite / non-metric / non-positive input kernels and
our proposal makes iKFD ready for large scale problems.