The ability to identify collusive malicious behavior is critical in today's security environment. We pose the general problem of Collusion Set Detection (CSD): identifying sets of behavior that together satisfy some notion of "interesting behavior". For this paper, we focus on a subset of the problem (called CSD′), by restricting our attention only to outliers. In the process of proposing the solution, we make the following novel research contributions: First, we propose a suitable distance metric, called the collusion distance metric, and formally prove that it indeed is a distance metric. We propose a collusion distance based outlier detection (CDB) algorithm that is capable of identifying the causal dimensions (n) responsible for the outlierness, and demonstrate that it improves both precision and recall, when compared to the Euclidean based outlier detection. Second, we propose a solution to the CSD′ problem, which relies on the semantic relationships among the causal dimensions. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Janeja, V. P., Atluri, V., Vaidya, J., & Adam, N. R. (2005). Collusion set detection through outlier discovery. In Lecture Notes in Computer Science (Vol. 3495, pp. 1–13). Springer Verlag. https://doi.org/10.1007/11427995_1
Mendeley helps you to discover research relevant for your work.