An outlier mining algorithm based on constrained concept lattice

线性子空间 子空间拓扑 离群值 算法 格子(音乐) 计算机科学 数学 数据挖掘 异常检测 模式识别(心理学) 人工智能 几何学 声学 物理
作者
Jifu Zhang,Sulan Zhang,Kai H. Chang,Xiao Qin
出处
期刊:International Journal of Systems Science [Taylor & Francis]
卷期号:45 (5): 1170-1179 被引量:24
标识
DOI:10.1080/00207721.2012.745029
摘要

AbstractTraditional outlier mining methods identify outliers from a global point of view. These methods are inefficient to find locally biased data points (outliers) in low dimensional subspaces. Constrained concept lattices can be used as an effective formal tool for data analysis because constrained concept lattices have the characteristics of high constructing efficiency, practicability and pertinency. In this paper, we propose an outlier mining algorithm that treats the intent of any constrained concept lattice node as a subspace. We introduce sparsity and density coefficients to measure outliers in low dimensional subspaces. The intent of any constrained concept lattice node is regarded as a subspace, and sparsity subspaces are searched by traversing the constrained concept lattice according to a sparsity coefficient threshold. If the intent of any father node of the sparsity subspace is a density subspace according to a density coefficient threshold, then objects contained in the extent of the sparsity subspace node are considered as bias data points or outliers. Our experimental results show that the proposed algorithm performs very well for high red-shift spectral data sets.Keywords: constrained concept latticeoutlierssparsity subspacedensity coefficient AcknowledgementsThis work is partially supported by the National Natural Science Foundation of P.R. China (61073145), the Natural Science Foundation of Shanxi Province, P.R. China (2010011021-2) and the Returning Students and Scholars Research Project of Shanxi Province, P.R.China (2009-77). Xiao Qin's work was made possible thanks to NSF awards CCF-0845257 (CAREER), CNS-0757778 (CSR), CCF-0742187 (CPA), CNS-0831502 (CyberTrust), OCI-0753305 (CI-TEAM), DUE-0837341 (CCLI) and DUE-0830831 (SFS).Additional informationNotes on contributorsJifu ZhangJifu Zhang is a Professor in School of Computer Science and Technology, Taiyuan University of Science and Technology, China. He received his PhD degree in Pattern Recognition and Intelligence Systems from Beijing Institute of Technology, China in 2005, and has published more than 100 papers. His current research interests include concept lattice, data mining and artificial intelligence. An outlier mining algorithm based on constrained concept latticeAll authorsJifu Zhang, Sulan Zhang, Kai H. Chang & Xiao Qinhttps://doi.org/10.1080/00207721.2012.745029Published online:21 January 2014Display full size Sulan ZhangSulan Zhang is an Associate Professor in School of Computer Science and Technology, University of Science and Technology, China. Her current research interests include concept lattice, data mining, granular computing, image processing and pattern recognition. An outlier mining algorithm based on constrained concept latticeAll authorsJifu Zhang, Sulan Zhang, Kai H. Chang & Xiao Qinhttps://doi.org/10.1080/00207721.2012.745029Published online:21 January 2014Display full size Kai H. ChangKai H. Chang is a Professor and the chair of Computer Science and Software Engineering Department, Auburn University. He received his PhD degree in Electrical and Computer Engineering from University of Cincinnati in 1986. His research and educational interests are in the area of software testing, software quality assurance, artificial intelligence and computer science education. He is also recognised for his contributions to the software engineering education program by serving as an IEEE-Computer Society/ACM Curriculum Committee for Software Engineering (CCSE) member. An outlier mining algorithm based on constrained concept latticeAll authorsJifu Zhang, Sulan Zhang, Kai H. Chang & Xiao Qinhttps://doi.org/10.1080/00207721.2012.745029Published online:21 January 2014Display full size Xiao QinXiao Qin is an Associate Professor with the Department of Computer Science and Software Engineering, Auburn University. He received his PhD degree in Computer Science from the University of Nebraska-Lincoln in 2004. His research interests include data-intensive computing, parallel and distributed systems, storage systems and performance evaluation. He also has been on the program committees of various international conferences, including IEEE Cluster, IEEE International Performance, Computing and Communications Conference and International Conference on Parallel Processing. An outlier mining algorithm based on constrained concept latticeAll authorsJifu Zhang, Sulan Zhang, Kai H. Chang & Xiao Qinhttps://doi.org/10.1080/00207721.2012.745029Published online:21 January 2014Display full size
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
吞吞完成签到 ,获得积分10
1秒前
2秒前
2秒前
3秒前
3秒前
陈一发布了新的文献求助20
3秒前
4秒前
4秒前
zzw发布了新的文献求助20
4秒前
4秒前
你为什么不学习完成签到 ,获得积分10
5秒前
zyt发布了新的文献求助10
5秒前
dawnshea应助CC采纳,获得10
5秒前
今后应助jason70采纳,获得10
5秒前
6秒前
111完成签到,获得积分20
7秒前
7秒前
7秒前
wangnn完成签到,获得积分10
7秒前
爱听歌的青筠完成签到,获得积分10
8秒前
量子星尘发布了新的文献求助10
8秒前
英姑应助哈哈采纳,获得10
8秒前
果粒橙应助marxing采纳,获得10
9秒前
9秒前
Tina完成签到,获得积分10
9秒前
聪明的哈密瓜完成签到,获得积分10
9秒前
格格发布了新的文献求助10
9秒前
清晨的小鹿应助mice33采纳,获得10
10秒前
10秒前
Enns完成签到 ,获得积分10
10秒前
lu发布了新的文献求助10
10秒前
宠仙发布了新的文献求助10
11秒前
小半完成签到 ,获得积分10
12秒前
李健的粉丝团团长应助sdl采纳,获得10
13秒前
13秒前
xiaoma完成签到,获得积分10
14秒前
XM完成签到,获得积分10
14秒前
LL发布了新的文献求助20
14秒前
14秒前
高分求助中
(禁止应助)【重要!!请各位详细阅读】【科研通的精品贴汇总】 10000
Functional High Entropy Alloys and Compounds 1000
Building Quantum Computers 1000
Apiaceae Himalayenses. 2 500
Molecular Cloning: A Laboratory Manual (Fourth Edition) 500
Social Epistemology: The Niches for Knowledge and Ignorance 500
优秀运动员运动寿命的人文社会学因素研究 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4239197
求助须知:如何正确求助?哪些是违规求助? 3772920
关于积分的说明 11848818
捐赠科研通 3428754
什么是DOI,文献DOI怎么找? 1881756
邀请新用户注册赠送积分活动 933920
科研通“疑难数据库(出版商)”最低求助积分说明 840611