- Computing and Information Systems - Research Publications
Computing and Information Systems - Research Publications
Permanent URI for this collection
10 results
Filters
Reset filtersSettings
Statistics
Citations
Search Results
Now showing
1 - 10 of 10
-
ItemExploiting patterns to explain individual predictionsJia, Y ; Bailey, J ; Ramamohanarao, K ; Leckie, C ; Ma, X (Springer London, 2020-03)Users need to understand the predictions of a classifier, especially when decisions based on the predictions can have severe consequences. The explanation of a prediction reveals the reason why a classifier makes a certain prediction, and it helps users to accept or reject the prediction with greater confidence. This paper proposes an explanation method called Pattern Aided Local Explanation (PALEX) to provide instance-level explanations for any classifier. PALEX takes a classifier, a test instance and a frequent pattern set summarizing the training data of the classifier as inputs, and then outputs the supporting evidence that the classifier considers important for the prediction of the instance. To study the local behavior of a classifier in the vicinity of the test instance, PALEX uses the frequent pattern set from the training data as an extra input to guide generation of new synthetic samples in the vicinity of the test instance. Contrast patterns are also used in PALEX to identify locally discriminative features in the vicinity of a test instance. PALEX is particularly effective for scenarios where there exist multiple explanations. In our experiments, we compare PALEX to several state-of-the-art explanation methods over a range of benchmark datasets and find that it can identify explanations with both high precision and high recall.
-
ItemOn the effectiveness of isolation-based anomaly detection in cloud data centersCalheiros, RN ; Ramamohanarao, K ; Buyya, R ; Leckie, C ; Versteeg, S (WILEY, 2017-09-25)Summary The high volume of monitoring information generated by large‐scale cloud infrastructures poses a challenge to the capacity of cloud providers in detecting anomalies in the infrastructure. Traditional anomaly detection methods are resource‐intensive and computationally complex for training and/or detection, what is undesirable in very dynamic and large‐scale environment such as clouds. Isolation‐based methods have the advantage of low complexity for training and detection and are optimized for detecting failures. In this work, we explore the feasibility of Isolation Forest, an isolation‐based anomaly detection method, to detect anomalies in large‐scale cloud data centers. We propose a method to code time‐series information as extra attributes that enable temporal anomaly detection and establish its feasibility to adapt to seasonality and trends in the time‐series and to be applied online and in real‐time.
-
ItemDiscovering outlying aspects in large datasetsNguyen, XV ; Chan, J ; Romano, S ; Bailey, J ; Leckie, C ; Ramamohanarao, K ; Pei, J (SPRINGER, 2016-11)
-
ItemProtecting SIP Server from CPU-Based DoS Attacks using History-Based IP FilteringZhou, CV ; Leckie, C ; Ramamohanarao, K (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2009-10)
-
ItemSurvey of network-based defense mechanisms countering the DoS and DDoS problemsPeng, T ; Leckie, C ; Ramamohanarao, K (ASSOC COMPUTING MACHINERY, 2007-04)This article presents a survey of denial of service attacks and the methods that have been proposed for defense against these attacks. In this survey, we analyze the design decisions in the Internet that have created the potential for denial of service attacks. We review the state-of-art mechanisms for defending against denial of service attacks, compare the strengths and weaknesses of each proposal, and discuss potential countermeasures against each defense mechanism. We conclude by highlighting opportunities for an integrated solution to solve the problem of distributed denial of service attacks.
-
ItemInformation sharing for distributed intrusion detection systemsPeng, T ; Leckie, C ; Ramamohanarao, K (ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2007-08)
-
ItemSelective Sampling for Approximate Clustering of Very Large Data SetsWANG, L. ; BEZDEK, J. ; LECKIE, C. ; KOTAGIRI, R. ( 2008)
-
ItemApproximate clustering in very large relational dataBezdek, JC ; Hathaway, RJ ; Huband, JM ; Leckie, C ; Kotagiri, R (WILEY, 2006-08)
-
ItemEnhanced Visual Analysis for Cluster Tendency Assessment and Data PartitioningWang, L ; Geng, X ; Bezdek, J ; Leckie, C ; Ramamohanarao, K (IEEE COMPUTER SOC, 2010-10)
-
ItemAutomatically Determining the Number of Clusters in Unlabeled Data SetsWang, L ; Leckie, C ; Ramamohanarao, K ; Bezdek, J (Institute of Electrical and Electronics Engineers, 2009-03-01)One of the major problems in cluster analysis is the determination of the number of clusters in unlabeled data, which is a basic input for most clustering algorithms. In this paper, we investigate a new method called Dark Block Extraction (DBE) for automatically estimating the number of clusters in unlabeled data sets, which is based on an existing algorithm for Visual Assessment of Cluster Tendency (VAT) of a data set, using several common image and signal processing techniques. Its basic steps include 1) generating a VAT image of an input dissimilarity matrix, 2) performing image segmentation on the VAT image to obtain a binary image, followed by directional morphological filtering, 3) applying a distance transform to the filtered binary image and projecting the pixel values onto the main diagonal axis of the image to form a projection signal, and 4) smoothing the projection signal, computing its first-order derivative, and then detecting major peaks and valleys in the resulting signal to decide the number of clusters. Our DBE method is nearly “automatic,” depending on just one easy-to-set parameter. Several numerical and real-world examples are presented to illustrate the effectiveness of DBE.