Optimizing Tree-Based Contrast Subspace Mining Using Genetic Algorithm
Mining contrast subspace is a task of finding contrast subspace where a given query object is most similar to a target class but dissimilar to non-target class in a multidimensional data set. Recently, tree-based contrast subspace mining method has been introduced to find contrast subspace in numeri...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | en en |
| Published: |
Atlantis Press
2022
|
| Subjects: | |
| Online Access: | https://eprints.ums.edu.my/id/eprint/34294/1/FULL%20TEXT.pdf https://eprints.ums.edu.my/id/eprint/34294/2/ABSTRACT.pdf https://eprints.ums.edu.my/id/eprint/34294/ https://link.springer.com/content/pdf/10.1007/s44196-022-00126-0.pdf http://dx.doi.org/10.1007/s44196-022-00126-0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Mining contrast subspace is a task of finding contrast subspace where a given query object is most similar to a target class but dissimilar to non-target class in a multidimensional data set. Recently, tree-based contrast subspace mining method has been introduced to find contrast subspace in numerical data set effectively. However, the contrast subspace search of the tree-based method may be trapped in local optima within the search space. This paper proposes a tree-based method which incorporates genetic algorithm to optimize the contrast subspace search by identifying global optima contrast subspace. The experiment results showed that the proposed method performed well on several cases compared to the variation of the tree-based method. |
|---|