IDEAS home Printed from https://ideas.repec.org/p/tsa/wpaper/0161mss.html
   My bibliography  Save this paper

A Multi-task Multi-kernel Transfer Learning Method for Customer Response Modeling in Social Media

Author

Listed:
  • Minghe Sun

    (UTSA)

  • Zhen-Yu Chen
  • Zhi-Ping Fan

Abstract

Customer response modeling is essential for a firm to allocate the marketing resources to active customers who have potential values. With the development of social media, customer response modeling in social media plays important roles in the firms’ marketing decisions. For customer response modeling in social media, the inputs involve multiple types of data and the purposes are to identify respondents to multiple items. In this study, a multi-task multi-kernel transfer learning (MT-MKTL) method is proposed to integrate shared, task-specific and transferred features in a framework for customer response modeling in social media. A two-phase algorithm is applied to solving the MT-MKTL problem. A computational experiment is conducted on microblog data. The experimental results show that the MT-MKTL method exhibits good performance.

Suggested Citation

  • Minghe Sun & Zhen-Yu Chen & Zhi-Ping Fan, 2014. "A Multi-task Multi-kernel Transfer Learning Method for Customer Response Modeling in Social Media," Working Papers 0161mss, College of Business, University of Texas at San Antonio.
    • Handle: RePEc:tsa:wpaper:0161mss
    as

    Download full text from publisher

    File URL: http://interim.business.utsa.edu/wps/mss/0050MSS-061-2008.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. ,, 2001. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 17(6), pages 1157-1160, December.
    2. Alfred A. Kuehn & Michael J. Hamburger, 1963. "A Heuristic Program for Locating Warehouses," Management Science, INFORMS, vol. 9(4), pages 643-666, July.
    3. Tony J. Van Roy, 1986. "A Cross Decomposition Algorithm for Capacitated Facility Location," Operations Research, INFORMS, vol. 34(1), pages 145-163, February.
    4. Graciano Sá, 1969. "Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem," Operations Research, INFORMS, vol. 17(6), pages 1005-1016, December.
    5. Ghosh, Diptesh, 2003. "Neighborhood search heuristics for the uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 150(1), pages 150-162, October.
    6. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
    7. Minghe Sun, 2007. "A Primogenitary Linked Quad Tree Approach for Solution Storage and Retrieval in Heuristic Binary Optimization," Working Papers 0009, College of Business, University of Texas at San Antonio.
    8. Carlton, William B. & Barnes, J. Wesley, 1996. "A note on hashing functions and tabu search algorithms," European Journal of Operational Research, Elsevier, vol. 95(1), pages 237-239, November.
    9. ,, 2001. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 17(5), pages 1025-1031, October.
    10. Jacobsen, Soren Kruse, 1983. "Heuristics for the capacitated plant location model," European Journal of Operational Research, Elsevier, vol. 12(3), pages 253-261, March.
    11. E. Feldman & F. A. Lehrer & T. L. Ray, 1966. "Warehouse Location Under Continuous Economies of Scale," Management Science, INFORMS, vol. 12(9), pages 670-684, May.
    12. Michel, Laurent & Van Hentenryck, Pascal, 2004. "A simple tabu search for warehouse location," European Journal of Operational Research, Elsevier, vol. 157(3), pages 576-591, September.
    13. Domschke, Wolfgang & Drexl, Andreas, 1985. "ADD-heuristics' starting procedures for capacitated plant location models," European Journal of Operational Research, Elsevier, vol. 21(1), pages 47-53, July.
    14. Minghe Sun, 2006. "A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization," Annals of Operations Research, Springer, vol. 147(1), pages 87-107, October.
    15. Grolimund, Stephan & Ganascia, Jean-Gabriel, 1997. "Driving Tabu Search with case-based reasoning," European Journal of Operational Research, Elsevier, vol. 103(2), pages 326-338, December.
    16. Cornuejols, G. & Sridharan, R. & Thizy, J. M., 1991. "A comparison of heuristics and relaxations for the capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 50(3), pages 280-297, February.
    17. Umit Akinc & Basheer M. Khumawala, 1977. "An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem," Management Science, INFORMS, vol. 23(6), pages 585-594, February.
    18. Beasley, J. E., 1993. "Lagrangean heuristics for location problems," European Journal of Operational Research, Elsevier, vol. 65(3), pages 383-399, March.
    19. Domschke, Wolfgang & Drexl, Andreas, 1985. "ADD – heuristics' starting procedures for capacitated plant location models," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 39287, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    20. Tuzun, Dilek & Burke, Laura I., 1999. "A two-phase tabu search approach to the location routing problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 87-99, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Minghe Sun, 2008. "A Tabu Search Heuristic Procedure for the Capacitated Facility Location Problem," Working Papers 0050, College of Business, University of Texas at San Antonio.
    2. Fathali Firoozi, 2008. "Boundary Distributions in Testing Inequality Hypotheses," Working Papers 0046, College of Business, University of Texas at San Antonio.
    3. Sharma, R.R.K. & Berry, V., 2007. "Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort," European Journal of Operational Research, Elsevier, vol. 177(2), pages 803-812, March.
    4. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    5. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    6. Sridharan, R., 1995. "The capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 87(2), pages 203-213, December.
    7. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
    8. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    9. Holmberg, Kaj & Ling, Jonas, 1997. "A Lagrangean heuristic for the facility location problem with staircase costs," European Journal of Operational Research, Elsevier, vol. 97(1), pages 63-74, February.
    10. Pierre Hansen & Jack Brimberg & Dragan Urošević & Nenad Mladenović, 2007. "Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 552-564, November.
    11. Ramesh Bollapragada & Uday S. Rao & Junying Wu, 2023. "Hub location–allocation for combined fixed-wireless and wireline broadband access networks," DECISION: Official Journal of the Indian Institute of Management Calcutta, Springer;Indian Institute of Management Calcutta, vol. 50(1), pages 115-128, March.
    12. Zainuddin, Z.M. & Salhi, S., 2007. "A perturbation-based heuristic for the capacitated multisource Weber problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1194-1207, June.
    13. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    14. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    16. Klose, Andreas, 2000. "A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 408-421, October.
    17. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    18. J Brimberg & P Hansen & G Laporte & N Mladenović & D Urošević, 2008. "The maximum return-on-investment plant location problem with market share," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 399-406, March.
    19. Sourirajan, Karthik & Ozsen, Leyla & Uzsoy, Reha, 2009. "A genetic algorithm for a single product network design model with lead time and safety stock considerations," European Journal of Operational Research, Elsevier, vol. 197(2), pages 599-608, September.
    20. van der Gaast, J.P. & Rietveld, C.A. & Gabor, A.F. & Zhang, Y., 2011. "A Local Search Algorithm for Clustering in Software as a Service Networks," ERIM Report Series Research in Management ERS-2011-004-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    More about this item

    Keywords

    Customer response modeling; Social media; Multi-task learning; Transfer learning; Multi-kernel learning;
    All these keywords.

    JEL classification:

    • C32 - Mathematical and Quantitative Methods - - Multiple or Simultaneous Equation Models; Multiple Variables - - - Time-Series Models; Dynamic Quantile Regressions; Dynamic Treatment Effect Models; Diffusion Processes; State Space Models
    • C38 - Mathematical and Quantitative Methods - - Multiple or Simultaneous Equation Models; Multiple Variables - - - Classification Methdos; Cluster Analysis; Principal Components; Factor Analysis
    • C51 - Mathematical and Quantitative Methods - - Econometric Modeling - - - Model Construction and Estimation
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tsa:wpaper:0161mss. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wendy Frost (email available below). General contact details of provider: https://edirc.repec.org/data/cbutsus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.