TY - GEN

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

AU - Ono, Hirotaka

AU - Yagiura, Mut Unori

AU - Ibaraki, Toshihide

N1 - Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70350640692&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350640692&partnerID=8YFLogxK

U2 - 10.1007/3-540-45678-3_25

DO - 10.1007/3-540-45678-3_25

M3 - Conference contribution

AN - SCOPUS:70350640692

SN - 3540429859

SN - 9783540429852

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 279

EP - 290

BT - Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings

T2 - 12th International Symposium on Algorithms and Computation, ISAAC 2001

Y2 - 19 December 2001 through 21 December 2001

ER -