Uncertainty Models in the Context of Biometric Authentication Systems
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
This thesis focuses on developing computationally-efficient machine reasoning models. These models are based on causal graphs with various metrics of uncertainty. The application of such models is decision-making in a multi-sensor, multi-source system. In particular, we consider examples of biometric-enabled systems for human identification where false passes and false rejects are always present. Two main problems are addressed in this thesis: the potential lack of data that is needed to build an accurate model, and the computational complexity (worst case computing time) of the process of deriving conclusions from the model (uncertainty inference). To tackle the first problem, this research suggests the use of advanced models of uncertainty. These models require the development of a taxonomy of various approaches to quantifying uncertainty with the aim of being tolerant to incomplete data. Tasks related to uncertainty model design include but are not limited to: • Model training, which is the generation of uncertainty models from raw data and expert knowledge. • Major approaches to quantifying uncertainty include but are not limited to: probability distributions, fuzzy probability distributions, credal sets, probability interval distributions, Dempster-Shafer models, and Dezert-Smarandache models. To address the second problem, this work develops a platform and software to perform the calculations related to the uncertainty models in a computationally-efficient manner. Tasks related to the usage of uncertainty models include but are not limited to: • Uncertainty inference, which is the calculation of likely outcomes and uncertainty values when provided with both a model of the scenario under consideration and observed evidence. This thesis covers some approximate approaches to uncertainty inference. • Data/information fusion, which is a subset of uncertainty inference that involves the process of collecting uncertainty values or observations from various sensors, and then generating a “recommendation”. To address the problem of computational complexity, approximate approaches will be developed and utilized in this thesis. These approximate approaches are formulated with the aim of reducing the computational complexity, while maintaining a reasonable degree of accuracy. Examples of applications of the proposed theoretical developments, including risk assessment tasks in biometric-enabled systems, are provided.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,001 | 0,002 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,003 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle