A Fast Greedy Algorithm for Outlier Mining

何增友

0
0
浏览
下载

摘要
关键词
基金信息
论文图表
同行评议
相关论文
评论

A Fast Greedy Algorithm for Outlier Mining

首发时间：2005-07-28

zengyou he ¹

1、Harbin Institute of Technology

Abstract：The task of outlier detection is to find small groups of data objects that are exceptional when compared with rest large amount of data. In [38], the problem of outlier detection in categorical data is defined as an optimization problem and a local-search heuristic based algorithm (LSA) is presented. However, as is the case with most iterative type algorithms, the LSA algorithm is still very time-consuming on very large datasets. In this paper, we present a very fast greedy algorithm for mining outliers under the same optimization model. Experimental results on real datasets and large synthetic datasets show that: (1) Our algorithm has comparable performance with respect to those state-of-art outlier detection algorithms on identifying true outliers and (2) Our algorithm can be an order of magnitude faster than LSA algorithm.

keywords： Outlier, Optimization, Greedy Algorithm, Entropy, Data Mining

点击查看论文中文信息

A Fast Greedy Algorithm for Outlier Mining

何增友 ¹

1、哈尔滨工业大学计算机学院

摘要：The task of outlier detection is to find small groups of data objects that are exceptional when compared with rest large amount of data. In [38], the problem of outlier detection in categorical data is defined as an optimization problem and a local-search heuristic based algorithm (LSA) is presented. However, as is the case with most iterative type algorithms, the LSA algorithm is still very time-consuming on very large datasets. In this paper, we present a very fast greedy algorithm for mining outliers under the same optimization model. Experimental results on real datasets and large synthetic datasets show that: (1) Our algorithm has comparable performance with respect to those state-of-art outlier detection algorithms on identifying true outliers and (2) Our algorithm can be an order of magnitude faster than LSA algorithm.

关键词： Outlier, Optimization, Greedy Algorithm, Entropy, Data Mining

基金：

论文图表：

引用

导出参考文献

.txt

.ris

.doc

zengyou he. A Fast Greedy Algorithm for Outlier Mining[EB/OL]. Beijing:Sciencepaper Online[2005-07-28]. http://www.paper.edu.cn/releasepaper/content/200507-217.

No.2548134111122511****

同行评议

未申请同行评议

全部评论

0/1000

论文编号	200507-217
论文题目	A Fast Greedy Algorithm for Outlier Mining
文献类型
收录期刊	上传封面中文期刊英文期刊期刊名称（中文）期刊名称（英文）年，卷（）上传封面中文专著英文专著书名（中文）书名（英文）出版地出版社出版年上传封面中文译著英文译著书名（中文）书名（英文）出版地出版社出版年上传封面中文论文集英文论文集编者.论文集名称（中文） [c]. 出版地出版社出版年， - 编者.论文集名称（英文） [c]. 出版地出版社出版年，- 上传封面中文文献英文文献期刊名称（中文）期刊名称（英文）日期-- 在线地址http:// 上传封面中文文献英文文献文题（中文）文题（英文）出版地出版社,出版日期-- 上传封面中文文献英文文献文题（中文）文题（英文）出版地出版社,出版日期--
英文作者写法：中外文作者均姓前名后，姓大写，名的第一个字母大写，姓全称写出，名可只写第一个字母，其后不加实心圆点“.”, 作者之间用逗号“，”分隔，最后为实心圆点“.”, 示例1：原姓名写法：Albert Einstein,编入参考文献时写法：Einstein A. 示例2：原姓名写法：李时珍；编入参考文献时写法：LI S Z. 示例3：YELLAND R L,JONES S C,EASTON K S,et al.