Reviewerly/exHarmony huggingface dataset:
Graph Barlow Twins: A self-supervised representation learning framework for graphs

The self-supervised learning (SSL) paradigm is an essential exploration area, which tries to eliminate the need for expensive data labeling. Despite the great success of SSL methods in computer vision and natural language processing, most of them employ contrastive learning objectives that require negative samples, which are hard to define. This becomes even more challenging in the case of graphs and is a bottleneck for achieving robust representations. To overcome such limitations, we propose a framework for self-supervised graph representation learning — Graph Barlow Twins, which utilizes a cross-correlation-based loss function instead of negative samples. Moreover, it does not rely on non-symmetric neural network architectures — in contrast to state-of-the-art self-supervised graph representation learning method BGRL. We show that our method achieves as competitive results as the best self-supervised methods and fully supervised ones while requiring fewer hyperparameters and substantially shorter computation time (ca. 30 times faster than BGRL).
Learning to Walk across Time for Interpretable Temporal Knowledge Graph Completion

Static knowledge graphs (KGs), despite their wide usage in relational reasoning and downstream tasks, fall short of realistic modeling of knowledge and facts that are only temporarily valid. Compared to static knowledge graphs, temporal knowledge graphs (TKGs) inherently reflect the transient nature of real-world knowledge. Naturally, automatic TKG completion has drawn much research interests for a more realistic modeling of relational reasoning. However, most of the existing models for TKG completion extend static KG embeddings that do not fully exploit TKG structure, thus lacking in 1) accounting for temporally relevant events already residing in the local neighborhood of a query, and 2) path-based inference that facilitates multi-hop reasoning and better interpretability. In this paper, we propose T-GAP, a novel model for TKG completion that maximally utilizes both temporal information and graph structure in its encoder and decoder. T-GAP encodes query-specific substructure of TKG by focusing on the temporal displacement between each event and the query timestamp, and performs path-based inference by propagating attention through the graph. Our empirical experiments demonstrate that T-GAP not only achieves superior performance against state-of-the-art baselines, but also competently generalizes to queries with unseen timestamps. Through extensive qualitative analyses, we also show that T-GAP enjoys transparent interpretability, and follows human intuition in its reasoning process.
An Improved Delegated Proof of Stake Consensus Algorithm

Aiming at the problems of the existing DPoS(Delegated Proof of Stake) consensus algorithm, such as low enthusiasm of voting nodes and difficulties in dealing with malicious nodes, we improve the traditional DPoS consensus algorithm and propose a reputation-based delegated proof of stake consensus algorithm, called Reputation-DPoS. In our Reputation-DPoS, the reputation model is introduced. By evaluating the behavior of nodes, nodes are divided into different trusted states, and high-quality nodes in the network are selected as consensus nodes to reduce security risks and improve efficiency. Besides, incentive methods of reputation and token are used to improve the enthusiasm of nodes to participate in voting. Simulation results show that our Reputation-DPoS can reduce the probability of malicious nodes being selected and optimize the state of nodes in DPoS. Nodes with good behavior will get more votes and rewards, which will motivate nodes and improve the security of the system. Insert here your abstract text.
Code smell detection using feature selection and stacking ensemble: An empirical investigation

Code smell detection is the process of identifying code pieces that are poorly designed and implemented. Recently more research has been directed towards machine learning-based approaches for code smells detection. Many classifiers have been explored in the literature, yet, finding an effective model to detect different code smells types has not yet been achieved. The main objective of this paper is to empirically investigate the capabilities of stacking heterogeneous ensemble model in code smell detection. Gain feature selection technique was applied to select relevant features in code smell detection. Detection performance of 14 individual classifiers was investigated in the context of two class-level and four method-level code smells. Then, three stacking ensembles were built using all individual classifiers as base classifiers, and three different meta-classifiers (LR, SVM and DT). GP, MLP, DT and SVM(Lin) classifiers were among the best performing classifiers in detecting most of the code smells. On the other hand, SVM(Sig), NB(B), NB(M), and SGD were among the least accurate classifiers for most smell types. The stacking ensemble with LR and SVM meta-classifiers achieved a consistent high detection performance in class-level and method-level code smells compared to all individual models. This paper concludes that the detection performance of the majority of individual classifiers varied from one code smell type to another. However, the detection performance of the stacking ensemble with LR and SVM meta-classifiers was consistently superior over all individual classifiers in detecting different code smell types.
SSMD: Semi-Supervised medical image detection with adaptive consistency and heterogeneous perturbation

