大会名称 |
---|
2018年 情報科学技術フォーラム(FIT) |
大会コ-ド |
F |
開催年 |
2018 |
発行日 |
2018-09-12 |
セッション番号 |
6f |
セッション名 |
機械学習(4) |
講演日 |
2018/09/21 |
講演場所(会議室等) |
D棟D23 |
講演番号 |
IF-004 |
タイトル |
Approximate Vanishing Ideal via Data Knotting |
著者名 |
計良宥志, 長谷川禎彦, |
キーワード |
消失イデアル, 計算代数 |
抄録 |
The vanishing ideal is a set of polynomials that takes zero value on the given data points. Originally proposed in computer algebra, the vanishing ideal has been recently exploited for extracting the nonlinear structures of data in many applications. The present paper proposes a vanishing ideal that is tolerant to noisy data and also pursued to have a better algebraic structure. As a new problem, we simultaneously find a set of polynomials and data points for which the polynomials approximately vanish on the input data points, and almost exactly vanish on the discovered data points. |
本文pdf |
PDF download (174.8KB) |