Reviewerly/exHarmony huggingface dataset:
Boycotting the Knowledge Makers: How Reddit Demonstrates the Rise of Media Blacklists and Source Rejection in Online Communities

Background: In this article, we address the use of metatags as a form of community knowledge formation and gatekeeping within digital platforms. Situating the case: The subReddit KotakuInAction is a well-known hub of the GamerGate community on Reddit, but one that has avoided the bans common to other aggressive subReddits and GamerGate communities on platforms such as 4chan and GitHub. We contextualize the aggressive nature of the subReddit and the reasons why participants' uses of metatags are meaningful for understanding subReddit culture and moderation practices. Methodology: To better understand the destructive behavioral patterns of KotakuInAction, we coded for the frequency of certain behaviors, such as linking and tagging, as well as the shift in certain keywords and vocabularies between the front facing or predetermined tags and the user-customized or admin-altered tags. We also examined how tags shifted over time and whether certain users dominated particular tags. About the case: What we found was a hybrid culture on KiA that applied Chan culture values and flaming, but increasingly localized the behavior to KiA rather than direct readers out of the site. We also found key shifts in topics away from gaming and activism toward broader complaints about social justice. In addition, we found that a tiny core group of nine influencers (out of tens of thousands of users) accounted for 20% of the top conversations. Conclusions: We suggest a closer examination of how communities self-organize around meta naming structures. Knowledge of this activity can help with predicting and engaging with aggressive and hostile communities by describing how topics shift over time, how they adapt to platform moderation, and who the influencers within a community might be.
An Extended Framework of Privacy-Preserving Computation With Flexible Access Control

Cloud computing offers various services based on outsourced data by utilizing its huge volume of resources and great computation capability. However, it also makes users lose full control over their data. To avoid the leakage of user data privacy, encrypted data are preferred to be uploaded and stored in the cloud, which unfortunately complicates data analysis and access control. In particular, few existing works consider the fine-grained access control over the computational results from ciphertexts. Though our previous work proposed a framework to support several basic computations (such as addition, multiplication and comparison) with flexible access control, privacy-preserving division calculations over encrypted data, as a crucial operation in many statistical processes and machine learning algorithms, is neglected. In this paper, we propose four privacy-preserving division computation schemes with flexible access control to fill this gap, which can adapt to various application scenarios. Furthermore, we extend a division scheme over encrypted integers to support privacy-preserving division over multiple data types including fixed-point numbers and fractional numbers. Finally, we give their security proof and show their efficiency and superiority through comprehensive simulations and comparisons with existing work.
Multi-Label Punitive kNN with Self-Adjusting Memory for Drifting Data Streams

In multi-label learning, data may simultaneously belong to more than one class. When multi-label data arrives as a stream, the challenges associated with multi-label learning are joined by those of data stream mining, including the need for algorithms that are fast and flexible, able to match both the speed and evolving nature of the stream. This article presents a punitive k nearest neighbors algorithm with a self-adjusting memory (MLSAMPkNN) for multi-label, drifting data streams. The memory adjusts in size to contain only the current concept and a novel punitive system identifies and penalizes errant data examples early, removing them from the window. By retaining and using only data that are both current and beneficial, MLSAMPkNN is able to adapt quickly and efficiently to changes within the data stream while still maintaining a low computational complexity. Additionally, the punitive removal mechanism offers increased robustness to various data-level difficulties present in data streams, such as class imbalance and noise. The experimental study compares the proposal to 24 algorithms using 30 real-world and 15 artificial multi-label data streams on six multi-label metrics, evaluation time, and memory consumption. The superior performance of the proposed method is validated through non-parametric statistical analysis, proving both high accuracy and low time complexity. MLSAMPkNN is a versatile classifier, capable of returning excellent performance in diverse stream scenarios.
Blockchain for secure location verification

