Fuzzy Classification Using Pattern Discovery
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é
Rule-based classifiers allow rationalization of classifications made. This in turn improves understanding which is essential for effective decision support. As a rule based classifier, the pattern discovery (PD) algorithm functions well in discrete, nominal and continuous data domains. A drawback when using PD as a classifier for decision support is that it has an unbounded decision space that confounds the understanding of the degree of support for a decision. Incorporating PD into a fuzzy inference system (FIS) allows the the degree of support for a decision to be expressed with intuitively understandable terms. In addition, using discrete algorithms in continuous domains can result in reduced accuracy due to quantization. Fuzzification reduces this ldquocost of quantizationrdquo and improves classification performance. In this work, the PD algorithm was used as a source of rules for a series of FISs implemented using different rule weighting and defuzzification schemes, each providing a linguistic basis for rule description and a bounded space for expression of decision support. The output of each FIS consists of a suggested outcome, a strong confidence metric describing suggestions within this space and a linguistic expression of the rules. This constitutes a stronger basis for decision making than that provided by PD alone. A variety of synthetic, continuous class distributions with varying degrees of separation was used to evaluate the performance of fuzzy, PD, back-propagation and Bayesian classifiers. Overall, the accuracy of the fuzzy system was found to be similar, but slightly below, that of the inherently continuous valued classifiers and was somewhat improved with respect to the PD classifiers. For the difficult spiral class distributions studied, the fuzzy classifiers were able to make more classifications than the PD classifiers. The correct classification rates for the fuzzy classifiers were similar across the various rule weighting and defuzzification schemes, demonstrating the strength of the statistical method for rule generation. Analysis of several real-world data sets shows that a PD-based FIS has comparable performance to a neuro-fuzzy system. The use of a PD based FIS however, provides insight into the structure of the data analyzed not available through the other approaches.
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,000 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,001 | 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