Semi-supervised data organization for interactive anomaly analysis
Originally published in Proceedings of the 5th International Conference on Machine Learning and Applications, 2006.
We consider the problem of interactive iterative analysis of datasets that consist of a large number of records represented as feature vectors. The record set is known to contain a number of anomalous records that the analyst desires to locate and describe in a short and comprehensive manner. The nature of the anomaly is not known in advance (in particular, it is not known, which features or feature values identify the anomalous records, and which are irrelevant to the search), and becomes clear only in the process of analysis, as the description of the target subset is gradually refined. This situation is common in computer intrusion analysis, when a forensic analyst browses the logs to locate traces of an intrusion of unknown nature and origin, and extends to other tasks and data sets.
To facilitate such ”browsing for anomalies”, we propose an unsupervised data organization technique for initial summarization and representation of data sets, and a semi-supervised learning technique for iterative modifications of the latter representation. Our approach is based on information content and Jensen-Shannon divergence and is related to information bottleneck methods. We have implemented it as a part of the Kerf log analysis toolkit.
Javed Aslam, Sergey Bratus, and Virgil Pavlu. "Semi-supervised data organization for interactive anomaly analysis" Computer and Information Science Faculty Publications (2006).
Available at: http://works.bepress.com/jaslam/4