全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Campus-oriented stepwise-optimal hierarchical clustering algorithm of IP address
面向校园网的IP地址逐步优化层次聚类算法

Keywords: IP address clustering,nearest neighbor rule,Longest Prefix Match (LPM),stepwise-optimal hierarchical clustering
IP地址聚类
,最近邻规则,最长前缀匹配,逐步优化的层次聚类,校园网,优化层次,聚类算法,address,clustering,algorithm,聚类效果,实验,聚合,思想,层次聚类,运用,规则算法,最近邻,改进算法,最长前缀匹配,结果,特征属性,数字,用户行为特征,分布

Full-Text   Cite this paper   Add to My Lib

Abstract:

The cluster analysis of IP addresses can reveal useful knowledge for profiling of traffic flows and user behavior. However, the popular clustering algorithms were not applicable directly to IP addresses of the campus network traffic flows. The clusters which were generated by generic algorithms were inconsistent with the IP addresses partition and difficult to interpret. To overcome the shortcoming of the current algorithms which neglect the characteristics of IP addresses, a new algorithm which could effectively improve IP addresses clustering was proposed. Firstly, the initial clusters were got by adopting the longest prefix algorithm and the nearest neighbor clustering algorithm. Then the thought of stepwise-optimal hierarchical clustering was applied to merge the nearest groups of initial clusters. The similarity between initial clusters was determined by the longest prefix of IP addresses contained in these clusters. Finally, the algorithm automatically and meaningfully yielded clusters which were in accord with the characteristics of IP addresses on traffic flows. The results show that the proposed algorithm is accurate and effective in clustering IP addresses and robust to the input sequence of data.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133