An Unsupervised Aspect-Aware Recommendation Model with Explanation Text Generation

Review based recommendation utilizes both users’ rating records and the associated reviews for recommendation. Recently, with the rapid demand for explanations of recommendation results, reviews are used to train the encoder–decoder models for explanation text generation. As most of the reviews are general text without detailed evaluation, some researchers leveraged auxiliary information of users or items to enrich the generated explanation text. Nevertheless, the auxiliary data is not available in most scenarios and may suffer from data privacy problems. In this article, we argue that the reviews contain abundant semantic information to express the users’ feelings for various aspects of items, while these information are not fully explored in current explanation text generation task. To this end, we study how to generate more fine-grained explanation text in review based recommendation without any auxiliary data. Though the idea is simple, it is non-trivial since the aspect is hidden and unlabeled. Besides, it is also very challenging to inject aspect information for generating explanation text with noisy review input. To solve these challenges, we first leverage an advanced unsupervised neural aspect extraction model to learn the aspect-aware representation of each review sentence. Thus, users and items can be represented in the aspect space based on their historical associated reviews. After that, we detail how to better predict ratings and generate explanation text with the user and item representations in the aspect space. We further dynamically assign review sentences which contain larger proportion of aspect words with larger weights to control the text generation process, and jointly optimize rating prediction accuracy and explanation text generation quality with a multi-task learning framework. Finally, extensive experimental results on three real-world datasets demonstrate the superiority of our proposed model for both recommendation accuracy and explainability.

One-Shot Relation Learning for Knowledge Graphs via Neighborhood Aggregation and Paths Encoding

The relation learning between two entities is an essential task in knowledge graph (KG) completion that has received much attention recently. Previous work almost exclusively focused on relations widely seen in the original KGs, which means that enough training data are available for modeling. However, long-tail relations that only show in a few triples are actually much more common in practical KGs. Without sufficiently large training data, the performance of existing models on predicting long-tail relations drops impressively. This work aims to predict the relation under a challenging setting where only one instance is available for training. We propose a path-based one-shot relation prediction framework, which can extract neighborhood information of an entity based on the relation query attention mechanism to learn transferable knowledge among the same relation. Simultaneously, to reduce the impact of long-tail entities on relation prediction, we selectively fuse path information between entity pairs as auxiliary information of relation features. Experiments in three one-shot relation learning datasets show that our proposed framework substantially outperforms existing models on one-shot link prediction and relation prediction.

SPEX: A Generic Framework for Enhancing Neural Social Recommendation

Social Recommender Systems (SRS) have attracted considerable attention since its accompanying service, social networks, helps increase user satisfaction and provides auxiliary information to improve recommendations. However, most existing SRS focus on social influence and ignore another essential social phenomenon, i.e., social homophily. Social homophily, which is the premise of social influence, indicates that people tend to build social relations with similar people and form influence propagation paths. In this article, we propose a generic framework Social PathExplorer (SPEX) to enhance neural SRS. SPEX treats the neural recommendation model as a black box and improves the quality of recommendations by modeling the social recommendation task, the formation of social homophily, and their mutual effect in the manner of multi-task learning. We design a Graph Neural Network based component for influence propagation path prediction to help SPEX capture the rich information conveyed by the formation of social homophily. We further propose an uncertainty based task balancing method to set appropriate task weights for the recommendation task and the path prediction task during the joint optimization. Extensive experiments have validated that SPEX can be easily plugged into various state-of-the-art neural recommendation models and help improve their performance. The source code of our work is available at: https://github.com/XMUDM/SPEX.

Generalized Chain Regression-cum-Chain Ratio Estimator for Population Mean under Stratified Extreme-cum-Median Ranked Set Sampling

Estimation of population mean of study variable Y suffers loss of precision in the presence of high variation in the data set. The use of auxiliary information incorporated in construction of an estimator under ranked set sampling scheme results in efficient estimation of population mean. In this paper, we propose an efficient generalized chain regression-cum-chain ratio type estimator to estimate finite population mean of study variable under stratified extreme-cum-median ranked set sampling utilizing information on two auxiliary variables. Mean square error (MSE) of the proposed generalized estimator is derived up to first order of approximation. The applications of the proposed estimator under symmetrical and asymmetrical probability distributions are discussed using simulation study and real-life data set for comparisons of efficiency. It is concluded that the proposed generalized estimator performs efficiently as compared to some existing estimators. It is also observed that the efficiency of the proposed estimator is directly proportional to the correlations between the study variable and its auxiliary variables.

Automatic Processing Pipeline for Collecting and Annotating Air-Traffic Voice Communication Data

This document describes our pipeline for automatic processing of ATCO pilot audio communication we developed as part of the ATCO2 project. So far, we collected two thousand hours of audio recordings that we either preprocessed for the transcribers or used for semi-supervised training. Both methods of using the collected data can further improve our pipeline by retraining our models. The proposed automatic processing pipeline is a cascade of many standalone components: (a) segmentation, (b) volume control, (c) signal-to-noise ratio filtering, (d) diarization, (e) ‘speech-to-text’ (ASR) module, (f) English language detection, (g) call-sign code recognition, (h) ATCO—pilot classification and (i) highlighting commands and values. The key component of the pipeline is a speech-to-text transcription system that has to be trained with real-world ATC data; otherwise, the performance is poor. In order to further improve speech-to-text performance, we apply both semi-supervised training with our recordings and the contextual adaptation that uses a list of plausible callsigns from surveillance data as auxiliary information. Downstream NLP/NLU tasks are important from an application point of view. These application tasks need accurate models operating on top of the real speech-to-text output; thus, there is a need for more data too. Creating ATC data is the main aspiration of the ATCO2 project. At the end of the project, the data will be packaged and distributed by ELDA.

