You are here
SCALABLE AND EFFICIENT OUTLIER DETECTION IN LARGE DISTRIBUTED DATA SETS WITH MIXED-TYPE ATTRIBUTES
| Title: | SCALABLE AND EFFICIENT OUTLIER DETECTION IN LARGE DISTRIBUTED DATA SETS WITH MIXED-TYPE ATTRIBUTES. |
 41 views 23 downloads |
|---|---|---|
| Name(s): |
Koufakou, Anna, Author Georgiopoulos, Michael, Committee Chair University of Central Florida, Degree Grantor |
|
| Type of Resource: | text | |
| Date Issued: | 2009 | |
| Publisher: | University of Central Florida | |
| Language(s): | English | |
| Abstract/Description: | An important problem that appears often when analyzing data involves identifying irregular or abnormal data points called outliers. This problem broadly arises under two scenarios: when outliers are to be removed from the data before analysis, and when useful information or knowledge can be extracted by the outliers themselves. Outlier Detection in the context of the second scenario is a research field that has attracted significant attention in a broad range of useful applications. For example, in credit card transaction data, outliers might indicate potential fraud; in network traffic data, outliers might represent potential intrusion attempts. The basis of deciding if a data point is an outlier is often some measure or notion of dissimilarity between the data point under consideration and the rest. Traditional outlier detection methods assume numerical or ordinal data, and compute pair-wise distances between data points. However, the notion of distance or similarity for categorical data is more difficult to define. Moreover, the size of currently available data sets dictates the need for fast and scalable outlier detection methods, thus precluding distance computations. Additionally, these methods must be applicable to data which might be distributed among different locations. In this work, we propose novel strategies to efficiently deal with large distributed data containing mixed-type attributes. Specifically, we first propose a fast and scalable algorithm for categorical data (AVF), and its parallel version based on MapReduce (MR-AVF). We extend AVF and introduce a fast outlier detection algorithm for large distributed data with mixed-type attributes (ODMAD). Finally, we modify ODMAD in order to deal with very high-dimensional categorical data. Experiments with large real-world and synthetic data show that the proposed methods exhibit large performance gains and high scalability compared to the state-of-the-art, while achieving similar accuracy detection rates. | |
| Identifier: | CFE0002734 (IID), ucf:48161 (fedora) | |
| Note(s): |
2009-08-01 Ph.D. Engineering and Computer Science, School of Electrical Engineering and Computer Science Doctorate This record was generated from author submitted information. |
|
| Subject(s): |
Data Mining Outlier Detection Anomaly Detection Distributed Datasets Categorical Datasets Mixed-Type Attribute Datasets |
|
| Persistent Link to This Record: | http://purl.flvc.org/ucf/fd/CFE0002734 | |
| Restrictions on Access: | public | |
| Host Institution: | UCF |
