Search

Users want to know the reliability of the recommendations; they do not accept high predictions if there is no reliability evidence. Recommender systems should provide reliability values associated with the predictions. Research into reliability measures requires the existence of simple, plausible and universal reliability quality measures. Research into recommender system quality measures has focused on accuracy. Moreover, novelty, serendipity and diversity have been studied; nevertheless there is an important lack of research into reliability/confidence quality measures. This paper proposes a reliability quality prediction measure (RPI) and a reliability quality recommendation measure (RRI). Both quality measures are based on the hypothesis that the more suitable a reliability measure is, the better accuracy results it will provide when applied. These reliability quality measures show accuracy improvements when appropriated reliability values are associated with their predictions (i.e. high reliability values associated with correct predictions or low reliability values associated with incorrect predictions). The proposed reliability quality metrics will lead to the design of brand new recommender system reliability measures. These measures could be applied to different matrix factorization techniques and to content-based, context-aware and social recommendation approaches. The recommender system reliability measures designed could be tested, compared and improved using the proposed reliability quality metrics.

Research and education in machine learning needs diverse, representative, and open datasets that contain sufficient samples to handle the necessary training, validation, and testing tasks. Currently, the Recommender Systems area includes a large number of subfields in which accuracy and beyond accuracy quality measures are continuously improved. To feed this research variety, it is necessary and convenient to reinforce the existing datasets with synthetic ones. This paper proposes a Generative Adversarial Network (GAN)-based method to generate collaborative filtering datasets in a parameterized way, by selecting their preferred number of users, items, samples, and stochastic variability. This parameterization cannot be made using regular GANs. Our GAN model is fed with dense, short, and continuous embedding representations of items and users, instead of sparse, large, and discrete vectors, to make an accurate and quick learning, compared to the traditional approach based on large and sparse input vectors. The proposed architecture includes a DeepMF model to extract the dense user and item embeddings, as well as a clustering process to convert from the dense GAN generated samples to the discrete and sparse ones, necessary to create each required synthetic dataset. The results of three different source datasets show adequate distributions and expected quality values and evolutions on the generated datasets compared to the source ones. Synthetic datasets and source codes are available to researchers.

Reliability measures associated with the prediction of the machine learning models are critical to strengthening user confidence in artificial intelligence. Therefore, those models that are able to provide not only predictions, but also reliability, enjoy greater popularity. In the field of recommender systems, reliability is crucial, since users tend to prefer those recommendations that are sure to interest them, that is, high predictions with high reliabilities. In this paper, we propose Restricted Bernoulli Matrix Factorization (ResBeMF), a new algorithm aimed at enhancing the performance of classification-based collaborative filtering. The proposed model has been compared to other existing solutions in the literature in terms of prediction quality (Mean Absolute Error and accuracy scores), prediction quantity (coverage score) and recommendation quality (Mean Average Precision score). The experimental results demonstrate that the proposed model provides a good balance in terms of the quality measures used compared to other recommendation models., Comment: Several changes performed, including a title change. 21 pages, 7 figures, 2 tables

Deep learning provides accurate collaborative filtering models to improve recommender system results. Deep matrix factorization and their related collaborative neural networks are the state-of-art in the field; nevertheless, both models lack the necessary stochasticity to create the robust, continuous, and structured latent spaces that variational autoencoders exhibit. On the other hand, data augmentation through variational autoencoder does not provide accurate results in the collaborative filtering field due to the high sparsity of recommender systems. Our proposed models apply the variational concept to inject stochasticity in the latent space of the deep architecture, introducing the variational technique in the neural collaborative filtering field. This method does not depend on the particular model used to generate the latent representation. In this way, this approach can be applied as a plugin to any current and future specific models. The proposed models have been tested using four representative open datasets, three different quality measures, and state-of-art baselines. The results show the superiority of the proposed approach in scenarios where the variational enrichment exceeds the injected noise effect. Additionally, a framework is provided to enable the reproducibility of the conducted experiments., Comment: 14 pages, 8 figures, 3 tables

