Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/24076
Title: | Relieff for hierarchical multi-label classification | Authors: | Slavkov, Ivica Karcheska, Jana Kocev, Dragi Kalajdziski, Slobodan Džeroski, Sasho |
Keywords: | feature selection, feature ranking, feature relevance, structured data, hierarchical multi-label classification, multi-label classification, ReliefF | Issue Date: | 27-Sep-2013 | Publisher: | Springer, Cham | Conference: | International Workshop on New Frontiers in Mining Complex Patterns | Abstract: | In the recent years, the data available for analysis in machine learning is becoming very high-dimensional and also structured in a more complex way. This emphasises the need for developing machine learning algorithms that are able to tackle both the high-dimensionality and the complex structure of the data. Our work in this paper, focuses on extending a feature ranking algorithm that can be used as a filter method for specific type of structured data. More specifically, we adapt the RReliefF algorithm for regression, for the task of hierarchical multi-label classification (HMC). We evaluate this algorithm experimentally in a filter-like setting by employing PCTs for HMCs as a classifier and we consider datasets from various domains. The results show that HMC-ReliefF can identify the relevant features present in the data and produces a ranking where they are among the top ranked. | URI: | http://hdl.handle.net/20.500.12188/24076 |
Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
nfmcp2013_submission_17.pdf | 326.91 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.