Tarique Anwar

Dr. Tarique Anwar

Department of Computing, Macquarie University, Rupnagar, Australia

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
4 June 2021 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
SGShreya Ghosh
Shreya Ghosh
TATarique Anwar
Tarique Anwar
Depression has become a big problem in our society today. It is also a major reason for suicide, especially among teenagers. In the current outbreak of coronavirus disease (COVID-19), the affected countries have recommended social distancing and lockdown measures. Resulting in interpersonal isolation, these measures have raised serious concerns for mental health and depression. Generally, clinical psychologists diagnose depressed people via face-to-face interviews following the clinical depression criteria. However, often patients tend to not consult doctors in their early stages of depression. Nowadays, people are increasingly using social media to express their moods. In this article, we aim to predict depressed users as well as estimate their depression intensity via leveraging social media (Twitter) data, in order to aid in raising an alarm. We model this problem as a supervised learning task. We start with weakly labeling the Twitter data in a self-supervised manner. A rich set of features, including emotional, topical, behavioral, user level, and depression-related n-gram features, are extracted to represent each user. Using these features, we train a small long short-term memory (LSTM) network using Swish as an activation function, to predict the depression intensities. We perform extensive experiments to demonstrate the efficacy of our method. We outperform the baseline models for depression intensity estimation by achieving the lowest mean squared error of 1.42 and also outperform the existing state-of-the-art binary classification method by more than 2% of accuracy. We found that the depressed users frequently use negative words such as stress and sad, mostly post during late nights, highly use personal pronouns and sometimes also share personal events.

1 May 2020 in Online Social Networks and Media
Verified
Journal Article
Closed access
SASyed Shafat Ali
Syed Shafat Ali
TATarique Anwar
Tarique Anwar
SRSyed Afzal Murtaza Rizvi
Syed Afzal Murtaza Rizvi

18 January 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
TATarique Anwar
Tarique Anwar
CLChengfei Liu
Chengfei Liu
Hai Le VuHai Le Vu
Hai Le Vu
Md. Saiful IslamMd. Saiful Islam
Md. Saiful Islam
TSTimos Sellis
Timos Sellis
The urban road networks undergo frequent traffic congestions during the peak hours and around the city centre. Capturing the spatiotemporal evolution of the congestion scenario in real-time in an urban-scale can aid in developing smart traffic management systems, and guiding commuters in making informed decision about route choice. The congestion scenario is often represented by a set of distinguishable network partitions that have homogeneous level of congestion inside them but are heterogeneous to others. Due to the dynamic nature of traffic, these partitions evolve with time in terms of their structure and location. In this paper, we propose a comprehensive framework to capture the evolution by incrementally updating the partitions in an efficient manner using a two-layer approach. The physical layer maintains a set of small-sized road network building blocks in a fine granularity, and performs low-level computations to incrementally update them, whereas the logical layer performs high-level computations in order to serve as an interface to query the physical layer about the congested partitions in a coarse granularity. We also propose an in-memory index called Bin that compactly stores the historical sets of building blocks in the main memory with no information loss, and facilitates their efficient retrieval. Our experimental results show that the proposed method is much efficient than the existing re-partitioning methods without significant sacrifice in accuracy. The proposed Bin consume a minimum space with least redundancy at different time stamps.

1 March 2017 in Information Systems
Verified
Journal Article
Open access
TATarique Anwar
Tarique Anwar
CLChengfei Liu
Chengfei Liu
Hai Le VuHai Le Vu
Hai Le Vu
CLChristopher Leckie
Christopher Leckie
Road traffic networks are rapidly growing in size with increasing complexities. To simplify their analysis in order to maintain smooth traffic, a large urban road network can be considered as a set of small sub-networks, which exhibit distinctive traffic flow patterns. In this paper, we propose a robust framework for spatial partitioning of large urban road networks based on traffic measures. For a given urban road network, we aim to identify the different sub-networks or partitions that exhibit homogeneous traffic patterns internally, but heterogeneous patterns to others externally. To this end, we develop a two-stage algorithm (referred as FaDSPa) within our framework. It first transforms the large road graph into a well-structured and condensed density peak graph (DPG) via density based clustering and link aggregation using traffic density and adjacency connectivity, respectively. Thereafter we apply our spectral theory based graph cut (referred as α-Cut) to partition the DPG and obtain the different sub-networks. Thus the framework applies the locally distributed computations of density based clustering to improve efficiency and the centralized global computations of spectral clustering to improve accuracy. We perform extensive experiments on real as well as synthetic datasets, and compare its performance with that of an existing road network partitioning method. Our results show that the proposed method outperforms the existing normalized cut based method for small road networks and provides impressive results for much larger networks, where other methods may face serious problems of time and space complexities. HighlightsAn effective as well as efficient road network partitioning framework using both density and spectral based clustering.A fast density-based road network partitioning method FaDPa (extended to FaDPa+) is developed.Using FaDPa, a spectral based method FaDSPa is developed for partitioning small as well as large road networks.The complete derivation to optimize the α -Cut objective function (proposed in Anwar et al., EDBT 2014) is presented.Extensive experiments are conducted on real as well as synthetic datasets.

19 January 2023 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
AKAshraf Kamal
Ashraf Kamal
TATarique Anwar
Tarique Anwar
VSVineet Kumar Sejwal
Vineet Kumar Sejwal
MFMohd Fazil
Mohd Fazil
Online social media (OSM) communications sometimes turn into hate-filled and offensive comments or arguments. It not just disrupts the social fabric online, but also leads to hate, violence, and crime, in the real physical world in worst scenarios. The existing content moderation practices of OSM platforms often fail to control the online hate. In this article, we develop a deep learning model called BiCapsHate to detect hate speech (HS) in OSM posts. The model consists of five layers of deep neural networks. It starts with an input layer to process the input text and follows on to an embedding layer to embed the text into a numeric representation. A BiCaps layer then learns the sequential and linguistic contextual representations, a dense layer prepares the model for final classification, and lastly the output layer produces the resulting class as either hate or non-HS (NHS). The BiCaps layer, being the most important component, effectively learns the contextual information with respect to different orientations in both forward and backward directions of the input text via capsule networks. It is further aided by our rich set of hand-crafted shallow and deep auxiliary features including the Hatebase lexicon, making the model well-informed . We conduct extensive experiments on five benchmark datasets to demonstrate the efficacy of the proposed BiCapsHate model. In the overall results, we outperform the existing state-of-the-art methods including fBERT, HateBERT, and ToxicBERT. BiCapsHate achieves up to 94% and 92% f-score on balanced and imbalanced datasets, respectively. Our complete source code is publicly available at GitHub repository https://github.com/Ashraf-Kamal/BiCapsHate.

1 December 2014 in Digital Investigation
Verified
Journal Article
Closed access
TATarique Anwar
Tarique Anwar
MAMuhammad Abulaish
Muhammad Abulaish