Open GoogleCodeExporter opened 8 years ago
Original comment by polygan...@gmail.com
on 5 May 2008 at 11:25
Attachments:
Hi William,
For you problem, the problem size is too small.
If the dataset could be larger, most time will be spent on the step E = I + H^T
* D *
H and this step could archive good speedup. For small dataset, time is mostly
spent
on other steps (such as CF: cholesky factorization) and in this case, the
speedup is low.
Original comment by baihong...@gmail.com
on 5 May 2008 at 12:17
Thanks. Let me have a try on larger dataset.
Rcv1 dataset is selected to test it.
Original comment by polygan...@gmail.com
on 6 May 2008 at 9:46
Hi,
After do some large dataset, i found the psvm is a large memory-consuming code
during the ICF
period.The RCV1 and ijcnn1 dataset are tested on my cluster. The result is not
so well.
Original comment by polygan...@gmail.com
on 9 May 2008 at 10:30
Original issue reported on code.google.com by
polygan...@gmail.com
on 5 May 2008 at 11:24