期刊文献+

基于关联分析的高维空间异常点发现 被引量:2

Discovery of High Dimensional Outliers Based on Association Analysis
下载PDF
导出
摘要 异常点发现是从大量数据对象中挖掘少量具有异常行为模式的数据对象,很多情况下,这些数据对象较之正常行为模式包含了更多用户感兴趣的信息.该文针对某些具体应用领域中的数据对象具有高维性的特点,利用关联分析知识,提出一种高维空间异常点发现算法,理论分析和实验表明,算法是有效可行的. Discovery of outliers is to extract a few data objects with abnormal behavior patterns, which are more interesting than common patterns in some cases, from a large amount of data. It is of practical significance in intrusion detection systems, credit fraud detection, etc. Data in these domains are usually high dimensional, particularly featured by their sparseness and decline properties. An algorithm that can obtain the outliers with high efficiency is proposed based on association analysis. Effectiveness of the algorithm is shown by theory analysis and experiment results.
出处 《应用科学学报》 CAS CSCD 北大核心 2006年第1期60-63,共4页 Journal of Applied Sciences
基金 国家自然科学基金(70371015) 教育部高等学校博士学科点专项科研基金(20040286009) 江苏省自然科学基金(BK2004058) 国家科技部中小型企业创新基金(02C26213210070)资助项目
关键词 异常点 关联规则 闭频繁项集 k关系邻域 outlier association analysis closed frequent item-sets k-relational neighboring area
  • 相关文献

参考文献6

  • 1Johnson T, Kwok I, Ng R. Fast computation of 2-dimensional depth contours. Gregory Piatetsky- Shapiro, eds. Proc. 4 th Int. Conf. on Knowledge Discovery and Data Mining[ C ]. New York, ACM Press. 1998. 224- 228.
  • 2Knorr E, Ng R. Algorithms for mining distance-based outliers in large datasets. Ashish Gupta , eds. Proceedings of the 24 th Conference on VLDB[C]. New York, NY. 1998. 392-403.
  • 3Ramaswamy S, Rastogi R, Shim K. Efficient algorithms for mining outliers from large data sets [J]. ACM Sigmoid Record,2000,29(2) :427 - 438.
  • 4Han J W, Kambr M. Data Mining Concepts and Techniques[ M]. Beijing Higher Education Press,2001.
  • 5Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases. Proceeding of the 20th International Conference on Very Large Database (VLDB) [ C ]. Santigo, Chile,1994,.
  • 6Agrawal R, Limielinski T, Swami A, Mining association rules between sets of items in large databases. Proceeding of ACM SIGMOD International Conference on Management of Data [ C ].Washington DC, 1993. 207 - 216.

同被引文献63

  • 1王宏鼎,童云海,谭少华,唐世渭,杨冬青.异常点挖掘研究进展[J].智能系统学报,2006,1(1):67-73. 被引量:22
  • 2杨宜东,孙志挥,朱玉全,杨明,张柏礼.基于动态网格的数据流离群点快速检测算法[J].软件学报,2006,17(8):1796-1803. 被引量:22
  • 3周晓云,孙志挥,张柏礼,杨宜东.高维类别属性数据流离群点快速检测算法[J].软件学报,2007,18(4):933-942. 被引量:21
  • 4KNORR E M, NG R T. Algorithms for mining distance-based outliers in large datasets[ C]//Proc of VLDB' 98. San Francisco, CA: Morgan Kaufmann Publishers, 1998:392-403.
  • 5HAWKINS D. Identification of outliers [ M ]. London : Chapman & Hall, 1980.
  • 6TAN Pang-ning, STEINBACH M, KUMAR V. Introduction to data mining[ M]. Boston: Pearson Addison-Wesley Education Inc, 2006.
  • 7KNORR E, NG R. Finding intentional knowledge of distance-based outliers[C]//Proc of VLDB'99. Edinburgh: [s. n. ], 1999:211-222.
  • 8KNORR E M, NG R T, TUCAKOV V. Distance-based outliers: algorithms and applications[ J ]. The VLDB Journal, 2000,8 (3-4) : 237-253.
  • 9AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large databases [ C ]//Proc of SIGMOD' 93. New York: ACM Press, 1993:207-216.
  • 10BREIMAN L, FRIEDMAN J H, OLSHEN R A, et al. Classification and regression trees[M]. New York: Chapman & Hall, 1984.

引证文献2

二级引证文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部