A Practical Approach to Classify Evolving Data Streams: Training with Limited Amount of Labeled Data

M. Masud, Jing Gao, L. Khan, Jiawei Han, B. Thuraisingham
{"title":"A Practical Approach to Classify Evolving Data Streams: Training with Limited Amount of Labeled Data","authors":"M. Masud, Jing Gao, L. Khan, Jiawei Han, B. Thuraisingham","doi":"10.1109/ICDM.2008.152","DOIUrl":null,"url":null,"abstract":"Recent approaches in classifying evolving data streams are based on supervised learning algorithms, which can be trained with labeled data only. Manual labeling of data is both costly and time consuming. Therefore, in a real streaming environment, where huge volumes of data appear at a high speed, labeled data may be very scarce. Thus, only a limited amount of training data may be available for building the classification models, leading to poorly trained classifiers. We apply a novel technique to overcome this problem by building a classification model from a training set having both unlabeled and a small amount of labeled instances. This model is built as micro-clusters using semi-supervised clustering technique and classification is performed with kappa-nearest neighbor algorithm. An ensemble of these models is used to classify the unlabeled data. Empirical evaluation on both synthetic data and real botnet traffic reveals that our approach, using only a small amount of labeled data for training, outperforms state-of-the-art stream classification algorithms that use twenty times more labeled data than our approach.","PeriodicalId":252958,"journal":{"name":"2008 Eighth IEEE International Conference on Data Mining","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"141","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Eighth IEEE International Conference on Data Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDM.2008.152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 141

Abstract

Recent approaches in classifying evolving data streams are based on supervised learning algorithms, which can be trained with labeled data only. Manual labeling of data is both costly and time consuming. Therefore, in a real streaming environment, where huge volumes of data appear at a high speed, labeled data may be very scarce. Thus, only a limited amount of training data may be available for building the classification models, leading to poorly trained classifiers. We apply a novel technique to overcome this problem by building a classification model from a training set having both unlabeled and a small amount of labeled instances. This model is built as micro-clusters using semi-supervised clustering technique and classification is performed with kappa-nearest neighbor algorithm. An ensemble of these models is used to classify the unlabeled data. Empirical evaluation on both synthetic data and real botnet traffic reveals that our approach, using only a small amount of labeled data for training, outperforms state-of-the-art stream classification algorithms that use twenty times more labeled data than our approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
演化数据流分类的实用方法:用有限数量的标记数据进行训练
最近对不断变化的数据流进行分类的方法是基于监督学习算法的,这种算法只能用标记数据进行训练。手动标记数据既昂贵又耗时。因此,在真实的流环境中,大量数据以高速出现,标记数据可能非常稀缺。因此,只有有限数量的训练数据可用于构建分类模型,导致训练不良的分类器。我们采用了一种新的技术来克服这个问题,即从具有未标记和少量标记实例的训练集构建分类模型。该模型采用半监督聚类技术构建微聚类,并采用kappa最近邻算法进行分类。这些模型的集合被用来对未标记的数据进行分类。对合成数据和真实僵尸网络流量的经验评估表明,我们的方法仅使用少量标记数据进行训练,优于最先进的流分类算法,该算法使用的标记数据是我们方法的20倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SeqStream: Mining Closed Sequential Patterns over Stream Sliding Windows Support Vector Regression for Censored Data (SVRc): A Novel Tool for Survival Analysis A Probability Model for Projective Clustering on High Dimensional Data Text Cube: Computing IR Measures for Multidimensional Text Database Analysis A Hierarchical Algorithm for Clustering Uncertain Data via an Information-Theoretic Approach
×
引用
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