In order to improve the efficiency of phishing detection
a new algorithm was proposed to improve the traditional random forest algorithm. Potential association rules between web features are mined and used to partition the data set
in order to distinguish the features of different structures and calculate the weight of different data space to determine the scale of the selection. After selection of data
training data sets need to be aggregated and clipped to optimize the establishment of forests. Websites are trained and predicted using voting in decision forest. Experiments result shows that the new algorithm has obvious advantages in efficiency and effectiveness compared with the other two algorithm.
关键词
Keywords
references
BERGHOLZ A, CHANG J H, PAASS G. Improved Phishing detection using model-based features[C]. Proceedings of the Nonference on Email and Anti-span(CEAS), 2008.
HIPP J, G NAKHAEIZADEH. Algorithms for association rule mining - a general survey and comparison[J]. Acm Sigkdd Explorations Newsletter, 2000, 2 (1) :58-64. DOI: 58
VERIKAS A, GELZINIS A, BACAUSKIENE M. Mining data with randomforests: a survey and results of new tests[J]. Pattern Recognition, 2011, 44(2) : 330-349. DOI: 330
AMARATUNGA D, CABRERA J, LEE Y. Enriched random forests[J]. Bioinformatics, 2008, 24(18) : 2010-2014. DOI: 2010
ZHANG W W, GONG J, LIU Q, et al.Lightweight domain name detection algorithm based on morpheme features[J]. Ruan Jian XueBao/Journal of Software, 2016, 27(9):2348-2364. DOI: 2348
MOORTHY K, MOHAMAD M S. Random forest for gene selection and microarray data classification[J]. Springer Berlin Heidelberg, 2012, 7(3):142. DOI: 142