Subgroup Discovery on Multiple Instance Data
To date, the subgroup discovery (SD) task has been considered in problems where a target variable is unequivocally described by a set of features, also known as instance. Nowadays, however, with the increasing interest in data storage, new data structures are being provided such as the multiple inst...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2019-12-01
|
| Series: | International Journal of Computational Intelligence Systems |
| Subjects: | |
| Online Access: | https://www.atlantis-press.com/article/125927212/view |
| _version_ | 1818216873376874496 |
|---|---|
| author | J. M. Luna C. J. Carmona A. M. García-Vico M. J. del Jesus S. Ventura |
| author_facet | J. M. Luna C. J. Carmona A. M. García-Vico M. J. del Jesus S. Ventura |
| author_sort | J. M. Luna |
| collection | DOAJ |
| description | To date, the subgroup discovery (SD) task has been considered in problems where a target variable is unequivocally described by a set of features, also known as instance. Nowadays, however, with the increasing interest in data storage, new data structures are being provided such as the multiple instance data in which a target variable value is ambiguously defined by a set of instances. Most of the proposals related to multiple instance data are based on predictive tasks and no supervised descriptive analysis can be provided when data is organized in this way. At this point, the aim of this work is to extend the SD task to cope with this type of data. SD is a really interesting task that aims at discovering interesting relationships between different features with respect to a specific target variable that is of interest for the user or the problem under study. In this regard, this paper presents three different approaches for mining interesting subgroups in multiple instance problems. The proposed models represent three different ways of tackling the problem and they are based on three well-known algorithms in the SD field: SD-Map (exhaustive search approach), CGBA-SD (Comprehensible Grammar-Based Algorithm for Subgroup Discovery) and NMEEF-SD (multi-objective evolutionary fuzzy system). The proposals have been tested on a wide set of datasets, including 10 real-world and 20 synthetic datasets, aiming at describing how the three methodologies behave on different scenarios. Any comparison is unfair since they are completely different methodologies. |
| first_indexed | 2024-12-12T06:58:53Z |
| format | Article |
| id | doaj.art-090f3b7002d24058ada8c3757b4b74ee |
| institution | Directory Open Access Journal |
| issn | 1875-6883 |
| language | English |
| last_indexed | 2024-12-12T06:58:53Z |
| publishDate | 2019-12-01 |
| publisher | Springer |
| record_format | Article |
| series | International Journal of Computational Intelligence Systems |
| spelling | doaj.art-090f3b7002d24058ada8c3757b4b74ee2022-12-22T00:33:53ZengSpringerInternational Journal of Computational Intelligence Systems1875-68832019-12-0112210.2991/ijcis.d.191213.001Subgroup Discovery on Multiple Instance DataJ. M. LunaC. J. CarmonaA. M. García-VicoM. J. del JesusS. VenturaTo date, the subgroup discovery (SD) task has been considered in problems where a target variable is unequivocally described by a set of features, also known as instance. Nowadays, however, with the increasing interest in data storage, new data structures are being provided such as the multiple instance data in which a target variable value is ambiguously defined by a set of instances. Most of the proposals related to multiple instance data are based on predictive tasks and no supervised descriptive analysis can be provided when data is organized in this way. At this point, the aim of this work is to extend the SD task to cope with this type of data. SD is a really interesting task that aims at discovering interesting relationships between different features with respect to a specific target variable that is of interest for the user or the problem under study. In this regard, this paper presents three different approaches for mining interesting subgroups in multiple instance problems. The proposed models represent three different ways of tackling the problem and they are based on three well-known algorithms in the SD field: SD-Map (exhaustive search approach), CGBA-SD (Comprehensible Grammar-Based Algorithm for Subgroup Discovery) and NMEEF-SD (multi-objective evolutionary fuzzy system). The proposals have been tested on a wide set of datasets, including 10 real-world and 20 synthetic datasets, aiming at describing how the three methodologies behave on different scenarios. Any comparison is unfair since they are completely different methodologies.https://www.atlantis-press.com/article/125927212/viewSupervised descriptive patternsSubgroup discoveryMulti-instance dataMetaheuristics |
| spellingShingle | J. M. Luna C. J. Carmona A. M. García-Vico M. J. del Jesus S. Ventura Subgroup Discovery on Multiple Instance Data International Journal of Computational Intelligence Systems Supervised descriptive patterns Subgroup discovery Multi-instance data Metaheuristics |
| title | Subgroup Discovery on Multiple Instance Data |
| title_full | Subgroup Discovery on Multiple Instance Data |
| title_fullStr | Subgroup Discovery on Multiple Instance Data |
| title_full_unstemmed | Subgroup Discovery on Multiple Instance Data |
| title_short | Subgroup Discovery on Multiple Instance Data |
| title_sort | subgroup discovery on multiple instance data |
| topic | Supervised descriptive patterns Subgroup discovery Multi-instance data Metaheuristics |
| url | https://www.atlantis-press.com/article/125927212/view |
| work_keys_str_mv | AT jmluna subgroupdiscoveryonmultipleinstancedata AT cjcarmona subgroupdiscoveryonmultipleinstancedata AT amgarciavico subgroupdiscoveryonmultipleinstancedata AT mjdeljesus subgroupdiscoveryonmultipleinstancedata AT sventura subgroupdiscoveryonmultipleinstancedata |