An index for the data size to extract decomposable structures in LAD

Hirotaka Ono, Mut Unori Yagiura, Toshihide Ibaraki

研究成果: 著書/レポートタイプへの貢献会議での発言

1 引用 (Scopus)

抜粋

Logical analysis of data (LAD)is one of the methodologies for extracting knowledge as a Boolean function f from a given pair of data sets (T,F)on attributes set S of size n in whch T (resp.,F)0 , 1n denotes a set of positive (resp.,negative)examples for the phenomenon under cons deration.In this paper,we consider the case n which extracted knowledge has a decomposable structure;i.e.,f is described as aform f (x)=g(x[S0],h x[S 1]))for some S0,S1 .S and Boolean functions g and h where x[I]denotes the projection of vector x on I In order to detect meaningful decomposable structures,it is expected that the sizes |T|and |F| must be sufficiently large.In this paper,we provide an index for such indispensable number of examples,based on probabilistic analysis.Using p = |T|/|T|+ |F|)and q = |F|/|T|+|F|),we claim that there exist many deceptive decomposable structures of (T,F) if |T|+|F| ≤√2n-1 /pq The computat onal results on synthetically generated data sets show that the above index gives a good lower bound on the indispensable data size.

元の言語英語
ホスト出版物のタイトルAlgorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
ページ279-290
ページ数12
DOI
出版物ステータス出版済み - 12 1 2001
イベント12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, ニュージ―ランド
継続期間: 12 19 200112 21 2001

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2223 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他12th International Symposium on Algorithms and Computation, ISAAC 2001
ニュージ―ランド
Christchurch
期間12/19/0112/21/01

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Ono, H., Yagiura, M. U., & Ibaraki, T. (2001). An index for the data size to extract decomposable structures in LAD. : Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings (pp. 279-290). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2223 LNCS). https://doi.org/10.1007/3-540-45678-3_25