Learning tree structure of label dependency for multi-label learning
- Publication Type:
- Conference Proceeding
- Citation:
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7301 LNAI (PART 1), pp. 159 - 170
- Issue Date:
- 2012-05-29
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2013002775OK.pdf | 200.03 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
There always exists some kind of label dependency in multi-label data. Learning and utilizing those dependencies could improve the learning performance further. Therefore, an approach for multi-label learning is proposed in this paper, which quantifies the dependencies of pairwise labels firstly, and then builds a tree structure of the labels to describe them. Thus the approach could find out potential strong label dependencies and produce more generalized dependent relationships. The experimental results have validated that compared with other state-of-the-art algorithms, the method is not only a competitive alternative, but also has shown better performance after ensemble learning especially. © 2012 Springer-Verlag.
Please use this identifier to cite or link to this item: