Shariq Bashir

Dr. Shariq Bashir


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
7 February 2022 in IEEE Access
Verified
Journal Article
Open access
SBShariq Bashir
Shariq Bashir
DLDaphne Teck Ching Lai
Daphne Teck Ching Lai
OMOwais Ahmed Malik
Owais Ahmed Malik
Search engines store users’ queries in a query log for performing personalized information retrieval. However, query logs cause privacy concerns and reveal a lot of information about individuals if used against them. Private web search (PWS) provides a privacy-preserving information retrieval (IR) facility which allows users to retrieve information from an IR system without revealing true search queries. Current PWS techniques that are explored in the domain of web search are query obfuscation-based private web search (OB-PWS). These techniques achieve web privacy by injecting cover queries into the user profiles. However, existing OB-PWS techniques submit true queries along with cover queries and achieve query obfuscation in an isolated manner without considering the similarity between consecutive queries. In this article, we propose a proxy-terms based query obfuscation technique that allows users to retrieve information from an IR system through proxy queries without submitting true queries. IR system automatically generates cover queries and true queries from the proxy queries and cannot differentiate whether the user is trying to retrieve information for the cover queries or true query. We analyzed the effectiveness of the proposed technique on test queries, and develop a similarity metric for testing the accuracy of the proposed technique. Promising results of experiments confirm the effectiveness of the proposed technique.

9 January 2023 in IEEE Access
Verified
Journal Article
Open access
SBShariq Bashir
Shariq Bashir
AKAkmal Saeed Khattak
Akmal Saeed Khattak
People use web search engines to retrieve information from the world wide web. Search engines maintain query logs to refine retrieved information for personalized web search. The query log includes information of users, both sensitive and non-sensitive. If utilized against an individual, the query log may pose privacy concerns and reveal a lot of information about them. In recent years many private web search (PWS) schemes have been proposed to realize privacy-preserving web search. Although each PWS scheme claims to have unique features for attaining web search privacy (WSP), no study explains which private web search characteristics should be considered when building and utilizing a PWS scheme. There are two objectives of this article. In the first part of the article, we present a novel PWS scheme that uses a proxy-query-based query obfuscation approach. Proxy-query-based query obfuscation is a new study topic in PWS research. It provides an IR facility for retrieving information from web search engines via proxy queries. One clear advantage of the proposed scheme is that users do not issue true queries to search engines for retrieving information. The article’s second objective is to define the characteristics of PWS and analyze modern PWS schemes on these characteristics. We analyzed proposed and modern PWS schemes on the PWS characteristics. The analysis demonstrated only the proposed PWS scheme achieves all characteristics. Existing PWS systems have been discovered vulnerable to WSP attacks since they do not meet all PWS characteristics.

1 February 2023 in IEEE Access
Verified
Journal Article
Open access
SBShariq Bashir
Shariq Bashir
This work studies the automatic classification of water consumption patterns and electrical devices, both supervised and unsupervised. The classification study intends to investigate consumption patterns that appear normal and abnormal. We performed an unsupervised classification of consumer water patterns in direct and indirect ways. The first is to use the raw consumption patterns obtained from the server. The second one corresponds to the use of the sampled consumption patterns. This classification is performed using hierarchical bottom-up classification and self-organizing map. A probabilistic analysis of daily water consumption is performed to extract the percentage of daily consumption with the most information. It enables us to identify water consumption patterns more quickly by reducing the number of data points for each daily pattern, allowing us to recognize and classify anomalous behaviors as soon as feasible. Then, the signatures of electrical devices are classified using three ML algorithms: multilayer perceptron (MLP), k nearest neighbor (KNN), and decision tree (DT). Furthermore, assembly approaches are also studied. These are based on the OAA (One Against All) principle, which presents one class against all other classes, and the ECOC (Error-Correcting Output Codes) philosophy, which allows the classification error to be corrected. According to the bias/variance trade-off, both techniques enhanced classification by ensuring accuracy and generalization. A more in-depth analysis of the properties of the electrical devices is handled with an esemplastic approach based on gradient-boosting decision trees. The features of electrical devices can be extracted using this analysis based on the nature of their harmonic signatures.

