James Cussens
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
James Cussens has a total of 67 co-authors. Here are the top co-authors by number of shared publications:
- Alexandra Ciocănel
University of York
7 shared publications - David Beer
University of York
7 shared publications - Mark Bartlett
University of York
6 shared publications - Roger Burrows
University of Bristol
6 shared publications - Alison Wallace
University of York
5 shared publications - Milan Studený
The Czech Academy of Sciences, Institute of Information Theory and Automation, Prague 8, Czech Republic
3 shared publications
Latest Publications
- Open Access
- 15 October 2026
- Published by Taylor & Francis in Housing, Theory and Society
- p. 1-12
Speculating on Speculation? Thinking Within and Beyond the Mortgage Present a Reply to the Comments on ‘Envisioning Mortgage Futures’
When we wrote our article “Envisioning Mortgage Futures”, we were in the concluding stages of Code Encounters, our Nuffield Foundation-funded project on algorithmic risk profiling in housing, which...
- 15 October 2026
- Published by Taylor & Francis in Housing, Theory and Society
- p. 1-12
Open AccessSpeculating on Speculation? Thinking Within and Beyond the Mortgage Present a Reply to the Comments on ‘Envisioning Mortgage Futures’
When we wrote our article “Envisioning Mortgage Futures”, we were in the concluding stages of Code Encounters, our Nuffield Foundation-funded project on algorithmic risk profiling in housing, which...
- Open Access
- 12 October 2026
- Published by Taylor & Francis in Housing, Theory and Society
- p. 1-23
Envisioning Mortgage Futures
Each year, the digital bank Monzo releases Monzo Unwrapped, a personalized spending summary akin to the personalized account of music taste provided by Spotify Wrapped, which engagingly reveals use...
- 12 October 2026
- Published by Taylor & Francis in Housing, Theory and Society
- p. 1-23
Open AccessEnvisioning Mortgage Futures
Each year, the digital bank Monzo releases Monzo Unwrapped, a personalized spending summary akin to the personalized account of music taste provided by Spotify Wrapped, which engagingly reveals use...
- Open Access
- 20 September 2026
- Published by Taylor & Francis in Housing and Society
- p. 1-19
Algorithmic risk and social housing access in England
Across England’s housing system, decisions about who gets access to a home are increasingly mediated by algorithmic risk profiling tools and, in a small minority of cases, open banking (OB) (Wallac...
- 20 September 2026
- Published by Taylor & Francis in Housing and Society
- p. 1-19
Open AccessAlgorithmic risk and social housing access in England
Across England’s housing system, decisions about who gets access to a home are increasingly mediated by algorithmic risk profiling tools and, in a small minority of cases, open banking (OB) (Wallac...
- 23 December 2025
- Published by Taylor & Francis in International Journal of Housing Policy
- p. 1-19
Understanding the role of open banking in digital tenant profiling
- 23 December 2025
- Published by Taylor & Francis in International Journal of Housing Policy
- p. 1-19
Understanding the role of open banking in digital tenant profiling
- 24 June 2025
- Published by The R Foundation
fastpolicytree: Constructs Policy Trees from Covariate and Reward Data
Constructs optimal policy trees which provide a rule-based treatment prescription policy. Input is covariate and reward data, where, typically, the rewards will be doubly robust reward estimates. This package aims to construct optimal policy trees more quickly than the existing 'policytree' package and is intended to be used alongside that package. For more details see Cussens, Hatamyar, Shah and Kreif (2025) .
- 24 June 2025
- Published by The R Foundation
fastpolicytree: Constructs Policy Trees from Covariate and Reward Data
Constructs optimal policy trees which provide a rule-based treatment prescription policy. Input is covariate and reward data, where, typically, the rewards will be doubly robust reward estimates. This package aims to construct optimal policy trees more quickly than the existing 'policytree' package and is intended to be used alongside that package. For more details see Cussens, Hatamyar, Shah and Kreif (2025) .
- Open Access
- 27 January 2025
- Published by Taylor & Francis in Housing Studies
- Vol. 41 (2) , 331-351
Algorithmic tenancies and the ordinal tenant: digital risk-profiling in England’s private rented sector
- 27 January 2025
- Published by Taylor & Francis in Housing Studies
- Vol. 41 (2) , 331-351
Open AccessAlgorithmic tenancies and the ordinal tenant: digital risk-profiling in England’s private rented sector
- Open Access
- 3 June 2024
- Published by Taylor & Francis in Information, Communication & Society
- Vol. 27 (9) , 1737-1742
Algorithmic dwelling? Digital technologies as intermediaries in housing access and the enactment of home
- 3 June 2024
- Published by Taylor & Francis in Information, Communication & Society
- Vol. 27 (9) , 1737-1742
Open AccessAlgorithmic dwelling? Digital technologies as intermediaries in housing access and the enactment of home
- Open Access
- 20 February 2024
- Published by Taylor & Francis in Information, Communication & Society
- Vol. 27 (9) , 1810-1825
Open Banking and data reassurance: the case of tenant referencing in the UK
- 20 February 2024
- Published by Taylor & Francis in Information, Communication & Society
- Vol. 27 (9) , 1810-1825
Open AccessOpen Banking and data reassurance: the case of tenant referencing in the UK
- 1 November 2021
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 138, 188-203
The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
- 1 November 2021
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 138, 188-203
The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
- Open Access
On Pruning for Score-Based Bayesian Network Structure Learning
Many algorithms for score-based Bayesian network structure learning (BNSL), in particular exact ones, take as input a collection of potentially optimal parent sets for each variable in the data. Constructing such collections naively is computationally intensive since the number of parent sets grows exponentially with the number of variables. Thus, pruning techniques are not only desirable but essential. While good pruning rules exist for the Bayesian Information Criterion (BIC), current results for the Bayesian Dirichlet equivalent uniform (BDeu) score reduce the search space very modestly, hampering the use of the (often preferred) BDeu. We derive new non-trivial theoretical upper bounds for the BDeu score that considerably improve on the state-of-the-art. Since the new bounds are mathematically proven to be tighter than previous ones and at little extra computational cost, they are a promising addition to BNSL methods.
Open AccessOn Pruning for Score-Based Bayesian Network Structure Learning
Many algorithms for score-based Bayesian network structure learning (BNSL), in particular exact ones, take as input a collection of potentially optimal parent sets for each variable in the data. Constructing such collections naively is computationally intensive since the number of parent sets grows exponentially with the number of variables. Thus, pruning techniques are not only desirable but essential. While good pruning rules exist for the Bayesian Information Criterion (BIC), current results for the Bayesian Dirichlet equivalent uniform (BDeu) score reduce the search space very modestly, hampering the use of the (often preferred) BDeu. We derive new non-trivial theoretical upper bounds for the BDeu score that considerably improve on the state-of-the-art. Since the new bounds are mathematically proven to be tighter than previous ones and at little extra computational cost, they are a promising addition to BNSL methods.