Random Forest Bagging and X-Means Clustered Antipattern Detection from SQL Query Log for Accessing Secure Mobile Data
| Autor: | Mounir Hamdi, V. Vijayakumar, Ketan Kotecha, M. Poongodi, Rajesh Kumar Dhanaraj, Vinothsaravanan Ramakrishnan, Lalitha Krishnasamy |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Technology
SQL Article Subject Computer Networks and Communications Computer science TK5101-6720 Similarity measure computer.software_genre Random forest Similarity (network science) Bayesian information criterion Telecommunication Data mining False positive rate Electrical and Electronic Engineering Cluster analysis Time complexity computer Information Systems computer.programming_language |
| Zdroj: | Wireless Communications and Mobile Computing, Vol 2021 (2021) |
| ISSN: | 1530-8677 1530-8669 |
| Popis: | In the current ongoing crisis, people mostly rely on mobile phones for all the activities, but query analysis and mobile data security are major issues. Several research works have been made on efficient detection of antipatterns for minimizing the complexity of query analysis. However, more focus needs to be given to the accuracy aspect. In addition, for grouping similar antipatterns, a clustering process was performed to eradicate the design errors. To address the above-said issues and further enhance the antipattern detection accuracy with minimum time and false positive rate, in this work, Random Forest Bagging X-means SQL Query Clustering (RFBXSQLQC) technique is proposed. Different patterns or queries are initially gathered from the input SQL query log, and bootstrap samples are created. Then, for each pattern, various weak clusters are constructed via X-means clustering and are utilized as the weak learner (clusters). During this process, the input patterns are categorized into different clusters. Using the Bayesian information criterion, the similarity measure is employed to evaluate the similarity between the patterns and cluster weight. Based on the similarity value, patterns are assigned to either relevant or irrelevant groups. The weak learner results are aggregated to form strong clusters, and, with the aid of voting, a majority vote is considered for designing strong clusters with minimum time. Experiments are conducted to evaluate the performance of the RFBXSQLQC technique using the IIT Bombay dataset using the metrics like antipattern detection accuracy, time complexity, false-positive rate, and computational overhead with respect to the differing number of queries. The results revealed that the RFBXSQLQC technique outperforms the existing algorithms by 19% with pattern detection accuracy, 34% minimized time complexity, 64% false-positive rate, and 31% in terms of computational overhead. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text