Nakema Deonauth

Dr. Nakema Deonauth


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
14 October 2021 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
NDNakema Deonauth
Nakema Deonauth
Mingchu LiMingchu Li
Mingchu Li
SYShuo Yu
Shuo Yu
XCXiangtai Chen
Xiangtai Chen
Academic social networks (ASNs) have attracted significant attention in recent years as researchers try to understand and improve how research is conducted. Several approaches have been investigated to identify, predict, and recommend scientific collaborators but few have considered to explore a strategy using the game theory. This article investigates the social phenomenon of upstream reciprocity (UR) using a game-theoretical framework. UR occurs when a person who has just received help, in turn, offers help to another. A suitable multiplayer game, the public goods game (PGG), is adopted to model scholarly interactions of coauthorship networks. Experiments are performed on real datasets in which cascades of UR scholars are identified. More importantly, the proposed UR strategy achieves better performance than non-UR scholars as they are found to have a higher publication and citation count. Furthermore, UR behavior is found to replicate throughout the network, which in turn increases the likelihood of others adopting it. Finally, theoretical proof and simulations suggest that UR has the potential to become an evolutionary stable strategy (ESS).

11 July 2018 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
NANana Yaw Asabere
Nana Yaw Asabere
BXBo Xu
Bo Xu
AAAmevi Acakpovi
Amevi Acakpovi
NDNakema Deonauth
Nakema Deonauth
Globally, the superfluity of scholarly research conferences in varying disciplines has introduced the issue of scholarly big data and information overload related to both research papers and conference proceedings/sessions. This evident scholarly expansion in different disciplines has increased the collaborative importance of conferences. Consequently, the problem regarding attendees selecting the right conference session(s) to attend in academic conferences requires further and urgent attention. Using a smart conference scenario, this paper aims to address the problem above by proposing an improved venue recommender algorithm called Socially-Aware Recommendation of Venues and Environments-2 (SARVE-2). Using a closeness centrality approach, SARVE-2 initially employs Breadth First Search (BFS) and Depth First Search (DFS) strategies to search for relevant presenters for a target attendee. Then, the tie strength of the (searched) presenter and target attendee is computed to generate reliable social (conference session) recommendations for the target attendee. Through the utilization of a relevant (real-world) dataset, our benchmark experiments reveal that, in comparison with other contemporary methods, SARVE-2 exhibits better performance in terms of effective social recommendation search, as well as social recommendation quality, coverage and accuracy.

1 August 2015 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
LLLi Liu
Li Liu
QYQiuyuan Yang
Qiuyuan Yang
XKXiangjie Kong
Xiangjie Kong
HLHannan Bin Liaqat
Hannan Bin Liaqat
AAAhmedin Mohammed Ahmed
Ahmedin Mohammed Ahmed
FXFeng Xia
Feng Xia
Socially aware networking (SAN) provides a new paradigm for intermittently connected networks which exploits social properties of mobile users to guide the design of protocols. In SAN, data forwarding performance will be degraded dramatically due to the existence of users' selfish behaviors. To address the selfishness problem, barter-based incentive scheme is a fair approach in which two encounter nodes exchange the same amount of data with one another. However, it is a challenging issue for nodes to decide when two nodes contact and how many messages they will exchange for their next contacts. We consider this problem as a resource allocation problem and propose a community-based Barter incentive scheme for SAN paradigm (Com-BIS). In this method, network nodes are grouped into communities and they allocate their forwarding services for different communities optimally using 0-1 knapsack algorithm. The simulation results show that Com-BIS stimulates selfish nodes to cooperate in data delivery for other nodes effectively which improves the forwarding performance considerably.

17 July 2017 in Future Internet
Verified
Journal Article
Open access
PDF file
RBRuchdee Binmad
Ruchdee Binmad
Mingchu LiMingchu Li
Mingchu Li
ZWZhen Wang
Zhen Wang
NDNakema Deonauth
Nakema Deonauth
ACAnil Carie
Anil Carie
The violation of trust as a result of interactions that do not proceed as expected gives rise to the question as to whether broken trust can possibly be recovered. Clearly, trust recovery is more complex than trust initialization and maintenance. Trust recovery requires a more complex mechanism to explore different factors that cause the decline of trust and identify the affected individuals of trust violation both directly and indirectly. In this study, an extended framework for recovering trust is presented. Aside from evaluating whether there is potential for recovery based on the outcome of a forgiveness mechanism after a trust violation, encouraging cooperation between interacting parties after a trust violation through incentive mechanisms is also important. Furthermore, a number of experiments are conducted to validate the applicability of the framework and the findings show that the e-marketplace incorporating our proposed framework results in improved efficiency of trading, especially in long-term interactions.

24 December 2013 in arXiv
Verified
Preprint
Open access
PDF file
FXFeng Xia
Feng Xia
NANana Yaw Asabere
Nana Yaw Asabere
Joel RodriguesJoel Rodrigues
Joel Rodrigues
FBFilippo Basso
Filippo Basso
NDNakema Deonauth
Nakema Deonauth
WWWei Wang
Wei Wang
Current research environments are witnessing high enormities of presentations occurring in different sessions at academic conferences. This situation makes it difficult for researchers (especially juniors) to attend the right presentation session(s) for effective collaboration. In this paper, we propose an innovative venue recommendation algorithm to enhance smart conference participation. Our proposed algorithm, Social Aware Recommendation of Venues and Environments (SARVE), computes the Pearson Correlation and social characteristic information of conference participants. SARVE further incorporates the current context of both the smart conference community and participants in order to model a recommendation process using distributed community detection. Through the integration of the above computations and techniques, we are able to recommend presentation sessions of active participant presenters that may be of high interest to a particular participant. We evaluate SARVE using a real world dataset. Our experimental results demonstrate that SARVE outperforms other state-of-the-art methods.