Insider attack detection in database with deep metric neural network with Monte Carlo sampling
- Authors
- Go, Gwang-Myong; Bu, Seok-Jun; Cho, Sung-Bae
- Issue Date
- Dec-2022
- Publisher
- Oxford University Press
- Keywords
- Database management system; intrusion detection; Monte Carlo search; triplet network; metric learning; deep learning
- Citation
- Logic Journal of the IGPL, v.30, no.6, pp 979 - 992
- Pages
- 14
- Indexed
- SCIE
SCOPUS
- Journal Title
- Logic Journal of the IGPL
- Volume
- 30
- Number
- 6
- Start Page
- 979
- End Page
- 992
- URI
- https://scholarworks.gnu.ac.kr/handle/sw.gnu/73667
- DOI
- 10.1093/jigpal/jzac007
- ISSN
- 1367-0751
1368-9894
- Abstract
- Role-based database management systems are most widely used for information storage and analysis but are known as vulnerable to insider attacks. The core of intrusion detection lies in an adaptive system, where an insider attack can be judged if it is different from the predicted role by performing classification on the user's queries accessing the database and comparing it with the authorized role. In order to handle the high similarity of user queries for misclassified roles, this paper proposes a deep metric neural network with strategic sampling algorithm that properly extracts salient features and directly learns a quantitative measure of similarity. A strategic sampling method of heuristically generating and learning training pairs through Monte Carlo search is proposed to select a training pair that can represent the entire dataset. With the TPC-E-based benchmark data trained with 11,000 queries for 11 roles, the proposed model produces the classification accuracy of 95.41%, which is the highest compared with the previous models. The results are verified through comparison of quantitative and qualitative evaluations, and the feature space modelled in the neural network is analysed by t-SNE algorithm.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.