Loading…
Using negotiable features for prescription problems
Data mining is usually concerned on the construction of accurate models from data, which are usually applied to well-defined problems that can be clearly isolated and formulated independently from other problems. Although much computational effort is devoted for their training and statistical evalua...
Saved in:
Published in: | Computing 2011-02, Vol.91 (2), p.135-168 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c377t-153177781959299a9e8824f17bbdbff0be258d568edbe19e0e566b6ff4a21d233 |
---|---|
cites | cdi_FETCH-LOGICAL-c377t-153177781959299a9e8824f17bbdbff0be258d568edbe19e0e566b6ff4a21d233 |
container_end_page | 168 |
container_issue | 2 |
container_start_page | 135 |
container_title | Computing |
container_volume | 91 |
creator | Bella, Antonio Ferri, Cèsar Hernández-Orallo, José Ramírez-Quintana, María José |
description | Data mining is usually concerned on the construction of accurate models from data, which are usually applied to well-defined problems that can be clearly isolated and formulated independently from other problems. Although much computational effort is devoted for their training and statistical evaluation, model deployment can also represent a scientific problem, when several data mining models have to be used together, constraints appear on their application, or they have to be included in decision processes based on different rules, equations and constraints. In this paper we address the problem of combining several data mining models for objects and individuals in a common scenario, where not only we can affect decisions as the result of a change in one or more data mining models, but we have to solve several optimisation problems, such as choosing one or more inputs to get the best overall result, or readjusting probabilities after a failure. We illustrate the point in the area of customer relationship management (CRM), where we deal with the general problem of prescription between products and customers. We introduce the concept of negotiable feature, which leads to an extended taxonomy of CRM problems of greater complexity, since each new negotiable feature implies a new degree of freedom. In this context, we introduce several new problems and techniques, such as data mining model inversion (by ranging on the inputs or by changing classification problems into regression problems by function inversion), expected profit estimation and curves, global optimisation through a Monte Carlo method, and several negotiation strategies in order to solve this maximisation problem. |
doi_str_mv | 10.1007/s00607-010-0129-5 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_861561918</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>861561918</sourcerecordid><originalsourceid>FETCH-LOGICAL-c377t-153177781959299a9e8824f17bbdbff0be258d568edbe19e0e566b6ff4a21d233</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouK7-AG9FEE_VSdJ8HWXxCxa8uOAtpO1k6dJt16Q9-O9NqSgIHkIS5pl3hoeQSwq3FEDdRQAJKgcK6TCTiyOyoAWXuQChjskCpkqhxfspOYtxBwCMa7MgfBObbpt1uO2HxpUtZh7dMAaMme9DdkiPKjSHoem79OkTsI_n5MS7NuLF970km8eHt9Vzvn59elndr_OKKzXkVHCqlNLUCMOMcQa1ZoWnqizr0nsokQldC6mxLpEaBBRSltL7wjFaM86X5GbOTYM_RoyD3TexwrZ1HfZjtFpSIamhOpFXf8hdP4YuLWd1YXjCFCSIzlAV-hgDensIzd6FT0vBThLtLNEmVXaSaEXquf4OdrFyrQ-uq5r405gcquR34tjMxVTqthh-F_g__AsvXIAp</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>849315670</pqid></control><display><type>article</type><title>Using negotiable features for prescription problems</title><source>ABI/INFORM Global (ProQuest)</source><source>Springer Nature</source><source>BSC - Ebsco (Business Source Ultimate)</source><creator>Bella, Antonio ; Ferri, Cèsar ; Hernández-Orallo, José ; Ramírez-Quintana, María José</creator><creatorcontrib>Bella, Antonio ; Ferri, Cèsar ; Hernández-Orallo, José ; Ramírez-Quintana, María José</creatorcontrib><description>Data mining is usually concerned on the construction of accurate models from data, which are usually applied to well-defined problems that can be clearly isolated and formulated independently from other problems. Although much computational effort is devoted for their training and statistical evaluation, model deployment can also represent a scientific problem, when several data mining models have to be used together, constraints appear on their application, or they have to be included in decision processes based on different rules, equations and constraints. In this paper we address the problem of combining several data mining models for objects and individuals in a common scenario, where not only we can affect decisions as the result of a change in one or more data mining models, but we have to solve several optimisation problems, such as choosing one or more inputs to get the best overall result, or readjusting probabilities after a failure. We illustrate the point in the area of customer relationship management (CRM), where we deal with the general problem of prescription between products and customers. We introduce the concept of negotiable feature, which leads to an extended taxonomy of CRM problems of greater complexity, since each new negotiable feature implies a new degree of freedom. In this context, we introduce several new problems and techniques, such as data mining model inversion (by ranging on the inputs or by changing classification problems into regression problems by function inversion), expected profit estimation and curves, global optimisation through a Monte Carlo method, and several negotiation strategies in order to solve this maximisation problem.</description><identifier>ISSN: 0010-485X</identifier><identifier>EISSN: 1436-5057</identifier><identifier>DOI: 10.1007/s00607-010-0129-5</identifier><identifier>CODEN: CMPTA2</identifier><language>eng</language><publisher>Vienna: Springer Vienna</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Artificial Intelligence ; Computation ; Computer Appl. in Administrative Data Processing ; Computer Communication Networks ; Computer Science ; Computer science; control theory; systems ; Customer relationship management ; Customers ; Data mining ; Exact sciences and technology ; Failure ; Information Systems Applications (incl.Internet) ; Inversions ; Linear programming ; Mathematical analysis ; Mathematical models ; Mathematics ; Methods of scientific computing (including symbolic computation, algebraic computation) ; Monte Carlo methods ; Monte Carlo simulation ; Neural networks ; Numerical analysis ; Numerical analysis. Scientific computation ; Numerical methods in mathematical programming, optimization and calculus of variations ; Numerical methods in optimization and calculus of variations ; Operations research ; Optimization ; Probability ; Sciences and techniques of general use ; Software Engineering ; Studies ; Taxonomy ; Theoretical computing ; Variables</subject><ispartof>Computing, 2011-02, Vol.91 (2), p.135-168</ispartof><rights>Springer-Verlag 2010</rights><rights>2015 INIST-CNRS</rights><rights>Springer-Verlag 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c377t-153177781959299a9e8824f17bbdbff0be258d568edbe19e0e566b6ff4a21d233</citedby><cites>FETCH-LOGICAL-c377t-153177781959299a9e8824f17bbdbff0be258d568edbe19e0e566b6ff4a21d233</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/849315670/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/849315670?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>309,310,314,780,784,789,790,11686,23928,23929,25138,27922,27923,36058,36059,44361,74665</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23870575$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Bella, Antonio</creatorcontrib><creatorcontrib>Ferri, Cèsar</creatorcontrib><creatorcontrib>Hernández-Orallo, José</creatorcontrib><creatorcontrib>Ramírez-Quintana, María José</creatorcontrib><title>Using negotiable features for prescription problems</title><title>Computing</title><addtitle>Computing</addtitle><description>Data mining is usually concerned on the construction of accurate models from data, which are usually applied to well-defined problems that can be clearly isolated and formulated independently from other problems. Although much computational effort is devoted for their training and statistical evaluation, model deployment can also represent a scientific problem, when several data mining models have to be used together, constraints appear on their application, or they have to be included in decision processes based on different rules, equations and constraints. In this paper we address the problem of combining several data mining models for objects and individuals in a common scenario, where not only we can affect decisions as the result of a change in one or more data mining models, but we have to solve several optimisation problems, such as choosing one or more inputs to get the best overall result, or readjusting probabilities after a failure. We illustrate the point in the area of customer relationship management (CRM), where we deal with the general problem of prescription between products and customers. We introduce the concept of negotiable feature, which leads to an extended taxonomy of CRM problems of greater complexity, since each new negotiable feature implies a new degree of freedom. In this context, we introduce several new problems and techniques, such as data mining model inversion (by ranging on the inputs or by changing classification problems into regression problems by function inversion), expected profit estimation and curves, global optimisation through a Monte Carlo method, and several negotiation strategies in order to solve this maximisation problem.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Artificial Intelligence</subject><subject>Computation</subject><subject>Computer Appl. in Administrative Data Processing</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Customer relationship management</subject><subject>Customers</subject><subject>Data mining</subject><subject>Exact sciences and technology</subject><subject>Failure</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Inversions</subject><subject>Linear programming</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Mathematics</subject><subject>Methods of scientific computing (including symbolic computation, algebraic computation)</subject><subject>Monte Carlo methods</subject><subject>Monte Carlo simulation</subject><subject>Neural networks</subject><subject>Numerical analysis</subject><subject>Numerical analysis. Scientific computation</subject><subject>Numerical methods in mathematical programming, optimization and calculus of variations</subject><subject>Numerical methods in optimization and calculus of variations</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Probability</subject><subject>Sciences and techniques of general use</subject><subject>Software Engineering</subject><subject>Studies</subject><subject>Taxonomy</subject><subject>Theoretical computing</subject><subject>Variables</subject><issn>0010-485X</issn><issn>1436-5057</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp1kE1LxDAQhoMouK7-AG9FEE_VSdJ8HWXxCxa8uOAtpO1k6dJt16Q9-O9NqSgIHkIS5pl3hoeQSwq3FEDdRQAJKgcK6TCTiyOyoAWXuQChjskCpkqhxfspOYtxBwCMa7MgfBObbpt1uO2HxpUtZh7dMAaMme9DdkiPKjSHoem79OkTsI_n5MS7NuLF970km8eHt9Vzvn59elndr_OKKzXkVHCqlNLUCMOMcQa1ZoWnqizr0nsokQldC6mxLpEaBBRSltL7wjFaM86X5GbOTYM_RoyD3TexwrZ1HfZjtFpSIamhOpFXf8hdP4YuLWd1YXjCFCSIzlAV-hgDensIzd6FT0vBThLtLNEmVXaSaEXquf4OdrFyrQ-uq5r405gcquR34tjMxVTqthh-F_g__AsvXIAp</recordid><startdate>20110201</startdate><enddate>20110201</enddate><creator>Bella, Antonio</creator><creator>Ferri, Cèsar</creator><creator>Hernández-Orallo, José</creator><creator>Ramírez-Quintana, María José</creator><general>Springer Vienna</general><general>Springer</general><general>Springer Nature B.V</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L.0</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20110201</creationdate><title>Using negotiable features for prescription problems</title><author>Bella, Antonio ; Ferri, Cèsar ; Hernández-Orallo, José ; Ramírez-Quintana, María José</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c377t-153177781959299a9e8824f17bbdbff0be258d568edbe19e0e566b6ff4a21d233</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Artificial Intelligence</topic><topic>Computation</topic><topic>Computer Appl. in Administrative Data Processing</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Customer relationship management</topic><topic>Customers</topic><topic>Data mining</topic><topic>Exact sciences and technology</topic><topic>Failure</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Inversions</topic><topic>Linear programming</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Mathematics</topic><topic>Methods of scientific computing (including symbolic computation, algebraic computation)</topic><topic>Monte Carlo methods</topic><topic>Monte Carlo simulation</topic><topic>Neural networks</topic><topic>Numerical analysis</topic><topic>Numerical analysis. Scientific computation</topic><topic>Numerical methods in mathematical programming, optimization and calculus of variations</topic><topic>Numerical methods in optimization and calculus of variations</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Probability</topic><topic>Sciences and techniques of general use</topic><topic>Software Engineering</topic><topic>Studies</topic><topic>Taxonomy</topic><topic>Theoretical computing</topic><topic>Variables</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bella, Antonio</creatorcontrib><creatorcontrib>Ferri, Cèsar</creatorcontrib><creatorcontrib>Hernández-Orallo, José</creatorcontrib><creatorcontrib>Ramírez-Quintana, María José</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global (ProQuest)</collection><collection>Computing Database</collection><collection>ProQuest Research Library</collection><collection>Research Library (Corporate)</collection><collection>ProQuest Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bella, Antonio</au><au>Ferri, Cèsar</au><au>Hernández-Orallo, José</au><au>Ramírez-Quintana, María José</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Using negotiable features for prescription problems</atitle><jtitle>Computing</jtitle><stitle>Computing</stitle><date>2011-02-01</date><risdate>2011</risdate><volume>91</volume><issue>2</issue><spage>135</spage><epage>168</epage><pages>135-168</pages><issn>0010-485X</issn><eissn>1436-5057</eissn><coden>CMPTA2</coden><abstract>Data mining is usually concerned on the construction of accurate models from data, which are usually applied to well-defined problems that can be clearly isolated and formulated independently from other problems. Although much computational effort is devoted for their training and statistical evaluation, model deployment can also represent a scientific problem, when several data mining models have to be used together, constraints appear on their application, or they have to be included in decision processes based on different rules, equations and constraints. In this paper we address the problem of combining several data mining models for objects and individuals in a common scenario, where not only we can affect decisions as the result of a change in one or more data mining models, but we have to solve several optimisation problems, such as choosing one or more inputs to get the best overall result, or readjusting probabilities after a failure. We illustrate the point in the area of customer relationship management (CRM), where we deal with the general problem of prescription between products and customers. We introduce the concept of negotiable feature, which leads to an extended taxonomy of CRM problems of greater complexity, since each new negotiable feature implies a new degree of freedom. In this context, we introduce several new problems and techniques, such as data mining model inversion (by ranging on the inputs or by changing classification problems into regression problems by function inversion), expected profit estimation and curves, global optimisation through a Monte Carlo method, and several negotiation strategies in order to solve this maximisation problem.</abstract><cop>Vienna</cop><pub>Springer Vienna</pub><doi>10.1007/s00607-010-0129-5</doi><tpages>34</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0010-485X |
ispartof | Computing, 2011-02, Vol.91 (2), p.135-168 |
issn | 0010-485X 1436-5057 |
language | eng |
recordid | cdi_proquest_miscellaneous_861561918 |
source | ABI/INFORM Global (ProQuest); Springer Nature; BSC - Ebsco (Business Source Ultimate) |
subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Artificial Intelligence Computation Computer Appl. in Administrative Data Processing Computer Communication Networks Computer Science Computer science control theory systems Customer relationship management Customers Data mining Exact sciences and technology Failure Information Systems Applications (incl.Internet) Inversions Linear programming Mathematical analysis Mathematical models Mathematics Methods of scientific computing (including symbolic computation, algebraic computation) Monte Carlo methods Monte Carlo simulation Neural networks Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Numerical methods in optimization and calculus of variations Operations research Optimization Probability Sciences and techniques of general use Software Engineering Studies Taxonomy Theoretical computing Variables |
title | Using negotiable features for prescription problems |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T16%3A54%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Using%20negotiable%20features%20for%20prescription%20problems&rft.jtitle=Computing&rft.au=Bella,%20Antonio&rft.date=2011-02-01&rft.volume=91&rft.issue=2&rft.spage=135&rft.epage=168&rft.pages=135-168&rft.issn=0010-485X&rft.eissn=1436-5057&rft.coden=CMPTA2&rft_id=info:doi/10.1007/s00607-010-0129-5&rft_dat=%3Cproquest_cross%3E861561918%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c377t-153177781959299a9e8824f17bbdbff0be258d568edbe19e0e566b6ff4a21d233%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=849315670&rft_id=info:pmid/&rfr_iscdi=true |