Zahra Ghafoori

Zahra Ghafoori


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 January 2018 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZGZahra Ghafoori
Zahra Ghafoori
SESarah M. Erfani
Sarah M. Erfani
SRSutharshan Rajasegarar
Sutharshan Rajasegarar
JBJames C. Bezdek
James C. Bezdek
SKShanika Karunasekera
Shanika Karunasekera
CLChristopher Leckie
Christopher Leckie
One-class support vector machines (OCSVMs) are very effective for semisupervised anomaly detection. However, their performance strongly depends on the settings of their hyperparameters, which has not been well studied. Moreover, unavailability of a clean training set that only comprises normal data in many real-life problems has given rise to the application of OCSVMs in an unsupervised manner. However, it has been shown that if the training set includes anomalies, the normal boundary created by OCSVMs is prone to skew toward the anomalies. This problem decreases the detection rate of anomalies and results in poor performance of the classifier. In this paper, we propose a new technique to set the hyperparameters and clean suspected anomalies from unlabelled training sets. The proposed method removes suspected anomalies based on a $K$ -nearest neighbors technique, which is then used to directly estimate the hyperparameters. We examine several benchmark data sets with diverse distributions and dimensionality. Our findings suggest that on the examined data sets, the proposed technique is roughly 70 times faster than supervised parameter estimation via grid-search and cross validation, and one to three orders of magnitude faster than broadly used semisupervised and unsupervised parameter estimation methods for OCSVMs. Moreover, our method statistically outperforms those semisupervised and unsupervised methods and its accuracy is comparable to supervised grid-search and cross validation.

14 August 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
ZGZahra Ghafoori
Zahra Ghafoori
SESarah M. Erfani
Sarah M. Erfani
JBJames C. Bezdek
James C. Bezdek
SKShanika Karunasekera
Shanika Karunasekera
CLChristopher Leckie
Christopher Leckie
We present a new unsupervised dimensionality reduction technique, called LN-SNE, for anomaly detection. LN-SNE generates a parametric embedding by means of Restricted Boltzmann Machines and uses a heavy-tail distribution to project data to a lower dimensional space such that dissimilarities between normal data and anomalies are preserved or strengthened. We compare LN-SNE to several benchmark dimensionality reduction methods on real datasets. The results suggest that LN-SNE for anomaly detection is less sensitive to the dimension of the latent space than the other methods and outperforms them in terms of accuracy. We empirically show that our technique scales near-linearly with respect to the number of dimensions and data size.

30 April 2020
Verified
Book Chapter
Closed access
PDF file
ZGZahra Ghafoori
Zahra Ghafoori
JBJames C. Bezdek
James C. Bezdek
CLChristopher Leckie
Christopher Leckie
SKShanika Karunasekera
Shanika Karunasekera