Improved Bisector pruning for uncertain data mining

Ivica Lukić, M. Köhler, Ninoslav Slavek
{"title":"Improved Bisector pruning for uncertain data mining","authors":"Ivica Lukić, M. Köhler, Ninoslav Slavek","doi":"10.2498/iti.2012.0353","DOIUrl":null,"url":null,"abstract":"Uncertain data mining is well studied and very challenging task. This paper is concentrated on clustering uncertain objects with location uncertainty. Uncertain locations are described by probability density function (PDF). Number of uncertain objects can be very large and obtaining quality result within reasonable time is a challenging task. Basic clustering method is UK-means, in which all expected distances (ED) from objects to clusters are calculated. Thus UK-means is inefficient. To avoid ED calculations various pruning methods are proposed. The pruning methods are significantly more effective than UK-means method. In this paper, Improved Bisector pruning method is proposed as an improvement of clustering process.","PeriodicalId":135105,"journal":{"name":"Proceedings of the ITI 2012 34th International Conference on Information Technology Interfaces","volume":"154 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ITI 2012 34th International Conference on Information Technology Interfaces","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2498/iti.2012.0353","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Uncertain data mining is well studied and very challenging task. This paper is concentrated on clustering uncertain objects with location uncertainty. Uncertain locations are described by probability density function (PDF). Number of uncertain objects can be very large and obtaining quality result within reasonable time is a challenging task. Basic clustering method is UK-means, in which all expected distances (ED) from objects to clusters are calculated. Thus UK-means is inefficient. To avoid ED calculations various pruning methods are proposed. The pruning methods are significantly more effective than UK-means method. In this paper, Improved Bisector pruning method is proposed as an improvement of clustering process.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
不确定数据挖掘的改进型平分线剪枝
不确定数据挖掘是一项研究非常深入且具有挑战性的任务。本文主要研究具有位置不确定性的不确定目标的聚类问题。不确定位置用概率密度函数(PDF)描述。不确定对象的数量可能非常大,在合理的时间内获得高质量的结果是一项具有挑战性的任务。聚类的基本方法是UK-means,即计算目标到聚类的所有期望距离(ED)。因此,英国的手段是低效的。为了避免ED计算,提出了各种修剪方法。修剪方法的效果明显优于UK-means方法。本文提出了一种改进的平分线剪枝方法作为聚类过程的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Risk management and business credit scoring GAAP. genetic algorithm with auxiliary populations applied to continuous optimization problems BICIKELJ: Environmental data mining on the bicycle XML schema domain identification Acceptance of verificator by information science students
×
引用
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