Show simple item record

dc.contributor.authorHan, Yufei
dc.contributor.authorSun, Guolei
dc.contributor.authorShen, Yun
dc.contributor.authorZhang, Xiangliang
dc.date.accessioned2018-09-26T13:28:49Z
dc.date.available2018-09-26T13:28:49Z
dc.date.issued2018-07-19
dc.identifier.citationHan Y, Sun G, Shen Y, Zhang X (2018) Multi-label Learning with Highly Incomplete Data via Collaborative Embedding. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD ’18. Available: http://dx.doi.org/10.1145/3219819.3220038.
dc.identifier.doi10.1145/3219819.3220038
dc.identifier.urihttp://hdl.handle.net/10754/628779
dc.description.abstractTremendous efforts have been dedicated to improving the effectiveness of multi-label learning with incomplete label assignments. Most of the current techniques assume that the input features of data instances are complete. Nevertheless, the co-occurrence of highly incomplete features and weak label assignments is a challenging and widely perceived issue in real-world multi-label learning applications due to a number of practical reasons including incomplete data collection, moderate labels from annotators, etc. Existing multi-label learning algorithms are not directly applicable when the observed features are highly incomplete. In this work, we attack this problem by proposing a weakly supervised multi-label learning approach, based on the idea of collaborative embedding. This approach provides a flexible framework to conduct efficient multi-label classification at both transductive and inductive mode by coupling the process of reconstructing missing features and weak label assignments in a joint optimisation framework. It is designed to collaboratively recover feature and label information, and extract the predictive association between the feature profile and the multi-label tag of the same data instance. Substantial experiments on public benchmark datasets and real security event data validate that our proposed method can provide distinctively more accurate transductive and inductive classification than other state-of-the-art algorithms.
dc.description.sponsorshipThis work is partially supported by King Abdullah University of Science and Technology (KAUST).
dc.publisherAssociation for Computing Machinery (ACM)
dc.relation.urlhttps://dl.acm.org/citation.cfm?doid=3219819.3220038
dc.rightsArchived with thanks to Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18
dc.subjectHighly incomplete feature
dc.subjectMulti-label learning
dc.subjectWeak labels
dc.titleMulti-label Learning with Highly Incomplete Data via Collaborative Embedding
dc.typeConference Paper
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.identifier.journalProceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18
dc.conference.date2018-08-19 to 2018-08-23
dc.conference.name24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2018
dc.conference.locationLondon, GBR
dc.eprint.versionPublisher's Version/PDF
dc.contributor.institutionSymantec Research Labs, Biot Sophia-Antipolis, France
dc.contributor.institutionSymantec Research Labs, Dublin, Ireland
kaust.personSun, Guolei
kaust.personZhang, Xiangliang
refterms.dateFOA2018-09-27T07:49:22Z
dc.date.published-online2018-07-19
dc.date.published-print2018


Files in this item

Thumbnail
Name:
p1494-han.pdf
Size:
1.620Mb
Format:
PDF
Description:
Published version

This item appears in the following Collection(s)

Show simple item record