Learning from High-Dimensional Data in Multitask/Multilabel Classification

J. Kwok
{"title":"Learning from High-Dimensional Data in Multitask/Multilabel Classification","authors":"J. Kwok","doi":"10.1109/ACPR.2013.214","DOIUrl":null,"url":null,"abstract":"Real-world data sets are highly complicated. They can contain a lot of features, and may involve multiple learning tasks with intrinsically or explicitly represented task relationships. In this paper, we briefly discuss several recent approaches that can be used in these scenarios. The algorithms presented are flexible in capturing the task relationships, computationally efficient with good scalability, and have better empirical performance than the existing approaches.","PeriodicalId":365633,"journal":{"name":"2013 2nd IAPR Asian Conference on Pattern Recognition","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 2nd IAPR Asian Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACPR.2013.214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Real-world data sets are highly complicated. They can contain a lot of features, and may involve multiple learning tasks with intrinsically or explicitly represented task relationships. In this paper, we briefly discuss several recent approaches that can be used in these scenarios. The algorithms presented are flexible in capturing the task relationships, computationally efficient with good scalability, and have better empirical performance than the existing approaches.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多任务/多标签分类中的高维数据学习
真实世界的数据集非常复杂。它们可以包含许多特征,并且可能涉及具有内在或显式表示的任务关系的多个学习任务。在本文中,我们将简要讨论可用于这些场景的几种最新方法。所提出的算法在捕获任务关系方面灵活,计算效率高,具有良好的可扩展性,并且具有比现有方法更好的经验性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic Compensation of Radial Distortion by Minimizing Entropy of Histogram of Oriented Gradients A Robust and Efficient Minutia-Based Fingerprint Matching Algorithm Sclera Recognition - A Survey A Non-local Sparse Model for Intrinsic Images Classification Based on Boolean Algebra and Its Application to the Prediction of Recurrence of Liver Cancer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1