• Predictive Accuracy Measures. These measures evaluate how close the recommender system came to predicting actual rating/utility values. • Classification Accuracy Measures. These measures evaluate the frequency with which a recommender system makes correct/incorrect decisions regarding items. • Rank Accuracy Measures. These measures evaluate the correctness of the ordering of items performed b...

The Conjugate Gradient Squared (CGS) is an iterative method for solving nonsymmetric linear systems of equations. However, during the iteration large residual norms may appear, which may lead to inaccurate approximate solutions or may even deteriorate the convergence rate. Instead of squaring the Bi-CG polynomial as in CGS, we propose to consider products of two nearby Bi-CG polynomials which l...

Vapnik described the “three main learning problems” of pattern recognition, regression estimation and density estimation. These are defined in terms of the loss functions used to evaluate performance (0-1 loss, squared loss and log loss respectively). But there are many other loss functions one could use. In this chapter I will summarise some recent work by myself and colleagues studying the th...

This paper discusses a local parametric modeling by the use of U-divergence in a statistical pattern recognition. The class of U-divergence measures commonly has an empirical loss function in a simple form including Kullback-Leibler divergence, the power divergence and mean squared error. We propose a minimization algorithm for parametric models of sequentially increasing dimension by incorpora...

The deontic square of oppositions describes relations between four deontic concepts: ban, permission, obligation, and release from obligation. It is argued that people use these relations not only when they interpret deontic social rules, but also when they reason from given rules. Data from several studies are presented that corroborate this argument.

Applications of elliptic curve cryptography to anonymity, privacy and censorship circumvention call for methods to represent uniformly random points on elliptic curves as uniformly random bit strings, so that, for example, ECC network traffic can masquerade as random traffic. At ACM CCS 2013, Bernstein et al. proposed an efficient approach, called “Elligator,” to solving this problem for arbitr...