Search the dblp DataBase
Hidemitsu Ogawa :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Masashi Sugiyama , Hidemitsu Ogawa A new information criterion for the selection of subspace models. [Citation Graph (0, 0)][DBLP ] ESANN, 2000, pp:69-74 [Conf ] Masashi Sugiyama , Hidemitsu Ogawa Incremental Active Learning with Bias Reduction. [Citation Graph (0, 0)][DBLP ] IJCNN (1), 2000, pp:15-20 [Conf ] Masashi Sugiyama , Hidemitsu Ogawa Training Data Selection for Optimal Generalization in Trigonometric Polynomial Networks. [Citation Graph (0, 0)][DBLP ] NIPS, 1999, pp:624-630 [Conf ] Hidemitsu Ogawa , Yoshinori Isomichi Optimum Spatial Filter and Uncertainty [Citation Graph (0, 0)][DBLP ] Information and Control, 1969, v:14, n:2, pp:180-216 [Journal ] Marko Jankovic , Hidemitsu Ogawa A New Modulated Hebbian Learning Rule - Biologically Plausible Method for Local Computation of a Principal Subspace. [Citation Graph (0, 0)][DBLP ] Int. J. Neural Syst., 2003, v:13, n:4, pp:215-223 [Journal ] Marko Jankovic , Hidemitsu Ogawa Time-oriented hierarchical method for computation of principal components using subspace learning algorithm. [Citation Graph (0, 0)][DBLP ] Int. J. Neural Syst., 2004, v:14, n:5, pp:313-323 [Journal ] Sethu Vijayakumar , Hidemitsu Ogawa RKHS-based functional analysis for exact incremental learning. [Citation Graph (0, 0)][DBLP ] Neurocomputing, 1999, v:29, n:1-3, pp:85-113 [Journal ] Masashi Sugiyama , Hidemitsu Ogawa Theoretical and Experimental Evaluation of the Subspace Information Criterion. [Citation Graph (0, 0)][DBLP ] Machine Learning, 2002, v:48, n:1-3, pp:25-50 [Journal ] Masashi Sugiyama , Hidemitsu Ogawa Subspace Information Criterion for Model Selection. [Citation Graph (0, 0)][DBLP ] Neural Computation, 2001, v:13, n:8, pp:1863-1889 [Journal ] Masashi Sugiyama , Hidemitsu Ogawa Incremental Active Learning for Optimal Generalization. [Citation Graph (0, 0)][DBLP ] Neural Computation, 2001, v:12, n:12, pp:2909-2940 [Journal ] Akiko Nakashima , Akira Hirabayashi , Hidemitsu Ogawa Error correcting memorization learning for noisy training examples. [Citation Graph (0, 0)][DBLP ] Neural Networks, 2001, v:14, n:1, pp:79-92 [Journal ] Akiko Nakashima , Hidemitsu Ogawa Noise suppression in training examples for improving generalization capability. [Citation Graph (0, 0)][DBLP ] Neural Networks, 2001, v:14, n:4-5, pp:459-469 [Journal ] Masashi Sugiyama , Hidemitsu Ogawa Incremental projection learning for optimal generalization. [Citation Graph (0, 0)][DBLP ] Neural Networks, 2001, v:14, n:1, pp:53-66 [Journal ] Masashi Sugiyama , Hidemitsu Ogawa Properties of incremental projection learning. [Citation Graph (0, 0)][DBLP ] Neural Networks, 2001, v:14, n:1, pp:67-78 [Journal ] Masashi Sugiyama , Hidemitsu Ogawa Optimal design of regularization term and regularization parameter by subspace information criterion. [Citation Graph (0, 0)][DBLP ] Neural Networks, 2002, v:15, n:3, pp:349-361 [Journal ] D. Liu , Yukihiko Yamashita , Hidemitsu Ogawa Pattern recognition in the presence of noise. [Citation Graph (0, 0)][DBLP ] Pattern Recognition, 1995, v:28, n:7, pp:989-995 [Journal ] Akira Hirabayashi , Hidemitsu Ogawa A family of projection learnings. [Citation Graph (0, 0)][DBLP ] Systems and Computers in Japan, 2001, v:32, n:5, pp:21-35 [Journal ] Hidekazu Iwaki , Hidemitsu Ogawa , Akira Hirabayashi Optimally generalizing neural networks with the ability to recover from single stuck-at r faults. [Citation Graph (0, 0)][DBLP ] Systems and Computers in Japan, 2002, v:33, n:7, pp:114-123 [Journal ] Masashi Sugiyama , Hidemitsu Ogawa A unified method for optimizing linear image restoration filters. [Citation Graph (0, 0)][DBLP ] Signal Processing, 2002, v:82, n:11, pp:1773-1787 [Journal ] Ganka Petkova Kovacheva , Hidemitsu Ogawa Radial basis function classifier for fault diagnostics. [Citation Graph (0, 0)][DBLP ] ISICT, 2003, pp:64-69 [Conf ] Optimal noise suppression: A geometric nature of pseudoframes for subspaces. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs