Reviewerly/exHarmony huggingface dataset:
AI agency vs. human agency: understanding human–AI interactions on TikTok and their implications for user engagement

Abstract Artificial intelligence (AI) technology has vastly reshaped user experiences on social media. AI-powered social media use and its outcomes largely depend on how users collaborate with AI that exercises agency. Through in-depth interviews with TikTok users, this study investigates how users collaborate with AI when using AI-powered social media and how such dynamics shape user engagement. We found that TikTok users are receptive to personalized experiences enabled by machine agency. However, by influencing each other, user agency and machine agency also led to user–AI synergy. Users deliberately influence content curation algorithms to make them cater more precisely to their needs; AI also facilitates users’ content creation and networking. Such AI–user collaboration on TikTok significantly influences medium engagement and social-interactive engagement. These findings advance our understanding of the dynamics between human agency and machine agency and, thus, how AI transforms user experiences on social media.
A Novel Hybrid Encryption Method to Secure Healthcare Data in IoT-enabled Healthcare Infrastructure

Nowadays, smart devices are playing a vital role to overtake the conventional healthcare management system. Here, the Internet of Things (IoT) leads the healthcare industry towards its expansion, where things can be connected anytime from anywhere, even in a heterogeneous environment. However, the security of healthcare data and preserving the privacy of users are major concerns in IoT-enabled healthcare infrastructure. This paper presents a novel encryption scheme using elliptic curve cryptography, Advanced Encryption Standard (AES), and Serpent to secure healthcare data in IoT-enabled healthcare infrastructure. This proposed hybrid encryption technique improves security measures of the healthcare data by incorporating both symmetric and asymmetric-based encryption techniques. Moreover, the proposed scheme also ensures data integrity by using the elliptic curve-based digital signature. To prove the efficiency of the proposed scheme, both formal security analysis and performance comparisons are presented in this paper. Results and discussion prove the effectiveness of the proposed scheme.
A new approach to dominant motion pattern recognition at the macroscopic crowd level

Automatic analysis and the recognition and prediction of the behaviour of large-scale crowds in video-surveillance data is a research field of paramount importance for the security of modern societies. It serves to predict and help prevent disasters in public places where crowds of people gather. The paper proposes a novel method for generating meta-tracklets and recognition of dominant motion patterns as a basis for automatic crowd behaviour analysis at the macroscopic level, where a crowd is treated as an entity. The basic characteristic of macroscopic crowd scenes is that it is impossible to detect and track individuals in the scene. The idea of the method proposed in this paper is to recognize dominant crowd motion patterns, by avoiding time-consuming and error-sensitive crowd segmentation, crowd tracking and detection of regions of interest. Thus, the process of determining dominant motion patterns and recognizing crowd behaviour is accelerated. The method is inspired by a quantum mechanical approach. It combines a set of particles, which are considered as particles in quantum mechanics, tracklets of particles’ advection in a video clip, and the interaction of wave functions spread out from particle positions. A wave function is expressed in the form of an asymmetric potential function. Peaks of the wave field define the most probable particle flow, which defines a meta-tracklet. Dominant motion patterns are recognized by applying the functions of fuzzy predicates, which represent a combination of common-sense and human expert knowledge about crowd motions, to the meta-tracklets. The experimental results of the proposed method are presented for a subset of UCF dataset and AGORASET crowd simulation videos and have shown promising results in dominant motion pattern recognition.
Deep learning-based breast cancer grading and survival analysis on whole-slide histopathology images

Breast cancer tumor grade is strongly associated with patient survival. In current clinical practice, pathologists assign tumor grade after visual analysis of tissue specimens. However, different studies show significant inter-observer variation in breast cancer grading. Computer-based breast cancer grading methods have been proposed but only work on specifically selected tissue areas and/or require labor-intensive annotations to be applied to new datasets. In this study, we trained and evaluated a deep learning-based breast cancer grading model that works on whole-slide histopathology images. The model was developed using whole-slide images from 706 young (&lt; 40 years) invasive breast cancer patients with corresponding tumor grade (low/intermediate vs. high), and its constituents nuclear grade, tubule formation and mitotic rate. The performance of the model was evaluated using Cohen's kappa on an independent test set of 686 patients using annotations by expert pathologists as ground truth. The predicted low/intermediate (n = 327) and high (n = 359) grade groups were used to perform survival analysis. The deep learning system distinguished low/intermediate versus high tumor grade with a Cohen's Kappa of 0.59 (80% accuracy) compared to expert pathologists. In subsequent survival analysis the two groups predicted by the system were found to have a significantly different overall survival (OS) and disease/recurrence-free survival (DRFS/RFS) (p &lt; 0.05). Univariate Cox hazard regression analysis showed statistically significant hazard ratios (p &lt; 0.05). After adjusting for clinicopathologic features and stratifying for molecular subtype the hazard ratios showed a trend but lost statistical significance for all endpoints. In conclusion, we developed a deep learning-based model for automated grading of breast cancer on whole-slide images. The model distinguishes between low/intermediate and high grade tumors and finds a trend in the survival of the two predicted groups.
A full data augmentation pipeline for small object detection based on generative adversarial networks

Object detection accuracy on small objects, i.e., objects under 32 × 32 pixels, lags behind that of large ones. To address this issue, innovative architectures have been designed and new datasets have been released. Still, the number of small objects in many datasets does not suffice for training. The advent of the generative adversarial networks (GANs) opens up a new data augmentation possibility for training architectures without the costly task of annotating huge datasets for small objects. In this paper, we propose a full pipeline for data augmentation for small object detection which combines a GAN-based object generator with techniques of object segmentation, image inpainting, and image blending to achieve high-quality synthetic data. The main component of our pipeline is DS-GAN, a novel GAN-based architecture that generates realistic small objects from larger ones. Experimental results show that our overall data augmentation method improves the performance of state-of-the-art models up to 11.9% APs@.5 on UAVDT and by 4.7% APs@.5 on iSAID, both for the small objects subset and for a scenario where the number of training instances is limited.
Robust cross-network node classification via constrained graph mutual information

The recent methods for cross-network node classification mainly exploit graph neural networks (GNNs) as feature extractor to learn expressive graph representations across the source and target graphs. However, GNNs are vulnerable to noisy factors, such as adversarial attacks or perturbations on the node features or graph structure, which can cause a significant negative impact on their learning performance. To this end, we propose a robust graph domain adaptive learning framework RGDAL which exploits an information-theoretic principle to filter the noisy factors for cross-network node classification. Specifically, RGDAL utilizes graph convolutional network (GCN) with constrained graph mutual information and an adversarial learning component to learn noise-resistant and domain-invariant graph representations. To overcome the difficulties of estimating the mutual information for the non independent and identically distributed (non-i.i.d.) graph structured data, we design a dynamic neighborhood sampling strategy that can discretize the graph and incorporate the graph structural information for mutual information estimation. Experimental results on two real-world graph datasets demonstrate that RGDAL shows better robustness for cross-network node classification compared with the SOTA graph adaptive learning methods.
Achieving Efficient and Privacy-Preserving Neural Network Training and Prediction in Cloud Environments

The neural network has been widely used to train predictive models for applications such as image processing, disease prediction, and face recognition. To produce more accurate models, powerful third parties (e.g., clouds) are usually employed to collect data from a large number of users, which however may raise concerns about user privacy. In this paper, we propose an Efficient and Privacy-preserving Neural Network scheme, named EPNN, to deal with the privacy issues in cloud-based neural networks. EPNN is designed based on a two-cloud model and techniques of data perturbation and additively homomorphic cryptosystem. This scheme enables two clouds to cooperatively perform neural network training and prediction in a privacy-preserving manner and significantly reduces the computation and communication overhead among participating entities. Through a detailed analysis, we demonstrate the security of EPNN. Extensive experiments based on real-world datasets show EPNN is more efficient than existing schemes in terms of computational costs and communication overhead.
Quod erat demonstrandum? - Towards a typology of the concept of explanation for the design of explainable AI

In this paper, we present a fundamental framework for defining different types of explanations of AI systems and the criteria for evaluating their quality. Starting from a structural view of how explanations can be constructed, i.e., in terms of an explanandum (what needs to be explained), multiple explanantia (explanations, clues, or parts of information that explain), and a relationship linking explanandum and explanantia, we propose an explanandum-based typology and point to other possible typologies based on how explanantia are presented and how they relate to explanandia. We also highlight two broad and complementary perspectives for defining possible quality criteria for assessing explainability: epistemological and psychological (cognitive). These definition attempts aim to support the three main functions that we believe should attract the interest and further research of XAI scholars: clear inventories, clear verification criteria, and clear validation methods.
Sentiment Analysis With Ensemble Hybrid Deep Learning Model

The rapid development of mobile technologies has made social media a vital platform for people to express their feelings and opinions. Understanding the public opinions can be beneficial for business and political entities in making strategic decisions. In light of this, sentiment analysis plays an important role to understand the polarity of the public opinions. This paper presents an ensemble hybrid deep learning model for sentiment analysis. The proposed ensemble model comprises three hybrid deep learning models which are the combination of Robustly optimized Bidirectional Encoder Representations from Transformers approach (RoBERTa), Long Short-Term Memory (LSTM), Bidirectional Long Short-Term Memory (BiLSTM) and Gated Recurrent Unit (GRU). In the hybrid deep learning model, RoBERTa is responsible for projecting the textual input sequence into a representative embedding space. Thereafter, the LSTM, BiLSTM and GRU capture the long-range dependencies in the embedding given the class. The predictions by the hybrid deep learning model are then amalgamated by averaging ensemble and majority voting, further improving the overall performance in sentiment analysis. In addition to that, the data augmentation with GloVe pre-trained word embedding has also been applied to alleviate the imbalanced dataset problems. The experimental results show that the proposed ensemble hybrid deep learning model outshines the state-of-the-art methods with the accuracy of 94.9%, 91.77%, and 89.81% on IMDb, Twitter US Airline Sentiment dataset and Sentiment140 dataset, respectively.
Deep learning for anomaly detection in multivariate time series: Approaches, applications, and challenges

Anomaly detection has recently been applied to various areas, and several techniques based on deep learning have been proposed for the analysis of multivariate time series. In this study, we classify the anomalies into three types, namely abnormal time points, time intervals, and time series, and review the state-of-the-art deep learning techniques for the detection of each of these types. Long short-term memory and autoencoders are the most commonly used methods for detecting abnormal time points and time intervals. In addition, some studies have implemented dynamic graphs to examine relational features between the time series and detect abnormal time intervals. However, anomaly detection still faces some limitations and challenges, such as the explainability of anomalies. Many studies have focused only on anomaly detection methods but failed to consider the reasons for the anomalies. Therefore, increasing the explainability of anomalies is an important research topic in anomaly detection.
Bubbles all the way down? Detecting and date-stamping bubble behaviours in NFT and DeFi markets

Amid surging market values and widespread regulatory discussion, NFT and DeFi markets are widely perceived as being simply speculative in nature.This paper detects the existence and dates of price bubbles in the NFT and DeFi markets by applying SADF and GSADF tests.We document that NFT and DeFi markets both exhibit speculative bubbles, with NFT bubbles being more recurrent and having higher average explosive magnitudes than DeFi bubbles.The price bubbles in the NFT and DeFi markets are highly correlated with market hype and with more general cryptocurrency market uncertainty.We do find periods where bubbles are not detected, suggesting that these markets do have some intrinsic value and should not be dismissed as simply bubbles.
Explainable Artificial Intelligence (XAI) from a user perspective: A synthesis of prior literature and problematizing avenues for future research

The rapid growth and use of artificial intelligence (AI)-based systems have raised concerns regarding explainability. Recent studies have discussed the emerging demand for explainable AI (XAI); however, a systematic review of explainable artificial intelligence from an end user's perspective can provide a comprehensive understanding of the current situation and help close the research gap. The purpose of this study was to perform a systematic literature review of explainable AI from the end user's perspective and to synthesize the findings. To be precise, the objectives were to 1) identify the dimensions of end users' explanation needs; 2) investigate the effect of explanation on end user's perceptions, and 3) identify the research gaps and propose future research agendas for XAI, particularly from end users' perspectives based on current knowledge. The final search query for the Systematic Literature Review (SLR) was conducted on July 2022. Initially, we extracted 1707 journal and conference articles from the Scopus and Web of Science databases. Inclusion and exclusion criteria were then applied, and 58 articles were selected for the SLR. The findings show four dimensions that shape the AI explanation, which are format (explanation representation format), completeness (explanation should contain all required information, including the supplementary information), accuracy (information regarding the accuracy of the explanation), and currency (explanation should contain recent information). Moreover, along with the automatic representation of the explanation, the users can request additional information if needed. We have also described five dimensions of XAI effects: trust, transparency, understandability, usability, and fairness. We investigated current knowledge from selected articles to problematize future research agendas as research questions along with possible research paths. Consequently, a comprehensive framework of XAI and its possible effects on user behavior has been developed.
Finding compact and well-separated clusters: Clustering using silhouette coefficients

