2010
DOI: 10.1016/j.foodqual.2009.08.006
|View full text |Cite
|
Sign up to set email alerts
|

Restricted unfolding: Preference analysis with optimal transformations of preferences and attributes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0
1

Year Published

2011
2011
2022
2022

Publication Types

Select...
6
3
1

Relationship

1
9

Authors

Journals

citations
Cited by 31 publications
(11 citation statements)
references
References 40 publications
0
7
0
1
Order By: Relevance
“…Busing and his colleagues have contributed significantly to the development of deterministic unfolding models and have made important progress in solving the degeneracy problem for deterministic models (Busing et al . , ; van de Velden et al . ).…”
Section: Unfolding Other Hedonic Datamentioning
confidence: 98%
“…Busing and his colleagues have contributed significantly to the development of deterministic unfolding models and have made important progress in solving the degeneracy problem for deterministic models (Busing et al . , ; van de Velden et al . ).…”
Section: Unfolding Other Hedonic Datamentioning
confidence: 98%
“…Degeneracy occurs if claimants with the same proximities to one of the poles would be located at different locations in the graph, reflecting multiple equally good solutions. The PREFSCAL algorithm has the additional major advantage that the assumption that the order of preferences is linear can be relaxed (Busing et al, 2010). Given the quasi-linear nature of the proximities, this accurately reflects the original data.…”
Section: Mapping Potential Cleavage Patterns Using Multidimensional Umentioning
confidence: 99%
“…Data analysis methods dealing with preference rankings belonging to the first category include Principal Component Analysis (Carroll, 1972), Multidimensional Scaling (Heiser & De Leeuw, 1981), Categorical Principal Component Analysis (Meulman, Van Der Kooij, & Heiser, 2004) and Unfolding methods (Coombs, 1950(Coombs, , 1964Busing, Groenen, & Heiser, 2005;Van Deun, Heiser, & Delbeke 2007;Busing, 2009;Busing, Heiser, & Cleaver, 2010). Probabilistic methods that model the ranking process include the so-called Thurstonian models, as well as distance-based and multistage models (Thurstone, 1927;Bradley & Terry, 1952;Mallows, 1957;Luce, 1957;Fligner & Verducci, 1986, 1988Critchlow, Fligner, & Verducci, For example, if n = 5 and λ = (1, 1, 1, 1, 1) then λ is expression of a full ranking in which the vector a could be equal to (1,2,3,4,5).…”
Section: Introductionmentioning
confidence: 99%