Semi-Supervised classification and segmentation methods have been widely investigated in medical image analysis. Both approaches can improve the performance of fully-supervised methods with additional unlabeled data. However, as a fundamental task, semi-supervised object detection has not gained enough attention in the field of medical image analysis. In this paper, we propose a novel Semi-Supervised Medical image Detector (SSMD). The motivation behind SSMD is to provide free yet effective supervision for unlabeled data, by regularizing the predictions at each position to be consistent. To achieve the above idea, we develop a novel adaptive consistency cost function to regularize different components in the predictions. Moreover, we introduce heterogeneous perturbation strategies that work in both feature space and image space, so that the proposed detector is promising to produce powerful image representations and robust predictions. Extensive experimental results show that the proposed SSMD achieves the state-of-the-art performance at a wide range of settings. We also demonstrate the strength of each proposed module with comprehensive ablation studies.
GarbageNet: A Unified Learning Framework for Robust Garbage Classification

The recyclability of domestic waste plays a crucial role in the modern society, which helps reduce multiple types of pollution and brings economic effect. To achieve this goal, garbage classification is one of the most important steps during the recycling process. Prevailing deep learning techniques empower high-performance visual recognition models and can benefit the automation of garbage classification task. Nevertheless, there exist three challenges when directly leveraging deep recognition models for this task, referring to lack of sufficient data, high cost of category increment, and noisy data quality. In this article, we present a novel incremental learning framework, GarbageNet, to address the aforementioned challenges. First, weakly-supervised transfer learning guarantees the capacity of feature extractor. Second, for new categories of garbages, GarbageNet embeds them as anchors for reference and classifies the test samples by finding their nearest neighbors in the latent space. Third, an attentive mixup of training data is utilized for suppressing the negative effect of mislabeled data. We evaluate our method on real-world datasets, and the empirical results demonstrate that GarbageNet achieves the state-of-the-art performance with regard to accuracy, robustness, and extendability. The proposed method won the first place in the HUAWEI Cloud Garbage Classification Challenge in 2019. <p xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><i>Impact Statement</i>—This article contributes to a vision-based garbage recognition system for the recyclability of domestic waste. To the best of our knowledge, it is the first article that explores a realistic vision-based solution for the garbage recognition with a real-world dataset and a comprehensive benchmark on current state-of-the-art visual recognition models. The proposed method addresses several challenges and achieves state-of-the-art performance. We believe that this interdisciplinary research contributes to the AI for the environment, which helps promote environmental ethics, bring rotation economy, and relieve the pressure of consumption doctrine in smart city.
An Optimized Stacking Ensemble Model for Phishing Websites Detection

Security attacks on legitimate websites to steal users’ information, known as phishing attacks, have been increasing. This kind of attack does not just affect individuals’ or organisations’ websites. Although several detection methods for phishing websites have been proposed using machine learning, deep learning, and other approaches, their detection accuracy still needs to be enhanced. This paper proposes an optimized stacking ensemble method for phishing website detection. The optimisation was carried out using a genetic algorithm (GA) to tune the parameters of several ensemble machine learning methods, including random forests, AdaBoost, XGBoost, Bagging, GradientBoost, and LightGBM. The optimized classifiers were then ranked, and the best three models were chosen as base classifiers of a stacking ensemble method. The experiments were conducted on three phishing website datasets that consisted of both phishing websites and legitimate websites—the Phishing Websites Data Set from UCI (Dataset 1); Phishing Dataset for Machine Learning from Mendeley (Dataset 2, and Datasets for Phishing Websites Detection from Mendeley (Dataset 3). The experimental results showed an improvement using the optimized stacking ensemble method, where the detection accuracy reached 97.16%, 98.58%, and 97.39% for Dataset 1, Dataset 2, and Dataset 3, respectively.
Multi-Task Sequence Tagging for Emotion-Cause Pair Extraction Via Tag Distribution Refinement

The task emotion-cause pair extraction deals with finding all emotions and the corresponding causes from emotion texts. Existing joint methods solve it as multi-task learning, which introduces two auxiliary tasks (i.e., emotion extraction and cause extraction) to make use of task correlations for their mutual benefits. However, these methods focus on capturing such correlations by sharing parameters in an implicit way, not only have a limitation of cannot explicitly model their information interaction, but also suffer from low interpretability. Towards these issues, we propose a multi-task sequence tagging framework, which can extract emotions with the associated causes simultaneously by encoding their distances into a novel tagging scheme. In addition, the output of both auxiliary tasks can be directly used as inductive bias, to refine the tag distribution for benefiting emotion-cause pair extraction, so that the information exchange between them can be more explicit and interpretable. Results show that our model achieves the best performance, outperforming a number of competitive baselines by at least 1.03% ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$p&lt; 0.01$</tex-math></inline-formula> ) in <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$F_1$</tex-math></inline-formula> score. The comprehensive analysis further confirms the superiority and robustness of our model.
3D-to-2D Distillation for Indoor Scene Parsing