A New Hybrid Exponentially Weighted Moving Average control chart using Mixture Ratio Estimator of Mean

In this paper, we propose a Hybrid Exponentially Weighted Moving Average (HEWMA) control chart based on a mixture ratio estimator of mean using a single auxiliary variable and a single auxiliary attribute (Moeen et al., [1]). We call it as Z- HEWMA control chart. The proposed control chart performance is evaluated using outof- control-Average Run Length (ARL1). The control limits of the proposed chart is based on estimator, its mean square errors. A simulated example is used to compare the proposed Z-HEWMA, traditional/simple EWMA chart and CUSUM control chart. From this study the fact is revealed that Z-HEWMA control chart shows more efficient results as compared to traditional/simple EWMA and CUSUM control charts. The Z-HEWMA chart can be used for efficient monitoring of the production process in manufacturing industries where auxiliary information about a numerical variable and an attribute is available.

Spatio-Temporal Urban Knowledge Graph Enabled Mobility Prediction

With the rapid development of the mobile communication technology, mobile trajectories of humans are massively collected by Internet service providers (ISPs) and application service providers (ASPs). On the other hand, the rising paradigm of knowledge graph (KG) provides us a promising solution to extract structured "knowledge" from massive trajectory data. In this paper, we focus on modeling users' spatio-temporal mobility patterns based on knowledge graph techniques, and predicting users' future movement based on the "knowledge" extracted from multiple sources in a cohesive manner. Specifically, we propose a new type of knowledge graph, i.e., spatio-temporal urban knowledge graph (STKG), where mobility trajectories, category information of venues, and temporal information are jointly modeled by the facts with different relation types in STKG. The mobility prediction problem is converted to the knowledge graph completion problem in STKG. Further, a complex embedding model with elaborately designed scoring functions is proposed to measure the plausibility of facts in STKG to solve the knowledge graph completion problem, which considers temporal dynamics of the mobility patterns and utilizes PoI categories as the auxiliary information and background knowledge. Extensive evaluations confirm the high accuracy of our model in predicting users' mobility, i.e., improving the accuracy by 5.04% compared with the state-of-the-art algorithms. In addition, PoI categories as the background knowledge and auxiliary information are confirmed to be helpful by improving the performance by 3.85% in terms of accuracy. Additionally, experiments show that our proposed method is time-efficient by reducing the computational time by over 43.12% compared with existing methods.

Comparing the runoff decompositions of small testbed catchments: end-member mixing analysis against hydrological modelling

This study is focused on the comparison of catchment streamflow composition simulated with three well-known rainfall-runoff (RR) models (ECOMAG, HBV, SWAT) against hydrograph decomposition onto the principal constituents evaluated from End-Member Mixing Analysis (EMMA). There used the data provided by the short-term in-situ observations at two small mountain-taiga experimental catchments located in the south of Pacific Russia. All used RR models demonstrate that two neighboring small catchments disagree significantly in mutual dynamics of the runoff fractions due to geological and landscape structure differences. The geochemical analysis confirmed the differences in runoff generation processes at both studied catchments. The assessment of proximity of the runoff constituents to the hydrograph decomposition with the EMMA that makes a basis for the RR models benchmark analysis. We applied three data aggregation intervals (season, month and pentad) to find a reasonable data generalization period ensuring results clarity. In terms of runoff composition, the most conformable RR model to EMMA is found to be ECOMAG, HBV gets close to reflect specific runoff events well enough, SWAT gives distinctive behavior against other models. The study shows that along with using the standard efficiency criteria reflected proximity of simulated and modelling values of runoff, compliance with the EMMA results might give useful auxiliary information for hydrological modelling results validation.

5G Multimedia Precision Marketing Based on the Improved Multisensor Node Collaborative Filtering Recommendation Algorithm

The rapid development of web technology has brought new problems and challenges to the recommendation system: on the one hand, the traditional collaborative filtering recommendation algorithm has been difficult to meet the personalized recommendation needs of users; on the other hand, the massive data brought by web technology provides more useful information for recommendation algorithms. How to extract features from this information, alleviate sparsity and dynamic timeliness, and effectively improve recommendation quality is a hot issue in the research of recommendation system algorithms. In view of the lack of an effective multisource information fusion mechanism in the existing research, an improved 5G multimedia precision marketing based on an improved multisensor node collaborative filtering recommendation algorithm is proposed. By expanding the input vector field, the features of users’ social relations and comment information are extracted and fused, and the problem of collaborative modelling of these two kinds of important auxiliary information is solved. The objective function is improved, the social regularization term and the internal regularization term in the vector domain are analysed and added from the perspective of practical significance and vector structure, which alleviates the overfitting problem. Experiments on a large number of real datasets show that the proposed method has higher recommendation quality than the classical and mainstream baseline algorithm.