Arrow Research search

Author name cluster

David Bell

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

6 papers
1 author row

Possible papers

6

NeurIPS Conference 2024 Conference Paper

Discovering plasticity rules that organize and maintain neural circuits

  • David Bell
  • Alison Duffy
  • Adrienne Fairhall

Intrinsic dynamics within the brain can accelerate learning by providing a prior scaffolding for dynamics aligned with task objectives. Such intrinsic dynamics would ideally self-organize and self-sustain in the face of biological noise including synaptic turnover and cell death. An example of such dynamics is the formation of sequences, a ubiquitous motif in neural activity. The sequence-generating circuit in zebra finch HVC provides a reliable timing scaffold for motor output in song and demonstrates a remarkable capacity for unsupervised recovery following perturbation. Inspired by HVC, we seek a local plasticity rule capable of organizing and maintaining sequence-generating dynamics despite continual network perturbations. We adopt a meta-learning approach introduced by Confavreux et al, which parameterizes a learning rule using basis functions constructed from pre- and postsynaptic activity and synapse size, with tunable time constants. Candidate rules are simulated within initially random networks, and their fitness is evaluated according to a loss function that measures the fidelity with which the resulting dynamics encode time. We use this approach to introduce biological noise, forcing meta-learning to find robust solutions. We first show that, in the absence of perturbations, meta-learning identifies a temporally asymmetric generalization of Oja's rule that reliably organizes sparse sequential activity. When synaptic turnover is introduced, the learned rule incorporates a form of homeostasis, better maintaining robust sequential dynamics relative to other previously proposed rules. Additionally, inspired by recent findings demonstrating that the strength of projections from inhibitory interneurons in HVC also dynamically responds to perturbations, we explore the role of inhibitory plasticity in sequence-generating circuits. We find that learned plasticity adjusts both excitation and inhibition in response to manipulations, outperforming rules applied only to excitatory connections. We demonstrate how plasticity acting on both excitatory and inhibitory synapses can better shape excitatory cell dynamics to scaffold timing representations.

IS Journal 2018 Journal Article

Towards Musicologist-Driven Mining of Handwritten Scores

  • Masahiro Niitsuma
  • Yo Tomita
  • Wei Qi Yan
  • David Bell

Historical musicologists have been seeking objective and powerful techniques to collect, analyze, and verify their findings for many decades. The aim of this study was to show the importance of such domain-specific problems to achieve actionable knowledge discovery in the real world. Our focus is on finding evidence for the chronological ordering of J. S. Bachs manuscripts, by proposing a musicologist-driven mining method for extracting quantitative information from early music manuscripts. Bachs C-clefs were extracted from a wide range of manuscripts under the direction of domain experts, and with these, the classification of C-clefs was conducted. The proposed methods were evaluated on a dataset containing over 1000 clefs extracted from J. S. Bachs manuscripts. The results show more than 70% accuracy for dating J. S. Bachs manuscripts. Dating of Bachs lost manuscripts was quantitatively hypothesized, providing a rough barometer to be combined with other evidence to evaluate musicologists hypotheses, and the usability of this domain-driven approach is demonstrated.

AIJ Journal 2008 Journal Article

The combination of multiple classifiers using an evidential reasoning approach

  • Yaxin Bi
  • Jiwen Guan
  • David Bell

In many domains when we have several competing classifiers available we want to synthesize them or some of them to get a more accurate classifier by a combination function. In this paper we propose a ‘class-indifferent’ method for combining classifier decisions represented by evidential structures called triplet and quartet, using Dempster's rule of combination. This method is unique in that it distinguishes important elements from the trivial ones in representing classifier decisions, makes use of more information than others in calculating the support for class labels and provides a practical way to apply the theoretically appealing Dempster–Shafer theory of evidence to the problem of ensemble learning. We present a formalism for modelling classifier decisions as triplet mass functions and we establish a range of formulae for combining these mass functions in order to arrive at a consensus decision. In addition we carry out a comparative study with the alternatives of simplet and dichotomous structure and also compare two combination methods, Dempster's rule and majority voting, over the UCI benchmark data, to demonstrate the advantage our approach offers.

IS Journal 2007 Journal Article

Domain-Driven, Actionable Knowledge Discovery

  • Longbing Cao
  • Chengqi Zhang
  • Qiang Yang
  • David Bell
  • Michail Vlachos
  • Bahar Taneri
  • Eamonn Keogh
  • Philip S. Yu

Data mining increasingly faces complex challenges in the real-life world of business problems and needs. The gap between business expectations and R&D results in this area involves key aspects of the field, such as methodologies, targeted problems, pattern interestingness, and infrastructure support. Both researchers and practitioners are realizing the importance of domain knowledge to close this gap and develop actionable knowledge for real user needs.

AIJ Journal 2002 Journal Article

Learning Bayesian networks from data: An information-theory based approach

  • Jie Cheng
  • Russell Greiner
  • Jonathan Kelly
  • David Bell
  • Weiru Liu

This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop efficient algorithms that can effectively learn Bayesian networks, requiring only polynomial numbers of conditional independence (CI) tests in typical cases. We provide precise conditions that specify when these algorithms are guaranteed to be correct as well as empirical evidence (from real world applications and simulation tests) that demonstrates that these systems work efficiently and reliably in practice.

IJCAI Conference 1999 Conference Paper

A Lattice Machine Approach to Automated Casebase Design: Marrying Lazy and Eager Learning

  • Hui Wang
  • Werner Dubitzky
  • Ivo Duntsch
  • David Bell

Case-based reasoning (CBR) is concerned with solving new problems by adapting solutions that worked for similar problems in the past. Years of experience in building and fielding C B R systems have shown that the "rase approach" is not free from problems. It has been realized that the knowledge engineering effort required for designing many real-world easebases can be prohibitively high. Based on the wide-spread use of databases and powerful machine learning methods, some C B R researchers have been investigating the possibility of designing casebases automatically. This paper proposes a flexible model for the automatic discovery of abstract cases from data. bases based on the Lattice Machine. It also proposes an efficient and effective algorithm for retrieving such cases. Besides the known benefits associated with abstract cases, the main advantages of this approach are that the discovery process is fully automated (no knowledge engineering costs). K e y w o r d s: case-based reasoning, machine learning, knowledge acquisition, automated modeling