In location-sensitive applications, dishonest users may submit fake location claims to illegally access a service or obtain benefit. To address this issue, a number of location proof mechanisms have been proposed in literature. However, they confront various security and privacy challenges, including Prover–Prover collusions (Terrorist Frauds), Prover–Witness collusions, and location privacy threats. In this paper, we utilize the unique features of the blockchain technology to design a decentralized scheme for location proof generation and verification. In the proposed scheme, a user who needs a location proof (called a prover) broadcasts a request to the neighbor devices through a short-range communication interface, e.g. Bluetooth. Those neighbor devices that decide to respond (called witnesses) start to authenticate the requesting user. We integrate an incentive mechanism into the proposed scheme to reward such witnesses. Upon successful authentication, a transaction is generated as a location proof and is broadcast onto a peer-to-peer network where it can be picked up by verifiers for final verification. Our security analysis shows that the proposed scheme achieves a reliable performance against Prover–Prover and Prover–Witness collusions. Moreover, our prototype implementation on the Android platform shows that the proposed scheme outperforms other currently deployed location proof schemes.
Automatic label‐free detection of breast cancer using nonlinear multimodal imaging and the convolutional neural network ResNet50

Abstract Breast cancer is the main cause of all female cancer deaths worldwide. Because of the lack of early symptoms, the early detection of breast cancer becomes challenging. This detection is performed by screening techniques in organized preventive examinations. A promising imaging technology that can detect biomolecular alterations and can support the screening technologies by enhancing their low sensitivity, is nonlinear multimodal imaging. To detect these biomolecular alterations, machine‐learning algorithms are utilized. Our analysis started by preprocessing the images and comparing them to the pathological diagnosis. We trained two classification models utilizing the deep convolutional neural network ResNet50. This network was either used as feature extractor or to be fine‐tuned as a classification model. Beside these two classification approaches, two data validation techniques were investigated: the leave‐one‐patient‐out cross‐validation (LOPO‐CV) and the training‐test validation. The best reported result of breast cancer detection was introduced by the fine‐tuned ResNet50 network and LOPO‐CV accounting to 86.23% mean‐sensitivity.
Understanding Expert Disagreement in Medical Data Analysis through Structured Adjudication

Expert disagreement is pervasive in clinical decision making and collective adjudication is a useful approach for resolving divergent assessments. Prior work shows that expert disagreement can arise due to diverse factors including expert background, the quality and presentation of data, and guideline clarity. In this work, we study how these factors predict initial discrepancies in the context of medical time series analysis, examining why certain disagreements persist after adjudication, and how adjudication impacts clinical decisions. Results from a case study with 36 experts and 4,543 adjudicated cases in a sleep stage classification task show that these factors contribute to both initial disagreement and resolvability, each in their own unique way. We provide evidence suggesting that structured adjudication can lead to significant revisions in treatment-relevant clinical parameters. Our work demonstrates how structured adjudication can support consensus and facilitate a deep understanding of expert disagreement in medical data analysis.
In-classroom learning analytics based on student behavior, topic and teaching characteristic mining

The automatic analysis of students’ in-classroom behavior is valuable to evaluate the effect of teaching. Recent studies of in-classroom video analysis mainly focus on lecture content, positions and identities of students. In this paper, we propose to analyze the students’ concentration degree to the teacher or teaching content. Specifically, we detect students’ faces, track faces, and analyze the students’ behavior, i.e. raising or downing faces and corresponding head orientations to the teacher, teaching content or not. Besides, texts are obtained from the teacher’s speech and the course topics taught in the class are extracted. Audio features of the teacher’s speech are extracted and analyzed. Finally, the correlation of the students’ concentration degree with the course topics, audio features are analyzed. This analysis can help teachers find the effective teaching characteristic to better improve students’ concentration degree.
Face Alignment With Kernel Density Deep Neural Network

Deep neural networks achieve good performance in many computer vision problems such as face alignment. However, when the testing image is challenging due to low resolution, occlusion or adversarial attacks, the accuracy of a deep neural network suffers greatly. Therefore, it is important to quantify the uncertainty in its predictions. A probabilistic neural network with Gaussian distribution over the target is typically used to quantify uncertainty for regression problems. However, in real-world problems especially computer vision tasks, the Gaussian assumption is too strong. To model more general distributions, such as multi-modal or asymmetric distributions, we propose to develop a kernel density deep neural network. Specifically, for face alignment, we adapt state-of-the-art hourglass neural network into a probabilistic neural network framework with landmark probability map as its output. The model is trained by maximizing the conditional log likelihood. To exploit the output probability map, we extend the model to multi-stage so that the logits map from the previous stage can feed into the next stage to progressively improve the landmark detection accuracy. Extensive experiments on benchmark datasets against state-of-the-art unconstrained deep learning method demonstrate that the proposed kernel density network achieves comparable or superior performance in terms of prediction accuracy. It further provides aleatoric uncertainty estimation in predictions.
Dispatched attention with multi-task learning for nested mention recognition

