P-Prism: a computationally efficient approach to scaling up classification rule induction

Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unseen data. Alternative algorithms have been developed such as the Prism algorithm. Prism constructs modular rules which produce qualitatively better rules than rules induced by TDIDT. However, along with the increasing size of databases, many existing rule learning algorithms have proved to be computational expensive on large datasets. To tackle the problem of scalability, parallel classification rule induction algorithms have been introduced. As TDIDT is the most popular classifier, even though there are strongly competitive alternative algorithms, most parallel approaches to inducing classification rules are based on TDIDT. In this paper we describe work on a distributed classifier that induces classification rules in a parallel manner based on Prism.

Towards a computationally efficient approach to modular classification rule induction

Induction of classification rules is one of the most important technologies in data mining. Most of the work in this field has concentrated on the Top Down Induction of Decision Trees (TDIDT) approach. However, alternative approaches have been developed such as the Prism algorithm for inducing modular rules. Prism often produces qualitatively better rules than TDIDT but suffers from higher computational requirements. We investigate approaches that have been developed to minimize the computational requirements of TDIDT, in order to find analogous approaches that could reduce the computational requirements of Prism.

Depth to mate and the 50-move rule

The most popular endgame tables (EGTs) documenting ‘DTM’ Depth to Mate in chess endgames are those of Eugene Nalimov but these do not recognise the FIDE 50-move rule ‘50mr’. This paper marks the creation by the first author of EGTs for sub-6-man (s6m) chess and beyond which give DTM as affected by the ply count pc. The results are put into the context of previous work recognising the 50mr and are compared with the original unmoderated DTM results. The work is also notable for being the first EGT generation work to use the functional programming language HASKELL.

The Léger ruling as another example of the ECJ’s disappointingly reticent approach to the protection of the rights of LGB persons under EU law

In the 1980s, in the midst of the AIDS epidemic, many countries introduced lifetime bans on blood donations by men who had sexual relations with men (MSM). These blanket bans have, recently, begun to be challenged and, as a result, many countries have either relaxed them or completely abolished them. The case under examination (Léger ) is another instance of questioning the legality of such a ban. In particular, in this case, the European Court of Justice was called on to rule on whether a measure such as the French lifetime exclusion from blood donation of the MSM population that was at issue before the referring court is contrary to EU law. The Court ruled that although discriminatory on the ground of sexual orientation, such a ban may be justified in certain circumstances, and left it to the national court to make the final decision. This article seeks to analyse the case and to explain why, in the author’s view, the Court can be accused of—once more—not going far enough in the protection of lesbian, gay and bisexual (LGB) rights.