On-Line Unsupervised Outlier Detection Using Finite Mixtures with Discounting Learning Algorithms

2004 ◽  
Vol 8 (3) ◽  
pp. 275-300 ◽  
Author(s):  
Kenji Yamanishi ◽  
Jun-ichi Takeuchi ◽  
Graham Williams ◽  
Peter Milne
2021 ◽  
Vol 15 (4) ◽  
pp. 1-20
Author(s):  
Georg Steinbuss ◽  
Klemens Böhm

Benchmarking unsupervised outlier detection is difficult. Outliers are rare, and existing benchmark data contains outliers with various and unknown characteristics. Fully synthetic data usually consists of outliers and regular instances with clear characteristics and thus allows for a more meaningful evaluation of detection methods in principle. Nonetheless, there have only been few attempts to include synthetic data in benchmarks for outlier detection. This might be due to the imprecise notion of outliers or to the difficulty to arrive at a good coverage of different domains with synthetic data. In this work, we propose a generic process for the generation of datasets for such benchmarking. The core idea is to reconstruct regular instances from existing real-world benchmark data while generating outliers so that they exhibit insightful characteristics. We propose and describe a generic process for the benchmarking of unsupervised outlier detection, as sketched so far. We then describe three instantiations of this generic process that generate outliers with specific characteristics, like local outliers. To validate our process, we perform a benchmark with state-of-the-art detection methods and carry out experiments to study the quality of data reconstructed in this way. Next to showcasing the workflow, this confirms the usefulness of our proposed process. In particular, our process yields regular instances close to the ones from real data. Summing up, we propose and validate a new and practical process for the benchmarking of unsupervised outlier detection.


1999 ◽  
Vol 10 (2) ◽  
pp. 253-271 ◽  
Author(s):  
P. Campolucci ◽  
A. Uncini ◽  
F. Piazza ◽  
B.D. Rao

2012 ◽  
Vol 468-471 ◽  
pp. 2504-2509
Author(s):  
Qiang Da Yang ◽  
Zhen Quan Liu

The on-line estimation of some key hard-to-measure process variables by using soft-sensor technique has received extensive concern in industrial production process. The precision of on-line estimation is closely related to the accuracy of soft-sensor model, while the accuracy of soft-sensor model depends strongly on the accuracy of modeling data. Aiming at the special character of the definition for outliers in soft-sensor modeling process, an outlier detection method based on k-nearest neighbor (k-NN) is proposed in this paper. The proposed method can be realized conveniently from data without priori knowledge and assumption of the process. The simulation result and practical application show that the proposed outlier detection method based on k-NN has good detection effect and high application value.


Author(s):  
Musa Mailah ◽  
Miaw Yong Ong

Kawalan jitu dan lasak bagi satu sistem lengan robot atau pengolah adalah amat penting terutama sekali jika sistem mengalami pelbagai bentuk bebanan dan keadaan pengendalian. Kertas kerja ini memaparkan satu kaedah baru dan lasak untuk mengawal lengan robot menggunakan teknik pembelajaran secara berlelaran yang dimuatkan dalam strategi kawalan daya aktif. Sebanyak dua algoritma pembelajaran utama digunakan dalam kajian – yang pertama digunakan untuk menala gandaan pengawal secara automatik manakala yang satu lagi pula untuk menganggarkan matriks inersia pengolah. Kedua-dua parameter ini dihasilkan secara adaptif dan dalam talian ketika robot sedang menjalankan tugas menjejak trajektori dalam persekitaran tindakan daya gangguan. Dalam kajian ini, pengetahuan awal tentang kedua–dua nilai gandaan pengawal dan anggaran matriks inersia tidak wujud. Dengan demikian, suatu skema kawalan yang jitu dan lasak terhasil. Keberkesanan kaedah yang dicadangkan dapat ditentusahkan melalui hasil kajian yang diperoleh dan dibentangkan dalam kertas kerja ini. Kata kunci: Adaptif; kawalan daya aktif; pembelajaran berlelaran; matriks inersia; gandaan pengawal The robust and accurate control of a robotic arm or manipulator are of prime importance especially if the system is subjected to varying forms of loading and operating conditions. The paper highlights a novel and robust method to control a robotic arm using an iterative learning technique embedded in an active force control strategy. Two main iterative learning algorithms are utilized in the study – the first is used to automatically tune the controller gains while the second to estimate the inertia matrix of the manipulator. These parameters are adaptively computed on-line while the robot is executing a trajectory tracking task and subject to some forms of external disturbances. No priori knowledge of both the controller gains and the estimated inertia matrix are ever assumed in the study. In this way, an adaptive and robust control scheme is derived. The effectiveness of the method is verified and can be seen from the results of the work presented in this paper. Keywords: Adaptive; active force control; iterative learning; inertia matrix; controller gain


Sign in / Sign up

Export Citation Format

Share Document