Entity mentions usually contain other mention in the task of named entity recognition (NER). Nested entities pose challenge to the task of NER. Existing methods fail to sufficiently capture the boundaries information between nested entities, which limits the performance of the task. In this paper, we propose a dispatched attention neural model with multi-task learning for the task. In particular, given an input sentence, a bi-directional Long Short Term Memory (BiLSTM) encodes it as common contextualized hidden representation. Then position and syntax information are leveraged into attention network for capturing mention span features. The attention representation of each task is dispatched to subsequent task to exchange boundaries information for nested mentions. Finally, Conditional Random Fields (CRFs) are used to extract nested mentions in an inside-out order for each task. Results on ACE2005 and GENIA datasets show that the proposed model outperforms state-of-the-art systems, showing its effectiveness in detecting nested mentions.
Indic handwritten script identification using offline-online multi-modal deep network

In this paper, we propose a novel approach of word-level Indic script identification using only character-level data in training stage. Our method uses a multi-modal deep network which takes both offline and online modality of the data as input in order to explore the information from both the modalities jointly for script identification task. We take handwritten data in either modality as input and the opposite modality is generated through intermodality conversion. Thereafter, we feed this offline-online modality pair to our network. Hence, along with the advantage of utilizing information from both the modalities, the proposed framework can work for both offline and online script identification which alleviates the need for designing two separate script identification modules for individual modality. We also propose a novel conditional multi-modal fusion scheme to combine the information from offline and online modality which takes into account the original modality of the data being fed to our network and thus it combines adaptively. An exhaustive experimental study has been done on a data set including English(Roman) and 6 other official Indic scripts. Our proposed scheme outperforms traditional classifiers along with handcrafted features and deep learning based methods. Experiment results show that using only character level training data can achieve competitive performance against traditional training using word level data.
Visual Relationships as Functions:Enabling Few-Shot Scene Graph Prediction

Scene graph prediction - classifying the set of objects and predicates in a visual scene - requires substantial training data. The long-tailed distribution of relationships can be an obstacle for such approaches, however, as they can only be trained on the small set of predicates that carry sufficient labels. We introduce the first scene graph prediction model that supports few-shot learning of predicates, enabling scene graph approaches to generalize to a set of new predicates. First, we introduce a new model of predicates as functions that operate on object features or image locations. Next, we define a scene graph model where these functions are trained as message passing protocols within a new graph convolution framework. We train the framework with a frequently occurring set of predicates and show that our approach outperforms those that use the same amount of supervision by 1.78 at recall@50 and performs on par with other scene graph models. Next, we extract object representations generated by the trained predicate functions to train few-shot predicate classifiers on rare predicates with as few as 1 labeled example. When compared to strong baselines like transfer learning from existing state-of-the-art representations, we show improved 5-shot performance by 4.16 recall@1. Finally, we show that our predicate functions generate interpretable visualizations, enabling the first interpretable scene graph model.
Analysis of Speaker Diarization Based on Bayesian HMM With Eigenvoice Priors

In our previous work, we introduced our Bayesian Hidden Markov Model with eigenvoice priors, which has been recently recognized as the state-of-the-art model for Speaker Diarization. In this article we present a more complete analysis of the Diarization system. The inference of the model is fully described and derivations of all update formulas are provided for a complete understanding of the algorithm. An extensive analysis on the effect, sensitivity and interactions of all model parameters is provided, which might be used as a guide for their optimal setting. The newly introduced speaker regularization coefficient allows us to control the number of speakers inferred in an utterance. A naive speaker model merging strategy is also presented, which allows to drive the variational inference out of local optima. Experiments for the different diarization scenarios are presented on CALLHOME and DIHARD datasets.
A Fusion Model-Based Label Embedding and Self-Interaction Attention for Text Classification