Indoor scene semantic parsing from RGB images is very challenging due to occlusions, object distortion, and view-point variations. Going beyond prior works that leverage geometry information, typically paired depth maps, we present a new approach, a 3D-to-2D distillation framework, that enables us to leverage 3D features extracted from large-scale 3D data repositories (e.g., ScanNet-v2) to enhance 2D features extracted from RGB images. Our work has three novel contributions. First, we distill 3D knowledge from a pretrained 3D network to supervise a 2D network to learn simulated 3D features from 2D features during the training, so the 2D network can infer without requiring 3D data. Second, we design a two-stage dimension normalization scheme to calibrate the 2D and 3D features for better integration. Third, we design a semantic-aware adversarial training model to extend our framework for training with un-paired 3D data. Extensive experiments on various datasets, ScanNet-V2, S3DIS, and NYU-v2, demonstrate the superiority of our approach. Also, experimental results show that our 3D-to-2D distillation improves the model generalization.
Person30K: A Dual-Meta Generalization Network for Person Re-Identification

Recently, person re-identification (ReID) has vastly benefited from the surging waves of data-driven methods. However, these methods are still not reliable enough for real-world deployments, due to the insufficient generalization capability of the models learned on existing benchmarks that have limitations in multiple aspects, including limited data scale, capture condition variations, and appearance diversities. To this end, we collect a new dataset named Person30K with the following distinct features: 1) a very large scale containing 1.38 million images of 30K identities, 2) a large capture system containing 6,497 cameras deployed at 89 different sites, 3) abundant sample diversities including varied backgrounds and diverse person poses. Furthermore, we propose a domain generalization ReID method, dual-meta generalization network (DMG-Net), to exploit the merits of meta-learning in both the training procedure and the metric space learning. Concretely, we design a "learning then generalization evaluation" metatraining procedure and a meta-discrimination loss to enhance model generalization and discrimination capabilities. Comprehensive experiments validate the effectiveness of our DMG-Net.
Glancing at the Patch: Anomaly Localization with Global and Local Feature Comparison

Anomaly localization, with the purpose to segment the anomalous regions within images, is challenging due to the large variety of anomaly types. Existing methods typically train deep models by treating the entire image as a whole yet put little effort into learning the local distribution, which is vital for this pixel-precise task. In this work, we propose an unsupervised patch-based approach that gives due consideration to both the global and local information. More concretely, we employ a Local-Net and Global-Net to extract features from any individual patch and its surrounding respectively. Global-Net is trained with the purpose to mimic the local feature such that we can easily detect an abnormal patch when its feature mismatches that from the context. We further introduce an Inconsistency Anomaly Detection (IAD) head and a Distortion Anomaly Detection (DAD) head to sufficiently spot the discrepancy between global and local features. A scoring function derived from the multi-head design facilitates high-precision anomaly localization. Extensive experiments on a couple of real-world datasets suggest that our approach outperforms state-of-the-art competitors by a sufficiently large margin.
A decade of in-text citation analysis based on natural language processing and machine learning techniques: an overview of empirical studies

In-text citation analysis is one of the most frequently used methods in research evaluation. We are seeing significant growth in citation analysis through bibliometric metadata, primarily due to the availability of citation databases such as the Web of Science, Scopus, Google Scholar, Microsoft Academic, and Dimensions. Due to better access to full-text publication corpora in recent years, information scientists have gone far beyond traditional bibliometrics by tapping into advancements in full-text data processing techniques to measure the impact of scientific publications in contextual terms. This has led to technical developments in citation classifications, citation sentiment analysis, citation summarisation, and citation-based recommendation. This article aims to narratively review the studies on these developments. Its primary focus is on publications that have used natural language processing and machine learning techniques to analyse citations.
Multi-VAE: Learning Disentangled View-common and View-peculiar Visual Representations for Multi-view Clustering

