Skip to main navigation Skip to search Skip to main content

Speed up kernel projection vector machine using kronecker decomposition

  • Xi'an Institute of Posts and Telecommunications

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a speedup algorithm for kernel projection vector machine (KPVM) based on kronecker product decomposition. The large scale kernel matrix K with size of n × n is factorized into two small matrices K1 and K2 with size n1 × n1 and n2 × n2 respectively where n1 × n2 = n. The time-consuming SVD operation on K in KPVM is calculated through K 1 and K2. The computation complexity is reduced to O(n2} from O(n3) originally while generalization ability is undiminished or even better than KPVM.

Original languageEnglish
Title of host publicationProceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012
Pages722-725
Number of pages4
StatePublished - 2012
Event2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012 - Taipei, Taiwan, Province of China
Duration: 23 Oct 201225 Oct 2012

Publication series

NameProceedings - 2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012

Conference

Conference2012 6th International Conference on New Trends in Information Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012
Country/TerritoryTaiwan, Province of China
CityTaipei
Period23/10/1225/10/12

Keywords

  • Kronecker product
  • Neural network
  • Projection vector machine

Fingerprint

Dive into the research topics of 'Speed up kernel projection vector machine using kronecker decomposition'. Together they form a unique fingerprint.

Cite this