Text classification is a pivotal task in NLP (Natural Language Processing), which has received widespread attention recently. Most of the existing methods leverage the power of deep learning to improve the performance of models. However, these models ignore the interaction information between all the sentences in a text when generating the current text representation, which results in a partial semantics loss. Labels play a central role in text classification. And the attention learned from text-label in the joint space of labels and words is not leveraged, leaving enough room for further improvement. In this paper, we propose a text classification method based on Self-Interaction attention mechanism and label embedding. Firstly, our method introduce BERT (Bidirectional Encoder Representation from Transformers) to extract text features. Then Self-Interaction attention mechanism is employed to obtain text representations containing more comprehensive semantics. Moreover, we focus on the embedding of labels and words in the joint space to achieve the dual-label embedding, which further leverages the attention learned from text-label. Finally, the texts are classified by the classifier according to the weighted labels representations. The experimental results show that our method outperforms other state-of-the-art methods in terms of classification accuracy.
Rapidly-exploring Random Trees for Testing Automated Vehicles

One of the expectations from fully or partially automated vehicles is to never cause an accident and actively avoid dangerous situations. However, an automated vehicle may not be able to avoid all collisions, e.g., collisions caused by other vehicles. Hence, it is important for the system developers to understand the boundary case scenarios where an autonomous vehicle can no longer avoid a collision. In this paper, an automated test generation approach that utilizes Rapidly-exploring Random Trees is presented to explore these boundary scenarios. An important advantage of the approach is the openness of the test scenarios: one can set the road geometry and the number of adversarial objects and let the system search for interesting trajectories and environment parameters. A cost function is proposed which guides the test generation toward almost-avoidable collisions or near-misses.
Elite artificial bees' colony algorithm to solve robot's fuzzy constrained routing problem

Abstract One of the fundamental challenges of the robotics field is robot's movement. That is, why route planning is an eminent issue of robotics research and it is used to enhance autonomy of moving robots in complex environments. The objective of route planning problem is to find the shortest route without collide from initiation point to destination point so that the amount of energy consumption by robot would not exceed a predefined amount. Because neither the amount of energy consumption nor the robot's passed distance index cannot be measured precisely due to environmental conditions, and fuzzy data is used for modeling the problem and the problem would be called “Robot Fuzzy Constrained shortest Route” problem. The main contributions of this study are fivefold: (i) The mathematical model of fuzzy constrained shortest route problem (FCSRP) is formulated; (ii) An elite artificial bees' colony (EABC) algorithm is used to solve the robot's FSCRP; (iii) The proposed EABC algorithm is simulated with two fuzzy networks; (iv) The performance of the proposed approach is compared with the performance of genetic algorithm and particle swarm optimization algorithm; and (v) The results show the convergence speed of the EABC algorithm is higher than the existing algorithms.
Hybrid Words Representation for Airlines Sentiment Analysis

Social media sentimental analysis is interesting field with the aim to analyze social conservation and determine deeper context as they apply to a topic or theme. However, it is challenging as tweets are unstructured, informal and noisy in nature. Also, it involves natural language complexities like words with same meanings (Polysemy). Most of the existing approaches mainly rely on clean textual data, however Twitter data is quite noisy in real life. Aiming to improve the performance, in this paper, we present hybrid words representation and Bi-directional Long Short Term Memory (BiLSTM) with attention modeling resulting in improvement in tweet quality by not only treating the noise within the textual context but also considers polysemy, semantics, syntax, out of vocabulary (OOV) words as well as words sentiments within a tweet. The proposed model overcomes the current limitations and improves the accuracy for tweets classification as showed by the evaluation of the model performed on real-world airline related datasets.
Information fusion robust guaranteed cost Kalman estimators with uncertain noise variances and missing measurements

For multisensor systems with uncertain noise variances and missing measurements, it can be converted into one only with uncertain noise variances by introducing fictitious measurement white noises. According to the minimax robust estimation principle and parameterisation representation of perturbances of uncertain noise variances, based on the worst-case system with conservative upper bounds of uncertain noise variances, the two classes of guaranteed cost robust weighted fusion Kalman estimators with matrix weights, diagonal matrix weights, scalar weights, and covariance intersection fusion matrix weights are presented. One class is the construction of a maximal perturbance region of uncertain noise variances, in which for all admissible perturbances, the accuracy deviations are guaranteed to remain within the prescribed range. The other class is the finding of minimal upper bound and maximal lower bound of accuracy deviations over the given perturbance region of uncertain noise variances. Two problems can be converted into the optimisation problems with constraints. Their optimal analytical solutions can simply be found respectively by the Lagrange multiplier method and the linear programme method. The guaranteed cost robustness is proved by the Lyapunov equation approach. A simulation example applied to the mass-spring system is provided to demonstrate the correctness and effectiveness of the proposed results.