Feature construction has been studied extensively, including for 0/1 data samples. Given the recent breakthrough in closedness-related constraint-based mining, we are considering its impact on feature construction for classification tasks. We investigate the use of condensed representations of frequent itemsets (closure equivalence classes) as new features. These itemset types have been proposed to avoid set counting in difficult association rule mining tasks. However, our guess is that their intrinsic properties (say the maximality for the closed itemsets and the minimality for the δ-free itemsets) might influence feature quality. Understanding this remains fairly open and we discuss these issues thanks to itemset properties on the one hand and an experimental validation on various data sets on the other hand. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gay, D., Selmaoui, N., & Boulicaut, J. F. (2008). Feature construction based on closedness properties is not that simple. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5012 LNAI, pp. 112–123). https://doi.org/10.1007/978-3-540-68125-0_12
Mendeley helps you to discover research relevant for your work.