Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/19205
Title: Segmenting preferences for investment bonds using latent variable mixture models
Authors: Francalanza, Helena
Camilleri, Liberato
Keywords: Expectation-maximization algorithms
Market segmentation
Conjoint analysis (Marketing)
Issue Date: 2012
Publisher: Edukator
Citation: Francalanza, H., & Camilleri, L. (2012). Segmenting preferences for investment bonds using latent variable mixture models. Advances in Business-Related Scientific Research Journal, 3(2), 105-120.
Abstract: Market segmentation is a key component of conjoint analysis which addresses consumer preference heterogeneity. Members in a segment are assumed to be homogenous in their views and preferences when worthing an item but distinctly heterogenous to members of other segments. Latent class methodology is one of the several conjoint segmentation procedures that overcome the limitations of aggregate analysis and a-priori segmentation. The main benefit of Latent class models is that market segment membership and regression parameters of each derived segment are estimated simultaneously. The Latent class model presented in this paper uses mixtures of multivariate conditional normal distributions to analyze rating data, where the likelihood is maximized using the EM algorithm. The application focuses on customer preferences for investment bonds described by four attributes; currency, coupon rate, redemption term and price. A number of demographic variables are used to generate segments that are accessible and actionable.
URI: https://www.um.edu.mt/library/oar//handle/123456789/19205
Appears in Collections:Scholarly Works - FacSciSOR
Scholarly Works - JCMath

Files in This Item:
File Description SizeFormat 
OA - Segmenting Preferences For Investment Bonds Using Latent Variable Mixture Models.1.pdfSegmenting preferences for investment bonds using latent variable mixture models181.14 kBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.