ScholarGate
Asistente

Comparar métodos

Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.

FP-Growth Explicable×Reglas de Asociación Explicables×
CampoAprendizaje automáticoAprendizaje automático
FamiliaMachine learningMachine learning
Año de origen2000 (FP-Growth); XAI augmentation emerged ~2018–present1993 (rules); 2010s (XAI framing)
Autor originalHan, J., Pei, J., & Yin, Y. (FP-Growth); XAI augmentation from the interpretable ML communityAgrawal, R., Imielinski, T., & Swami, A. (foundational); XAI framing: broader community (2010s–present)
TipoExplainable frequent pattern miningInterpretable pattern mining / XAI technique
Fuente seminalHan, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI ↗Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216. DOI ↗
AliasXAI-FP-Growth, interpretable frequent pattern mining, explainable frequent itemset mining, transparent FP-GrowthXAI association rules, interpretable association rules, rule-based explanation mining, transparent association rule learning
Relacionados56
ResumenExplainable FP-Growth augments the classic FP-Growth frequent-pattern mining algorithm with post-hoc interpretability tools — such as rule importance scores, visual pattern trees, and counterfactual explanations — so analysts can not only discover frequent itemsets and association rules but also understand why specific patterns matter, which items drive rule confidence, and how to communicate findings transparently to stakeholders.Explainable Association Rules leverages the inherently symbolic, if-then structure of association rule mining to provide human-readable explanations of data patterns or black-box model decisions. Because each rule explicitly states its antecedent and consequent together with support, confidence, and lift, the outputs are natively interpretable without requiring a secondary post-hoc surrogate.
ScholarGateConjunto de datos
  1. v1
  2. 2 Fuentes
  3. PUBLISHED
  1. v1
  2. 2 Fuentes
  3. PUBLISHED

Ir a la búsqueda Descargar diapositivas

ScholarGateComparar métodos: Explainable FP-Growth · Explainable Association Rules. Recuperado el 2026-06-17 de https://scholargate.app/es/compare