Multi-view clustering, a long-standing and important research problem, focuses on mining complementary information from diverse views. However, existing works often fuse multiple views’ representations or handle clustering in a common feature space, which may result in their entanglement especially for visual representations. To address this issue, we present a novel VAE-based multi-view clustering framework (Multi-VAE) by learning disentangled visual representations. Concretely, we define a view-common variable and multiple view-peculiar variables in the generative model. The prior of view-common variable obeys approximately discrete Gumbel Softmax distribution, which is introduced to extract the common cluster factor of multiple views. Meanwhile, the prior of view-peculiar variable follows continuous Gaussian distribution, which is used to represent each view’s peculiar visual factors. By controlling the mutual information capacity to disentangle the view-common and view-peculiar representations, continuous visual information of multiple views can be separated so that their common discrete cluster information can be effectively mined. Experimental results demonstrate that Multi-VAE enjoys the disentangled and explainable visual representations, while obtaining superior clustering performance compared with state-of-the-art methods.
An effective motion object detection using adaptive background modeling mechanism in video surveillance system

Automatic moving object detection has gained increased research interest due to its widespread applications like security provision, traffic monitoring, and various types of anomalies detection, etc. In the video surveillance system, the video is processed for the detection of motion objects in a step-by-step process. However, the detection has become complex and less effective due to various complex constraints. To obtain an effective performance in the detection of motion objects, this research work focuses to develop an automatic motion object detection system based on the statistical properties of video and supervised learning. In this paper, a novel Background Modeling mechanism is proposed with the help of a Biased Illumination Field Fuzzy C-means algorithm to detect the moving objects more accurately. Here, the non-stationary pixels are separated from stationary pixels through the Background Subtraction. Afterward, the Biased Illumination Field Fuzzy C-means approach has accomplished to improve the segmentation accuracy through clustering under noise and varying illumination conditions. The performance of the proposed algorithm compared with conventional methods in terms of accuracy, precision, recall, and F- measure.
On the Robustness of Backdoor-based Watermarking in Deep Neural Networks

Watermarking algorithms have been introduced in the past years to protect deep learning models against unauthorized re-distribution. We investigate the robustness and reliability of state-of-the-art deep neural network watermarking schemes. We focus on backdoor-based watermarking and propose two simple yet effective attacks -- a black-box and a white-box -- that remove these watermarks without any labeled data from the ground truth. Our black-box attack steals the model and removes the watermark with only API access to the labels. Our white-box attack proposes an efficient watermark removal when the parameters of the marked model are accessible, and improves the time to steal a model up to twenty times over the time to train a model from scratch. We conclude that these watermarking algorithms are insufficient to defend against redistribution by a motivated attacker.
Attention Fusion for One-Stage Multispectral Pedestrian Detection

Multispectral pedestrian detection, which consists of a color stream and thermal stream, is essential under conditions of insufficient illumination because the fusion of the two streams can provide complementary information for detecting pedestrians based on deep convolutional neural networks (CNNs). In this paper, we introduced and adapted a simple and efficient one-stage YOLOv4 to replace the current state-of-the-art two-stage fast-RCNN for multispectral pedestrian detection and to directly predict bounding boxes with confidence scores. To further improve the detection performance, we analyzed the existing multispectral fusion methods and proposed a novel multispectral channel feature fusion (MCFF) module for integrating the features from the color and thermal streams according to the illumination conditions. Moreover, several fusion architectures, such as Early Fusion, Halfway Fusion, Late Fusion, and Direct Fusion, were carefully designed based on the MCFF to transfer the feature information from the bottom to the top at different stages. Finally, the experimental results on the KAIST and Utokyo pedestrian benchmarks showed that Halfway Fusion was used to obtain the best performance of all architectures and the MCFF could adapt fused features in the two modalities. The log-average miss rate (MR) for the two modalities with reasonable settings were 4.91% and 23.14%, respectively.
Data expansion using back translation and paraphrasing for hate speech detection

With proliferation of user generated contents in social media platforms, establishing mechanisms to automatically identify toxic and abusive content becomes a prime concern for regulators, researchers, and society. Keeping the balance between freedom of speech and respecting each other dignity is a major concern of social media platform regulators. Although, automatic detection of offensive content using deep learning approaches seems to provide encouraging results, training deep learning-based models requires large amounts of high-quality labeled data, which is often missing. In this regard, we present in this paper a new deep learning-based method that fuses a Back Translation method, and a Paraphrasing technique for data augmentation. Our pipeline investigates different word-embedding-based architectures for classification of hate speech. The back translation technique relies on an encoder–decoder architecture pre-trained on a large corpus and mostly used for machine translation. In addition, paraphrasing exploits the transformer model and the mixture of experts to generate diverse paraphrases. Finally, LSTM, and CNN are compared to seek enhanced classification results. We evaluate our proposal on five publicly available datasets; namely, AskFm corpus, Formspring dataset, Warner and Waseem dataset, Olid, and Wikipedia toxic comments dataset. The performance of the proposal together with comparison to some related state-of-art results demonstrate the effectiveness and soundness of our proposal.