Wolf Search Algorithm for Numeric Association Rule Mining

被引:0
作者
Agbehadji, Israel Edem [1 ,2 ]
Fong, Simon [3 ]
Millham, Richard [1 ,2 ]
机构
[1] Durban Univ Technol, Dept Informat Technol, ICT, Durban, South Africa
[2] Durban Univ Technol, Dept Informat Technol, Soc Res Grp, Durban, South Africa
[3] Univ Macau, Dept Comp & Informat Sci, Taipa, Macau, Peoples R China
来源
PROCEEDINGS OF 2016 IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND BIG DATA ANALYSIS (ICCCBDA 2016) | 2016年
关键词
big data; wolf search algorithm; particle swarm optimization algorithm; numeric association rule mining;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Big data has become one of the key sources for valuable information and as information becomes larger it poses some computational challenge in finding a best possible solution for mining association rules and discovering patterns in data. Meta-heuristic algorithm when applied to mining association rules aims to find best possible rules from data without being stuck in local optimal. Example of metaheuristics algorithm includes genetic algorithm and particle swarm optimization algorithm. Finding appropriate representation of various types of patterns using rough numerical values attributes is still a challenge because most association rules cannot be applied to numerical data without discretization which may lead to information loss. Mining numeric association rules is a hard optimization problem rather than being a discretization, thus, this paper proposes a new meta-heuristic algorithm which uses wolf search algorithm (WSA) for numeric association rule mining from rough values within tolerable ranges.
引用
收藏
页码:146 / 151
页数:6
相关论文
共 25 条
[1]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2]  
Alatas B., 2008, ROUGH PARTICLE SWARM
[3]  
[Anonymous], 2006, ICDE '06
[4]  
[Anonymous], 1996, Mining sequential patterns: Generalizations and performance improvements, DOI [10.1007/BFb0014140, DOI 10.1145/235968.233311]
[5]  
[Anonymous], P IEEE C COMP VIS PA
[6]  
[Anonymous], 2013, BRIEF REV NATURE INS
[7]  
[Anonymous], 1997, ACM SIGMOD RECORD
[8]  
Aumann Y., 1999, KNOWLEDGE DISCOVERY, P261, DOI DOI 10.1145/312129.312243
[9]  
Banupriya S, 2015, INT J INNOVATIVE RES, V3
[10]  
Binitha S. S, 2012, SURVEY BIOINSPIRED O