1. 2D compressed learning: support matrix machine with bilinear random projections

   • Di Ma
   • Songcan Chen

   OriginalPaper 23 May 2019 Pages: 2035 - 2060

   

2. A scalable sparse Cholesky based approach for learning high-dimensional covariance matrices in ordered data

   • Kshitij Khare
   • Sang-Yun Oh
   • Bala Rajaratnam

   OriginalPaper 04 June 2019 Pages: 2061 - 2086

   

3. Speculate-correct error bounds for k-nearest neighbor classifiers

   • Eric Bax
   • Lingjie Weng
   • Xu Tian

   OriginalPaper 18 June 2019 Pages: 2087 - 2111

4. The kernel Kalman rule

   • Gregor H. W. Gebhardt
   • Andras Kupcsik
   • Gerhard Neumann

   OriginalPaper 18 June 2019 Pages: 2113 - 2157

   

5. Covariance-based dissimilarity measures applied to clustering wide-sense stationary ergodic processes

   • Qidi Peng
   • Nan Rao
   • Ran Zhao

   OriginalPaper 26 June 2019 Pages: 2159 - 2195