Convex Optimization as a Tool for Correcting Dissimilarity Matrices for Regular Minimality
Fechnerian scaling as developed by Dzhafarov and Colonius (e.g., Dzhafarov and Colonius, J Math Psychol 51:290–304, 2007) aims at imposing a metric on a set of objects based on their pairwise dissimilarities. A necessary condition for this theory is the law of Regular Minimality (e.g., Dzhafarov EN, Colonius H (2006) Regular minimality: a fundamental law of discrimination. In: Colonius H, Dzhafarov EN (eds) Measurement and representation of sensations. Erlbaum, Mahwah, pp. 1–46 ). In this paper, we solve the problem of correcting a dissimilarity matrix for Regular Minimality by phrasing it as a convex optimization problem in Euclidean metric space. In simulations, we demonstrate the usefulness of this correction procedure.
We are deeply indebted to Professor Ehtibar N. Dzhafarov for introducing us to this topic.
- Boyd, S., & Vandenberghe, L. (2009). Convex optimization. New York: Cambridge University Press.Google Scholar
- Dattorro, J. (2009). Convex optimization & euclidean distance geometry. Palo Alto: Meboo.Google Scholar
- Dzhafarov, E. N., & Colonius, H. (2006b). Regular minimality: a fundamental law of discrimination. In: H. Colonius & E. N. Dzhafarov (Eds.), Measurement and representation of sensations (pp. 1–46). Mahwah: Erlbaum.Google Scholar
- Kruskal, J. B., & Wish, M. (1978). Multidimensional scaling. Beverly Hills: Sage.Google Scholar
- Trendtel, M., Ünlü, A., & Dzhafarov, E. N. (2010). Matrices satisfying Regular Minimality. Frontiers in Quantitative Psychology and Measurement, 1, 1–6.Google Scholar
- Ünlü, A., & Trendtel, M. (2010). Testing for regular minimality. In A. Bastianelli & G. Vidotto (Eds.), Fechner Day 2010 (pp. 51–56). Padua: The International Society for Psychophysics.Google Scholar