TY - GEN
T1 - Discovering outlier filtering rules from unlabeled data
AU - Yamanishi, Kenji
AU - Takeuchi, Jun Ichi
PY - 2001
Y1 - 2001
N2 - This paper is concerned with the problem of detecting outliers from unlabeled data. In prior work we have developed SmartSifter, which is an on-line outlier detection algorithm based on unsupervised learning from data. On the basis of SmartSifter this paper yields a new framework for outlier filtering using both supervised and unsupervised learning techniques iteratively in order to make the detection process more effective and more understandable. The outline of the framework is as follows: In the first round, for an initial dataset, we run SmartSifter to give each data a score, with a high score indicating a high possibility of being an outlier. Next, giving positive labels to a number of higher scored data and negative labels to a number of lower scored data, we create labeled examples. Then we construct an outlier filtering rule by supervised learning from them. Here the rule is generated based on the principle of minimizing extended stochastic complexity. In the second round, for a new dataset, we filter the data using the constructed rule, then among the filtered data, we run SmartSifter again to evaluate the data in order to update the filtering rule. Applying of our framework to the network intrusion detection, we demonstrate that 1) it can significantly improve the accuracy of SmartSifter, and 2) outlier filtering rules can help the user to discover a general pattern of an outlier group.
AB - This paper is concerned with the problem of detecting outliers from unlabeled data. In prior work we have developed SmartSifter, which is an on-line outlier detection algorithm based on unsupervised learning from data. On the basis of SmartSifter this paper yields a new framework for outlier filtering using both supervised and unsupervised learning techniques iteratively in order to make the detection process more effective and more understandable. The outline of the framework is as follows: In the first round, for an initial dataset, we run SmartSifter to give each data a score, with a high score indicating a high possibility of being an outlier. Next, giving positive labels to a number of higher scored data and negative labels to a number of lower scored data, we create labeled examples. Then we construct an outlier filtering rule by supervised learning from them. Here the rule is generated based on the principle of minimizing extended stochastic complexity. In the second round, for a new dataset, we filter the data using the constructed rule, then among the filtered data, we run SmartSifter again to evaluate the data in order to update the filtering rule. Applying of our framework to the network intrusion detection, we demonstrate that 1) it can significantly improve the accuracy of SmartSifter, and 2) outlier filtering rules can help the user to discover a general pattern of an outlier group.
UR - http://www.scopus.com/inward/record.url?scp=0035788911&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035788911&partnerID=8YFLogxK
U2 - 10.1145/502512.502570
DO - 10.1145/502512.502570
M3 - Conference contribution
AN - SCOPUS:0035788911
SN - 158113391X
SN - 9781581133912
T3 - Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
SP - 389
EP - 394
BT - Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
A2 - Provost, F.
A2 - Srikant, R.
A2 - Schkolnick, M.
A2 - Lee, D.
PB - Association for Computing Machinery (ACM)
T2 - Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2001)
Y2 - 26 August 2001 through 29 August 2001
ER -