Maximum likelihood based sparse and distributed conjoint analysis

Efthymios Tsakonas; Joakim Jalden; Nicholas D. Sidiropoulos; Bjorn Ottersten

doi:10.1109/SSP.2012.6319698

Maximum likelihood based sparse and distributed conjoint analysis

Efthymios Tsakonas, Joakim Jalden, Nicholas D. Sidiropoulos, Bjorn Ottersten

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

A new statistical model for choice-based conjoint analysis is proposed. The model uses auxiliary variables to account for outliers and to detect the salient features that influence decisions. Unlike recent classification-based approaches to choice-based conjoint analysis, a sparsity-aware maximum likelihood (ML) formulation is proposed to estimate the model parameters. The proposed approach is conceptually appealing, mathematically tractable, and is also well-suited for distributed implementation. Its performance is tested and compared to the prior state-of-art using synthetic as well as real data coming from a conjoint choice experiment for coffee makers, with very promising results.

Original language	English (US)
Title of host publication	2012 IEEE Statistical Signal Processing Workshop, SSP 2012
Pages	33-36
Number of pages	4
DOIs	https://doi.org/10.1109/SSP.2012.6319698
State	Published - 2012
Event	2012 IEEE Statistical Signal Processing Workshop, SSP 2012 - Ann Arbor, MI, United States Duration: Aug 5 2012 → Aug 8 2012

Publication series

Name	2012 IEEE Statistical Signal Processing Workshop, SSP 2012

Other

Other	2012 IEEE Statistical Signal Processing Workshop, SSP 2012
Country/Territory	United States
City	Ann Arbor, MI
Period	8/5/12 → 8/8/12

Access

10.1109/SSP.2012.6319698

OpenUrl availability

Full text

Cite this

Maximum likelihood based sparse and distributed conjoint analysis. / Tsakonas, Efthymios; Jalden, Joakim; Sidiropoulos, Nicholas D. et al.
2012 IEEE Statistical Signal Processing Workshop, SSP 2012. 2012. p. 33-36 6319698 (2012 IEEE Statistical Signal Processing Workshop, SSP 2012).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Tsakonas, E, Jalden, J, Sidiropoulos, ND & Ottersten, B 2012, Maximum likelihood based sparse and distributed conjoint analysis. in 2012 IEEE Statistical Signal Processing Workshop, SSP 2012., 6319698, 2012 IEEE Statistical Signal Processing Workshop, SSP 2012, pp. 33-36, 2012 IEEE Statistical Signal Processing Workshop, SSP 2012, Ann Arbor, MI, United States, 8/5/12. https://doi.org/10.1109/SSP.2012.6319698

@inproceedings{d7d568e238204609b01607bd72248f23,

title = "Maximum likelihood based sparse and distributed conjoint analysis",

abstract = "A new statistical model for choice-based conjoint analysis is proposed. The model uses auxiliary variables to account for outliers and to detect the salient features that influence decisions. Unlike recent classification-based approaches to choice-based conjoint analysis, a sparsity-aware maximum likelihood (ML) formulation is proposed to estimate the model parameters. The proposed approach is conceptually appealing, mathematically tractable, and is also well-suited for distributed implementation. Its performance is tested and compared to the prior state-of-art using synthetic as well as real data coming from a conjoint choice experiment for coffee makers, with very promising results.",

author = "Efthymios Tsakonas and Joakim Jalden and Sidiropoulos, {Nicholas D.} and Bjorn Ottersten",

year = "2012",

doi = "10.1109/SSP.2012.6319698",

language = "English (US)",

isbn = "9781467301831",

series = "2012 IEEE Statistical Signal Processing Workshop, SSP 2012",

pages = "33--36",

booktitle = "2012 IEEE Statistical Signal Processing Workshop, SSP 2012",

}

TY - GEN

T1 - Maximum likelihood based sparse and distributed conjoint analysis

AU - Tsakonas, Efthymios

AU - Jalden, Joakim

AU - Sidiropoulos, Nicholas D.

AU - Ottersten, Bjorn

PY - 2012

Y1 - 2012

N2 - A new statistical model for choice-based conjoint analysis is proposed. The model uses auxiliary variables to account for outliers and to detect the salient features that influence decisions. Unlike recent classification-based approaches to choice-based conjoint analysis, a sparsity-aware maximum likelihood (ML) formulation is proposed to estimate the model parameters. The proposed approach is conceptually appealing, mathematically tractable, and is also well-suited for distributed implementation. Its performance is tested and compared to the prior state-of-art using synthetic as well as real data coming from a conjoint choice experiment for coffee makers, with very promising results.

AB - A new statistical model for choice-based conjoint analysis is proposed. The model uses auxiliary variables to account for outliers and to detect the salient features that influence decisions. Unlike recent classification-based approaches to choice-based conjoint analysis, a sparsity-aware maximum likelihood (ML) formulation is proposed to estimate the model parameters. The proposed approach is conceptually appealing, mathematically tractable, and is also well-suited for distributed implementation. Its performance is tested and compared to the prior state-of-art using synthetic as well as real data coming from a conjoint choice experiment for coffee makers, with very promising results.

UR - http://www.scopus.com/inward/record.url?scp=84868220098&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84868220098&partnerID=8YFLogxK

U2 - 10.1109/SSP.2012.6319698

DO - 10.1109/SSP.2012.6319698

M3 - Conference contribution

AN - SCOPUS:84868220098

SN - 9781467301831

T3 - 2012 IEEE Statistical Signal Processing Workshop, SSP 2012

SP - 33

EP - 36

BT - 2012 IEEE Statistical Signal Processing Workshop, SSP 2012

T2 - 2012 IEEE Statistical Signal Processing Workshop, SSP 2012

Y2 - 5 August 2012 through 8 August 2012

ER -

Maximum likelihood based sparse and distributed conjoint analysis

Abstract

Publication series

Other

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this