Feature Selection On Boolean Symbolic Objects
Djamal Ziani

TL;DR
This paper introduces a new feature selection algorithm tailored for complex Boolean Symbolic Objects (BSOs) with multivalued features, enhancing data analysis in structured, high-dimensional datasets.
Contribution
The paper presents a novel feature selection criterion for BSOs and improves its computational complexity, addressing the challenges of high-dimensional, structured data.
Findings
New feature selection criterion for BSOs
Improved algorithm complexity
Effective selection in complex structured data
Abstract
With the boom in IT technology, the data sets used in application are more and more larger and are described by a huge number of attributes, therefore, the feature selection become an important discipline in Knowledge discovery and data mining, allowing the experts to select the most relevant features to improve the quality of their studies and to reduce the time processing of their algorithm. In addition to that, the data used by the applications become richer. They are now represented by a set of complex and structured objects, instead of simple numerical matrixes. The purpose of our algorithm is to do feature selection on rich data, called Boolean Symbolic Objects (BSOs). These objects are described by multivalued features. The BSOs are considered as higher level units which can model complex data, such as cluster of individuals, aggregated data or taxonomies. In this paper we will…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Data Management and Algorithms · Data Mining Algorithms and Applications
