Thanks to an important research effort the last few years, inductive queries on set patterns and complete solvers which can evaluate them on large 0/1 data sets have been proved extremely useful. However, for many application domains, the raw data is numerical (matrices of real numbers whose dimensions denote objects and properties). Therefore, using efficient 0/1 mining techniques needs for tedious Boolean property encoding phases. This is, e.g., the case, when considering microarray data mining and its impact for knowledge discovery in molecular biology. We consider the possibility to mine directly numerical data to extract collections of relevant bi-sets, i.e., couples of associated sets of objects and attributes which satisfy some user-defined constraints. Not only we propose a new pattern domain but also we introduce a complete solver for computing the so-called numerical bi-sets. Preliminary experimental validation is given. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Besson, J., Robardet, C., De Raedt, L., & Boulicaut, J. F. (2007). Mining Bi-sets in numerical data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4747 LNCS, pp. 11–23). Springer Verlag. https://doi.org/10.1007/978-3-540-75549-4_2
Mendeley helps you to discover research relevant for your work.