Using negotiable features for prescription problems

DOI10.1007/s00607-010-0129-5zbMath1234.68360OpenAlexW2072838540WikidataQ62630550 ScholiaQ62630550MaRDI QIDQ644840

José Hernández-Orallo, Antonio Bella, María José Ramírez-Quintana, César Ferri

Publication date: 7 November 2011

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-010-0129-5

zbMATH Keywords

CRMrankingMonte Carlo methodglobal optimisationdata miningnegotiationprobability estimationfunction inversion problemnegotiable featuresprofit maximisation

Mathematics Subject Classification ID

Uses Software

• C4.5

Cites Work

• A Theory of Exit in Duopoly
• Sample Selection Bias as a Specification Error
• The Monte Carlo Method
• Machine Learning: ECML 2003
• Data mining. Concepts and techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using negotiable features for prescription problems