Building ensemble classifiers using belief functions and OWA operators

DOI10.1007/s00500-007-0227-2zbMath1133.68406OpenAlexW1995911512MaRDI QIDQ2476651

Ronald R. Yager, Marek Z. Reformat

Publication date: 12 March 2008

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-007-0227-2

zbMATH Keywords

Dempster-Shafer evidence theoryBelief functionsEnsemble systemsOrdered weighted averaging operatorRule-based models

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items

Probability estimation in the framework of intuitionistic fuzzy evidence theory ⋮ LINGUISTIC AGGREGATION OPERATORS FOR LINGUISTIC DECISION MAKING BASED ON THE DEMPSTER-SHAFER THEORY OF EVIDENCE ⋮ A new rule to combine dependent bodies of evidence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bagging predictors
• Data mining. Concepts and techniques
• A computational approach to fuzzy quantifiers in natural languages
• Families of OWA operators
• The transferable belief model
• Use of Dempster-Shafer theory to combine classifiers which use different class boundaries
• Extending multicriteria decision making by mixing t-norms and OWA operators
• DEMPSTER COMBINATION RULE WITH BOOLEAN-LIKE PROCESSED BELIEF FUNCTIONS
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• Combining Pattern Classifiers
• Nearest neighbor pattern classification
• A fuzzy-based multimodel system for reasoning about the number of software defects
• On the independence requirement in Dempster-Shafer theory for combining classifiers providing statistical evidence
• Data mining, rough sets and granular computing