Advancement Through Research
Detecting outliers in database (as unusual objects) using Minimum Spanning Tree is a big desire. It is an important task in wide variety of application areas. In this paper we propose a Minimum Spanning Tree based algorithm for detecting outliers. The outliers are detected from the data set based on degree number of an object (point) and distance between objects in the data set (MST).
Euclidean minimum spanning tree, Degree number, Outliers, nearest neighbor
