The search functionality is under construction.

Keyword Search Result

[Keyword] probabilistic PCA(1hit)

1-1hit
  • Parametric Models for Mutual Kernel Matrix Completion

    Rachelle RIVERO  Tsuyoshi KATO  

     
    PAPER-Fundamentals of Information Systems

      Pubricized:
    2018/09/26
      Vol:
    E101-D No:12
      Page(s):
    2976-2983

    Recent studies utilize multiple kernel learning to deal with incomplete-data problem. In this study, we introduce new methods that do not only complete multiple incomplete kernel matrices simultaneously, but also allow control of the flexibility of the model by parameterizing the model matrix. By imposing restrictions on the model covariance, overfitting of the data is avoided. A limitation of kernel matrix estimations done via optimization of an objective function is that the positive definiteness of the result is not guaranteed. In view of this limitation, our proposed methods employ the LogDet divergence, which ensures the positive definiteness of the resulting inferred kernel matrix. We empirically show that our proposed restricted covariance models, employed with LogDet divergence, yield significant improvements in the generalization performance of previous completion methods.