Ensemble Direct Density Ratio Estimation for Multistream Classification

Swarup Chandra, Ahsanul Haque, Hemeng Tao, Jie Liu, L. Khan, C. Aggarwal
{"title":"Ensemble Direct Density Ratio Estimation for Multistream Classification","authors":"Swarup Chandra, Ahsanul Haque, Hemeng Tao, Jie Liu, L. Khan, C. Aggarwal","doi":"10.1109/ICDE.2018.00151","DOIUrl":null,"url":null,"abstract":"In traditional machine learning, it is assumed that training data conforming to the stationary distribution of test data is readily available. Yet, such an assumption is not valid in practice due to a high cost of obtaining the truth value of data instances. This is particularly true when computing over non-stationary data streams. Recent studies in the multistream setting aim to address this issue by leveraging a stream of data with biased labeled instances (called the source stream) to train a suitable model for prediction over unlabeled instances (called the target stream). They use sampling bias correction techniques as a preprocessing step for estimating source instance weights for training a bias-corrected classifier useful to predict label of target data instances. In this regard, a recent framework proposes to utilize a Gaussian kernel model to estimate source instance weights. Unfortunately, it suffers from large computational time complexity and consequently deteriorates the rate at which streaming data is processed. In this paper, we address this issue by proposing a divide-and-conquer method suitable for simultaneously evaluating source instance weights and detecting changes in distribution over time. Our empirical results demonstrate a significant gain in execution time, compared to the previous approach, while achieving similar or better classification accuracy on real-world datasets.","PeriodicalId":247940,"journal":{"name":"2018 IEEE 34th International Conference on Data Engineering (ICDE)","volume":"298 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 34th International Conference on Data Engineering (ICDE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.2018.00151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

In traditional machine learning, it is assumed that training data conforming to the stationary distribution of test data is readily available. Yet, such an assumption is not valid in practice due to a high cost of obtaining the truth value of data instances. This is particularly true when computing over non-stationary data streams. Recent studies in the multistream setting aim to address this issue by leveraging a stream of data with biased labeled instances (called the source stream) to train a suitable model for prediction over unlabeled instances (called the target stream). They use sampling bias correction techniques as a preprocessing step for estimating source instance weights for training a bias-corrected classifier useful to predict label of target data instances. In this regard, a recent framework proposes to utilize a Gaussian kernel model to estimate source instance weights. Unfortunately, it suffers from large computational time complexity and consequently deteriorates the rate at which streaming data is processed. In this paper, we address this issue by proposing a divide-and-conquer method suitable for simultaneously evaluating source instance weights and detecting changes in distribution over time. Our empirical results demonstrate a significant gain in execution time, compared to the previous approach, while achieving similar or better classification accuracy on real-world datasets.
多流分类的集合直接密度比估计
在传统的机器学习中,假设符合测试数据平稳分布的训练数据是现成的。然而,由于获取数据实例的真值的成本很高,这种假设在实践中并不有效。在计算非平稳数据流时尤其如此。最近在多流设置中的研究旨在通过利用带有偏见标记实例的数据流(称为源流)来训练一个合适的模型来预测未标记实例(称为目标流)来解决这个问题。他们使用采样偏差校正技术作为预处理步骤,用于估计源实例权重,以训练一个偏差校正分类器,用于预测目标数据实例的标签。在这方面,最近的一个框架提出利用高斯核模型来估计源实例的权重。不幸的是,它的计算时间复杂度很高,因此降低了流数据的处理速度。在本文中,我们通过提出一种分而治之的方法来解决这个问题,该方法适用于同时评估源实例权重并检测分布随时间的变化。我们的经验结果表明,与之前的方法相比,在执行时间上有了显著的提高,同时在真实数据集上实现了相似或更好的分类精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书