B Confidence tagging

Introduction

This b tagging method uses the simulation to find the confidence that any given track comes from a b, a c, or a light quark. By contrast, the Brown and Frank algorithm instead ask whether or not the track comes from the primary. The difference has allowed the inclusion of several kinematic variables.

These track confidences are then multiplied together to give three event (or hemisphere) confidences, which are normalised so that they sum to one.

This B tagging code is embedded in AABTAG. It is a new option, based on the algorithm presented in DELPHI note 95-167 ( PS ).

This code is now released on shift

How to use it?

You can find more information here . There are various options which can be tried.

B tag performance

The output of this tag is a number between zero and one. The following pages show you the results of cutting at a particular minimum tag value.

Efficiency to tag b jets

Efficiency to tag b events

Efficiency to tag uds events

Back to Bill's home page

Please mail me what information you would like to see here!