A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This paper summarizes a new algorithm for clustering IP addresses. Unlike popular clustering algorithms such as k-means and DBSCAN, this algorithm is designed specifically for IP addresses. In particular, the algorithm employs the longest prefix match as a similarity metric and uses an adaptation of the nearest neighbor algorithm for search to yield meaningful clusters. The algorithm is automatic in that it does not require any input parameters. When applied to a large IP address dataset, thedoi:10.1007/978-3-540-28633-2_116 fatcat:ax3ehvq33bcafgthndwvfrpmey