1 March 2008
Verified
Conference Paper
Closed access
SBShariq Bashir
Shariq Bashir
ZHZahid Halim
Zahid Halim
Abdul Rauf BaigAbdul Rauf Baig
Abdul Rauf Baig
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration and support counting of candidate FT-patterns. Previous studies on mining FT frequent patterns adopt Apriori-like candidate set generation- and-test approach, in which a number of dataset scans are needed to declare a candidate FT-pattern frequent. First for checking its FT-pattern support, and then for checking its individual items support present in its FT- pattern which depends on the cardinality of pattern. Inspired from the pattern growth technique for mining frequent itemsets, in this paper we present a novel algorithm for mining FT frequent patterns using pattern growth approach. Our algorithm stores the original transactional dataset in a highly condensed, much smaller data structure called FT-FP-tree, and the FT-pattern support and item support of all the FT- patterns are counting directly from the FT-FP-tree, without scanning the original dataset multiple times. While costly candidate set generations are avoided by generating conditional patterns from FT-FP-tree. Our extensive experiments on benchmark datasets suggest that, mining FT frequent patterns using our algorithm is highly efficient as compared to Apriori-like approach.

1 January 2022 in Computers, Materials & Continua
Verified
Journal Article
Open access
SBShariq Bashir
Shariq Bashir
OMOwais Ahmed Malik
Owais Ahmed Malik
DLDaphne Teck Ching Lai
Daphne Teck Ching Lai
Traditional wireless sensor networks (WSNs) are not suitable for rough terrains that are difficult or impossible to access by humans. Smart dust is a technology that works with the combination of many tiny sensors which is highly useful for obtaining remote sensing information from rough terrains. The tiny sensors are sprinkled in large numbers on rough terrains using airborne distribution through drones or aircraft without manually setting their locations. Although it is clear that a number of remote sensing applications can benefit from this technology, but the small size of smart dust fundamentally restricts the integration of advanced hardware on tiny sensors. This raises many challenges including how to estimate the location of events sensed by the smart dusts. Existing solutions on estimating the location of events sensed by the smart dusts are not suitable for monitoring rough terrains as these solutions depend on relay sensors and laser patterns which have their own limitations in terms of power constraint and uneven surfaces. The study proposes a novel machine learning based localization algorithm for estimating the location of events. The approach utilizes timestamps (time of arrival) of sensed events received at base stations by assembling them into a multi-dimensional vector and input to a machine learning classifier for estimating the location. Due to the unavailability of real smart dusts, we built a simulator for analysing the accuracy of the proposed approach for monitoring forest fire. The experiments on the simulator show reasonable accuracy of the approach.

6 March 2023 in Research Square
Verified
Preprint
Open access
PDF file
SBShariq Bashir
Shariq Bashir
HRHanif Abdul Rahman
Hanif Abdul Rahman
Computer programmers frequently use code retrieval systems to reuse existing code snippets from open-source repositories. These systems search a large collection of code snippets to retrieve the most relevant ones based on a text query. However, capturing semantic information between user queries and code snippets presents a key challenge in this task. Previous works have primarily used natural language processing (NLP) approaches to calculate relevance, but these approaches cannot capture deep structural and semantic dependencies between queries and snippets. In this study, we proposed a novel approach called Deep Graph-Based Semantic Representation and Matching (DeepGSR) for code retrieval. Our approach transforms queries and code snippets into a unified graph-structure representation and then retrieves relevant code snippets using a novel graph matching and retrieval approach. DeepGSR learns fine-grained relevance between queries and code snippets using cross-attention-based semantic matching operators, in addition to extracting structural information. We evaluated our approach using two publicly available code retrieval datasets, and the experiments demonstrate that DeepGSR efficiently retrieves relevant code snippets for a given query and significantly outperforms existing code retrieval approaches.