Identification of fake news : a semantic driven technique for transfer domain
- Authors: Ferdush, Jannatul , Kamruzzaman, Joarder , Karmakar, Gour , Gondal, Iqbal , Das, Raj
- Date: 2023
- Type: Text , Conference paper
- Relation: 29th International Conference on Neural Information Processing, ICONIP 2022, Virtual, online, 22-26 November 2022, Communications in Computer and Information Science Vol. 1793 CCIS, p. 564-575
- Full Text: false
- Reviewed:
- Description: Fake news spreads quickly on online social media and adversely impacts political, social, religious, and economic stability. This necessitates an efficient fake news detector which is now feasible due to advances in natural language processing and artificial intelligence. However, existing fake news detection (FND) systems are built on tokenization, embedding, and structure-based feature extraction, and fail drastically in real life because of the difference in vocabulary and its distribution across various domains. This article evaluates the effectiveness of various categories of traditional features in cross-domain FND and proposes a new method. Our proposed method shows significant improvement over recent methods in the literature for cross-domain fake news detection in terms of widely used performance metrics. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
Decentralized content sharing among tourists in visiting hotspots
- Authors: Kaisar, Shahriar , Kamruzzaman, Joarder , Karmakar, Gour , Gondal, Iqbal
- Date: 2017
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 79, no. (2017), p. 25-40
- Full Text:
- Reviewed:
- Description: Content sharing with smart mobile devices using decentralized approach enables users to share contents without the use of any fixed infrastructure, and thereby offers a free-of-cost platform that does not add to Internet traffic which, in its current state, is approaching bottleneck in its capacity. Most of the existing decentralized approaches in the literature consider spatio-temporal regularity in human movement patterns and pre-existing social relationship for the sharing scheme to work. However, such predictable movement patterns and social relationship information are not available in places like tourist spots where people visit only for a short period of time and usually meet strangers. No works exist in literature that deals with content sharing in such environment. In this work, we propose a content sharing approach for such environments. The group formation mechanism is based on users' interest score and stay probability in the individual region of interest (ROI) as well as on the availability and delivery probabilities of contents in the group. The administrator of each group is selected by taking into account its probability of stay in the ROI, connectivity with other nodes, its trustworthiness and computing and energy resources to serve the group. We have also adopted an incentive mechanism as encouragement that awards nodes for sharing and forwarding contents. We have used network simulator NS3 to perform extensive simulation on a popular tourist spot in Australia which facilitates a number of activities. The proposed approach shows promising results in sharing contents among tourists, measured in terms of content hit, delivery success rate and latency.
- Description: Content sharing with smart mobile devices using decentralized approach enables users to share contents without the use of any fixed infrastructure, and thereby offers a free-of-cost platform that does not add to Internet traffic which, in its current state, is approaching bottleneck in its capacity. Most of the existing decentralized approaches in the literature consider spatio-temporal regularity in human movement patterns and pre-existing social relationship for the sharing scheme to work. However, such predictable movement patterns and social relationship information are not available in places like tourist spots where people visit only for a short period of time and usually meet strangers. No works exist in literature that deals with content sharing in such environment. In this work, we propose a content sharing approach for such environments. The group formation mechanism is based on users' interest score and stay probability in the individual region of interest (ROI) as well as on the availability and delivery probabilities of contents in the group. The administrator of each group is selected by taking into account its probability of stay in the ROI, connectivity with other nodes, its trustworthiness and computing and energy resources to serve the group. We have also adopted an incentive mechanism as encouragement that awards nodes for sharing and forwarding contents. We have used network simulator NS3 to perform extensive simulation on a popular tourist spot in Australia which facilitates a number of activities. The proposed approach shows promising results in sharing contents among tourists, measured in terms of content hit, delivery success rate and latency. © 2016
Carry me if you can : A utility based forwarding scheme for content sharing in tourist destinations
- Authors: Kaisar, Shahriar , Kamruzzaman, Joarder , Karmakar, Gour , Gondal, Iqbal
- Date: 2016
- Type: Text , Conference proceedings
- Relation: 22nd Asia-Pacific Conference on Communications, APCC 2016; Yogyakarta, Indonesia; 25th-27th August 2016 p. 261-267
- Full Text:
- Reviewed:
- Description: Message forwarding is an integral part of the decentralized content sharing process as the content delivery success highly depends on it. Existing literature employs spatio-temporal regularity of human movement pattern and pre-existing social relationship to take message forwarding decisions. However, such approaches are ineffectual in environments where those information are unavailable such as a tourist spot or camping site. In this study, we explore the message forwarding techniques in such environments considering the information that are readily available and can be gathered on the fly. We propose a utility based forwarding scheme to select the appropriate forwarder node based on co-location stay time, connectivity and available resources. A higher co-location stay time reflects that the forwarder and the destination node is likely to have more opportunistic contacts, while the connectivity and available resource ensure that the selected forwarder has sufficient neighbours and resources to carry the message forward. Simulation results suggest that the proposed approach attains high hit and success rate and low latency for successful content delivery, which is comparable to those proposed for work-place type scenarios with regular movement pattern and pre-existing relationships. © 2016 IEEE.
Content exchange among mobile tourists using users' interest and place-centric activities
- Authors: Kaisar, Shahriar , Kamruzzaman, Joarder , Karmakar, Gour , Gondal, Iqbal
- Date: 2015
- Type: Text , Conference paper
- Relation: 2015 10th International Conference on Information, Communications and Signal Processing (Icics); Singapore, Singapore; 2nd-4th December 2015 p. 1-5
- Full Text: false
- Reviewed:
- Description: In this work we investigate decentralized content exchange among tourists who are mostly strangers, depicts irregular movement patterns and most likely not to have any prior social relationship or difficult to establish any in a tourist spot. We incorporate user's interest, trustworthy online recommendations, and place-centric information to facilitate content exchange in such tourist destinations. The proposed administrator selection policy considers stay probability in activities, connectivity among nodes and their available resources. We have done extensive simulation using network simulator NS3 on a popular tourist spot in Australia that provides a number of activities. Our proposed approach shows promising results in exchanging contents among users measured in terms of content hit and delivery success rate as well as latency. The success rate is comparable to those reported in the literature for cases where social relationship exist and nodes follow regular predictable movement patterns.
Content sharing among visitors with irregular movement patterns in visiting hotspots
- Authors: Kaisar, Shahriar , Kamruzzaman, Joarder , Karmakar, Gour , Gondal, Iqbal
- Date: 2015
- Type: Text , Conference paper
- Relation: 2015 IEEE 14th International Symposium on Network Computing and Applications (NCA); Cambridge, United States; 28th - 30th September 2015; published in Proceedings - 2015 IEEE 14th International Symposium on Network Computing and Applications, NCA 2015 p. 230-234
- Full Text: false
- Reviewed:
- Description: Smart mobile devices have become immensely popular among the people worldwide and provide a new platform for generating and sharing contents. The centralized and hybrid architectures for content sharing require constant Internet connection, increase traffic and incur costs. To address these issues several content sharing approaches have been proposed using the decentralized architecture. Most of the proposed approaches use spatio-temporal regularity and pre-existing social relationships of the users to predict their movements and facilitate content sharing. However, there are scenarios such as visiting hotspots where regular movement patterns or established social relationships among people might not exist. Content sharing in such scenarios has not been addressed yet in literature and existing prediction based approaches are ineffectual. This study focuses on facilitating content sharing in the afore-mentioned scenarios. We take account of user interests, recommendations from on-line social networks, hotspot specific activities and other relevant information to construct communities which facilitate content sharing. For each community an administrator, who maintains content and member lists and render directory services, is selected based on stay probability, interest score, battery lifetime and device configuration. Simulation results show that our proposed approach attains high content hit and success rate and low latency in delivery which is nearly comparable to those proposed for scenarios with regular predictable movement patterns reported in literature.
Dynamic content distribution for decentralized sharing in tourist spots using demand and supply
- Authors: Kamruzzaman, Joarder , Karmakar, Gour , Gondal, Iqbal , Kaisar, Shahriar
- Date: 2017
- Type: Text , Conference proceedings
- Relation: 13th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2017; Valencia, Spain; 26th-30th June 2016 p. 2121-2126
- Full Text: false
- Reviewed:
- Description: Decentralized content sharing (DCS) is emerging as an important platform for sharing contents among smart mobile device users, where devices form an ad-hoc network and communicate opportunistically. Existing DCS approaches for tourist spot like scenarios achieve low delivery success rate and high latency as they do not focus on dynamic demand for contents which usually vary considerably with the number of visitors present or occurrence of some influencing events. The amount of available supply also changes because of the nodes leaving the area. Only way to improve content delivery service is to distribute the contents in strategic positions based on dynamic demand and supply. In this paper, we propose a dynamic content distribution (DCD) method considering dynamic demand and supply for contents in tourist spots. Simulation results validate the improvement of the proposed approach. © 2017 IEEE.
- Description: 2017 13th International Wireless Communications and Mobile Computing Conference, IWCMC 2017
A smart priority-based traffic control system for emergency vehicles
- Authors: Karmakar, Gour , Chowdhury, Abdullahi , Kamruzzaman, Joarder , Gondal, Iqbal
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Sensors Journal Vol. 21, no. 14 (2021), p. 15849-15858
- Full Text: false
- Reviewed:
- Description: Unwanted events on roads, such as incidents and increased traffic jams, can cause human lives and economic loss. For efficient incident management, it is essential to send Emergency Vehicles (EVs) to the incident place as quickly as possible. To reduce incidence clearance time, several approaches exist to provide a clear pathway to EVs mainly fitted with RFID sensors in the urban areas. However, they neither assign priority to the EVs based on the type and severity of an incident nor consider the effect on other on-road traffic. To address this issue, in this paper, we introduce an Emergency Vehicle Priority System (EVPS) by determining the priority level of an EV based on the type and the severity of an incident, and estimating the number of necessary signal interventions while considering the impact of those interventions on the traffic in the roads surrounding the EV's travel path. We present how EVPS determines the priority code and a new algorithm to estimate the number of green signal interventions to attain the quickest incident response while concomitantly reducing impact on others. A simulation model is developed in Simulation of Urban Mobility (SUMO) using the real traffic data of Melbourne, Australia, captured by various sensors. Results show that our system recommends appropriate number of intervention that can reduce emergency response time significantly. © 2001-2012 IEEE.