The basic idea of voting protocols is that nodes query a sample of other nodes and adjust their own opinion throughout several rounds based on the proportion of the sampled opinions. In the classic model, it is assumed that all nodes have the same weight. We study voting protocols for heterogeneous weights with respect to fairness. A voting protocol is fair if the influence on the eventual outcome of a given participant is linear in its weight. Previous work used sampling with replacement to construct a fair voting scheme. However, it was shown that using greedy sampling, i.e., sampling with replacement until a given number of distinct elements is chosen, turns out to be more robust and performant. In this paper, we study fairness of voting protocols with greedy sampling and propose a voting scheme that is asymptotically fair for a broad class of weight distributions. We complement our theoretical findings with numerical results and present several open questions and conjectures., Comment: 31 pages, 12 figures

Multivariate regression models and ANOVA are probably the most frequently applied methods of all statistical analyses. We study the case where the predictors are qualitative variables, and the response variable is quantitative. In this case, we propose an alternative to the classic approaches that does not assume homoscedasticity but assumes that a Markov chain can describe the covariates' correlations. This approach transforms the dependent covariates using a change of measure to independent covariates. The transformed estimates allow a pairwise comparison of the mean and variance of the contribution of different values of the covariates. We show that under standard moment conditions, the estimators are asymptotically normally distributed. We test our method with data from simulations and apply it to several classic data sets., Comment: 25 pages, 7 figures

The production network under examination consists of a number of workstations. Each workstation is a parallel configuration of machines performing the same kind of tasks on a given part. Parts move from one workstation to another and at each workstation a part is assigned randomly to a machine. We assume that the production network is acyclic, that is, a part does not return to a workstation where it previously received service. Furthermore, we assume that the quality of the end product is additive, that is, the sum of the quality contributions of the machines along the production path. The contribution of each machine is modeled by a separate random variable. Our main result is the construction of estimators that allow pairwise and multiple comparison of the means and variances of machines in the same workstation. These comparisons then may lead to the identification of unreliable machines. We also discuss the asymptotic distributions of the estimators that allow the use of standard statistical tests and decision making.

In this paper we prove that a uniformly distributed random circular automaton $\mathcal{A}_n$ of order $n$ synchronizes with high probability (whp). More precisely, we prove that $$ \mathbb{P}\left[\mathcal{A}_n \text{ synchronizes}\right] = 1- O\left(\frac{1}{n}\right). $$ The main idea of the proof is to translate the synchronization problem into properties of a random matrix; these properties are then handled with tools of the probabilistic method. Additionally, we provide an upper bound for the probability of synchronization of circular automata in terms of chromatic polynomials of circulant graphs., Comment: 22 pages

Growing mixtures of annual arable crop species or genotypes is a promising way to improve crop production without increasing agricultural inputs. To design optimal crop mixtures, choices of species, genotypes, sowing proportion, plant arrangement, and sowing date need to be made but field experiments alone are not sufficient to explore such a large range of factors. Crop modeling allows to study, understand and ultimately design cropping systems and is an established method for sole crops. Recently, modeling started to be applied to annual crop mixtures as well. Here, we review to what extent crop simulation models and individual-based models are suitable to capture and predict the specificities of annual crop mixtures. We argued that: 1) The crop mixture spatio-temporal heterogeneity (influencing the occurrence of ecological processes) determines the choice of the modeling approach (plant or crop centered). 2) Only few crop models (adapted from sole crop models) and individual-based models currently exist to simulate annual crop mixtures. 3) Crop models are mainly used to address issues related to crop mixtures management and to the integration of crop mixtures into larger scales such as the rotation, whereas individual-based models are mainly used to identify plant traits involved in crop mixture performance and to quantify the relative contribution of the different ecological processes (niche complementarity, facilitation, competition, plasticity) to crop mixture functioning. This review highlights that modeling of annual crop mixtures is in its infancy and gives to model users some important keys to choose the model based on the questions they want to answer, with awareness of the strengths and weaknesses of each of the modeling approaches., Comment: 42 pages, 5 figures

The jigsaw percolation process, introduced by Brummitt, Chatterjee, Dey and Sivakoff, was inspired by a group of people collectively solving a puzzle. It can also be seen as a measure of whether two graphs on a common vertex set are "jointly connected". In this paper we consider the natural generalisation of this process to an arbitrary number of graphs on the same vertex set. We prove that if these graphs are random, then the jigsaw percolation process exhibits a phase transition in terms of the product of the edge probabilities. This generalises a result of Bollob\'as, Riordan, Slivken and Smith., Comment: 13 pages