Finding compact and well-separated clusters in data sets is a challenging task. Most clustering algorithms try to minimize certain clustering objective functions. These functions usually reflect the intra-cluster similarity and inter-cluster dissimilarity. However, the use of such functions alone may not lead to the finding of well-separated and, in some cases, compact clusters. Therefore additional measures, called cluster validity indices, are used to estimate the true number of well-separated and compact clusters. Some of these indices are well-suited to be included into the optimization model of the clustering problem. Silhouette coefficients are among such indices. In this paper, a new optimization model of the clustering problem is developed where the clustering function is used as an objective and silhouette coefficients are used to formulate constraints. Then an algorithm, called CLUSCO (CLustering Using Silhouette COefficients), is designed to construct clusters incrementally. Three schemes are discussed to reduce the computational complexity of the algorithm. Its performance is evaluated using fourteen real-world data sets and compared with that of three state-of-the-art clustering algorithms. Results show that the CLUSCO is able to compute compact clusters which are significantly better separable in comparison with those obtained by other algorithms.
Termite life cycle optimizer

This paper introduces a novel bio-inspired meta-heuristic optimization algorithm, named termite life cycle optimizer (TLCO), which is based on both the life cycle of a termite colony and the modulation of movement strategies used by many animal species in nature. Termite colonies are comprised of three distinct castes: the workers, the soldiers and the reproductive termites. Each caste undertakes a set of specific tasks that ensure the growth and survival of the colony. TLCO mimics the activities of these three castes that are implemented in a mathematical model. The model is then used to find the global optimum in classic optimization problems. First, the behaviors of the workers, soldiers and reproductive termites are used to simulate a balance between the tasks of exploration and exploitation. Second, the initial population securely records the information obtained at each iteration and transmits it to workers and soldiers at the next iteration. This process is repeated until the global optimum is found with the smallest error. Besides, a new proposed function combined with Lévy flight is used to modulate the movement of termites that increases its flexibility. Thus, TLCO can cover both long distances during the first iterations to improve the convergence rate and shorter distances during the last iterations to enhance the level of accuracy. We then compare the performances of TLCO with other well-known nature-inspired algorithms using 23 classical benchmark functions, CEC2005 benchmark functions, and five real engineering design problems. The results demonstrate the effectiveness and reliability of TLCO in solving these optimization problems. Source codes of TLCO is publicly available at http://goldensolutionrs.com/termite-life-cycle-optimizer.html.
Boosting question answering over knowledge graph with reward integration and policy evaluation under weak supervision

Among existing knowledge graph based question answering (KGQA) methods, relation supervision methods require labeled intermediate relations for stepwise reasoning. To avoid this enormous cost of labeling on large-scale knowledge graphs, weak supervision methods, which use only the answer entity to evaluate rewards as supervision, have been introduced. However, lacking intermediate supervision raises the issue of sparse rewards, which may result in two types of incorrect reasoning path: (1) incorrectly reasoned relations, even when the final answer entity may be correct; (2) correctly reasoned relations in a wrong order, which leads to an incorrect answer entity. To address these issues, this paper considers the multi-hop KGQA task as a Markov decision process, and proposes a model based on Reward Integration and Policy Evaluation (RIPE). In this model, an integrated reward function is designed to evaluate the reasoning process by leveraging both terminal and instant rewards. The intermediate supervision for each single reasoning hop is constructed with regard to both the fitness of the taken action and the evaluation of the unreasoned information remained in the updated question embeddings. In addition, to lead the agent to the answer entity along the correct reasoning path, an evaluation network is designed to evaluate the taken action in each hop. Extensive ablation studies and comparative experiments are conducted on four KGQA benchmark datasets. The results demonstrate that the proposed model outperforms the state-of-the-art approaches in terms of answering accuracy.
GLAMR: Global Occlusion-Aware Human Mesh Recovery with Dynamic Cameras

We present an approach for 3D global human mesh recovery from monocular videos recorded with dynamic cameras. Our approach is robust to severe and long-term occlusions and tracks human bodies even when they go outside the camera's field of view. To achieve this, we first propose a deep generative motion infiller, which autoregressively infills the body motions of occluded humans based on visible motions. Additionally, in contrast to prior work, our approach reconstructs human meshes in consistent global coordinates even with dynamic cameras. Since the joint reconstruction of human motions and camera poses is underconstrained, we propose a global trajectory predictor that generates global human trajectories based on local body movements. Using the predicted trajectories as anchors, we present a global optimization framework that refines the predicted trajectories and optimizes the camera poses to match the video evidence such as 2D keypoints. Experiments on challenging indoor and in-the-wild datasets with dynamic cameras demonstrate that the proposed approach outperforms prior methods significantly in terms of motion infilling and global mesh recovery.