Outlier Detection with Double-Sided Control Mechanism and Different Priority Weight Values for Network Security
2013 Fourth World Congress on Software Engineering (2010)
Wuhan, Hubei China
Dec. 19, 2010 to Dec. 20, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WCSE.2010.142
A server needs strong security systems. For this goal, a new perspective to network security is won by using data mining paradigms like outlier detection, clustering and classification. This study uses K-Nearest Neighbor (KNN) algorithm for clustering and classification. KNN algorithm needs data warehouse which impersonates user profiles to cluster. Therefore, requested time intervals and requested IPs with text mining are used for user profiles. Users in the network are clustered by calculating optimum k and threshold parameters of KNN algorithm. Finally, over these clusters, new requests are separated as outlier or normal by different threshold values with different priority weight values and average similarities with different priority weight values.
Outlier detection, k-nearest neighbor clustering and classification, network security and similarity measurement
Yunus Dogan, Gökhan Dalkiliç, "Outlier Detection with Double-Sided Control Mechanism and Different Priority Weight Values for Network Security", 2013 Fourth World Congress on Software Engineering, vol. 02, no. , pp. 130-133, 2010, doi:10.1109/WCSE.2010.142