An application which operates on an imbalanced dataset loses its classification performance on a minority class, which is rare and important. There are a number of over-sampling techniques, which insert minority instances into a dataset, to adjust the class distribution. Unfortunately, these instances highly affect the computation of generating a classifier. In this paper, a new simple and effective under-sampling called MUTE is proposed. Its strategy is to get rid of noise majority instances which over-lap with minority instances. The removal majority instances are considered based on their safe levels relying on the Safe-Level-SMOTE concept. MUTE not only reduces the classifier construction time because of a downsizing dataset but also improves the prediction rate on a minority class. The experimental results show that MUTE improves F-measure by comparing to SMOTE techniques.
Outlier Detection is one of the most important topics in data mining and knowledge discovery in databases. It is to find a methodology to detect instances in a dataset that do not conform to the rest of the dataset. Local Outlier Factor is one of the earlier outlier detection score. In this paper, we propose a new approach for parameter-free outlier detection algorithm to compute Ordered Distance Difference Outlier Factor. We formulate a new outlier score for each instance by considering the difference of ordered distances. Then, we use this value to compute an outlier score. We use a score of each instance to provide a degree of outlier and compare it with LOF. Our algorithm can produce OOF in Θ (n 2 ) without parameter.