Some counterexamples in multidimensional scaling

Given a set X with elements x, y,… which has a partial order < on the pairs of the Cartesian product X², one may seek a distance function ? on such pairs (x, y) which satisfies ?(x₁, y₁) < ?(x₂, y₂) precisely when (x₁, y₁) < (x₂, y₂), and even demand a metric space (X, ?) with some such compatible ? which has an isometric imbedding into a finite-dimensional Euclidean space or a separable Hilbert space. We exhibit here systems (X, <) which cannot meet the latter demand. The space of real m-tuples (ξ₁,…,ξ_m) with either the “city-block” norm Σ_i ∥ξ_i∥ or the “dominance” norm max_i, ∥ξ_i∥ cannot possibly become a subset of any finite-dimensional Euclidean space. The set of real sequences (ξ₁, ξ₂,…) with finitely many nonzero elements and the supremum norm sup_i, ∥ξ_i∥ cannot even become a subset of any separable Hilbert space.     

The circumplex: A slightly stronger than ordinal approach

For some proximity matrices, multidimensional scaling yields a roughly circular configuration of the stimuli. Being not symmetric, a row-conditional matrix is not fit for such an analysis. However, suppose its proximities are all different within rows. Calling {{x,y},{x,z}} a conjoint pair of unordered pairs of stimuli, let {x,y}→{x,z} mean that row x shows a stronger proximity for {x,y} than for {x,z}. We have a cyclic permutation π of the set of stimuli characterize a subset of the conjoint pairs. If the arcs {x,y}→{x,z} between the pairs thus characterized are in a specific sense monotone with π, the matrix determines π uniquely, and is, in that sense, a circumplex with π as underlying cycle. In the strongest of the 3 circumplexes thus obtained, → has circular paths. We give examples of analyses of, in particular, conditional proximities by these concepts, and implications for the analysis of presumably circumplical proximities. Circumplexes whose underlying permutation is multi-cyclic are touched.     

Resolution of Algebraic Systems of Equations in the Variety of Cyclic Post Algebras

There is a constructive method to define a structure of simple k-cyclic Post algebra of order p, L _p,k , on a given finite field F(p ^k ), and conversely. There exists an interpretation ??₁ of the variety ${\mathcal{V}(L_{p,k})}$ generated by L _p,k into the variety ${\mathcal{V}(F(p^k))}$ generated by F(p ^k ) and an interpretation ??₂ of ${\mathcal{V}(F(p^k))}$ into ${\mathcal{V}(L_{p,k})}$ such that ??₂??₁(B) =  B for every ${B \in \mathcal{V}(L_{p,k})}$ and ??₁??₂(R) =  R for every ${R \in \mathcal{V}(F(p^k))}$ . In this paper we show how we can solve an algebraic system of equations over an arbitrary cyclic Post algebra of order p, p prime, using the above interpretation, Gröbner bases and algorithms programmed in Maple.     

Generalized procrustes analysis

SupposeP _i ⁽ⁱ⁾ (i = 1, 2, ...,m, j = 1, 2, ...,n) give the locations ofmn points inp-dimensional space. Collectively these may be regarded asm configurations, or scalings, each ofn points inp-dimensions. The problem is investigated of translating, rotating, reflecting and scaling them configurations to minimize the goodness-of-fit criterion Σ _i=1 ^m Σ _i=1 ⁿ Δ²(P _j ⁽ⁱ⁾ G _i ), whereG _i is the centroid of them pointsP _i ⁽ⁱ⁾ (i = 1, 2, ...,m). The rotated positions of each configuration may be regarded as individual analyses with the centroid configuration representing a consensus, and this relationship with individual scaling analysis is discussed. A computational technique is given, the results of which can be summarized in analysis of variance form. The special casem = 2 corresponds to Classical Procrustes analysis but the choice of criterion that fits each configuration to the common centroid configuration avoids difficulties that arise when one set is fitted to the other, regarded as fixed.     

Pseudocontingencies derived from categorically organized memory representations

Pseudocontingencies (PCs) allow for inferences about the contingency between two variables X and Y when the conditions for genuine contingency assessment are not met. Even when joint observations X _i and Y _i about the same reference objects i are not available or are detached in time or space, the correlation r(X _i ,Y _i ) is readily inferred from base rates. Inferred correlations are positive (negative) if X and Y base rates are skewed in the same (different) directions. Such PC inferences afford useful proxies for actually existing contingencies. While previous studies have focused on PCs due to environmental base rates, the present research highlights memory organization as a natural source of PC effects. When information about two attributes X and Y is represented in a hierarchically organized categorical memory code, as category-wise base rates p(X) and p(Y), the reconstruction of item-level information from category base rates will naturally produce PC effects. Three experiments support this contention. When the yes base rates of two respondents in four questionnaire subscales (categories) were correlated, recalled and predicted item-level responses were correlated in the same direction, even when the original responses to specific items within categories were correlated in the opposite direction.     

Utility of extension of functional equations—when possible

Jean-Claude Falmagne observed in 1981 [On a recurrent misuse of classical functional equation result. Journal of Mathematical Psychology, 23, 190-193] that, even under regularity assumptions, not all solutions of the functional equation k(s+t)=k(s)+k(t), important in many fields, also in the theory of choice, are of the form k(s)=Cs. This is certainly so when the domain of the equation (the set of (s,t) for which the equation is satisfied) is finite. We mention an example showing that this can happen even on some infinite, open, connected sets (open regions). The more general equations k(s+t)=?(s)+n(t) and k(s+t)=m(s)n(t), called Pexider equations, have been completely solved on R². In case they are assumed valid only on an open region, they have been extended to R² and solved that way (the latter if k is not constant). In this paper their common generalization

k(s+t)=?(s)+m(s)n(t)     

Nondecomposable conjoint measurement for bisymmetric structures

This paper discusses two “nondecomposable” conjoint measurement representations for an asymmetric binary relation ? on a product set A × X, namely (a, x) ? (b, y) iff f₁(a) + g₁(a)g₂(x) > f₁(b) + g₁(b)g₂(y), and (a, x) ? (b, y) iff f₁(a) + f₂(x) + g₁(a)g₂(x) > f₁(b) + f₂(y) + g₁(b)g₂(y). Difficulties in developing axioms for ? on A × X which imply these representations in a general formulation have led to their examination from the standpoint of bisymmetric structures based on applications of a binary operation to A × X. Depending on context, the binary operation may refer to concatenation, extensive or intensive averaging, gambles based on an uncertain chance event, or to some other interpretable process. Independence axioms which are necessary and sufficient for the special representations within the context of bisymmetric structures are presented.     

Lexicographic additive differences

Several authors have identified sets of axioms for a preference relation ? on a two-factor set A × X which imply that ? can be represented by specific types of numerical structures. Perhaps the two best-known of these are the additive representation, for which there are real valued functions f_A on A and f_X on X such that (a, x) ? (b, y) if and only if f_A(a) + f_X(x) > f_A(b) + f_X(y), and the lexicographic representation which, with A as the dominant factor, has (a, x) ? (b, y) if and only if f_A(a) > f_A(b) or {f_A(a) = f_A(b) and f_X(x) > f_X(y)}. Recently, Duncan Luce has combined the additive and lexicographic notions in a model for which A is the dominant factor if the difference between a and b is sufficiently large but which adheres to the additive representation when the difference between a and b lies within what might be referred to as a lexicographic threshold. The present paper specifies axioms for ? which lead to a numerical model which also has a lexicographic component but whose local tradeoff structure is governed by the additive-difference model instead of the additive model. Although the additive-difference model includes the additive model as a special case, the new lexicographic additive-difference model is not more general than Luce's model since the former has a “constant” lexicographic threshold whereas Luce's model has a “variable” lexicographic threshold. Realizations of the new model range from the completely lexicographic representation to the regular additive-difference model with no genuine lexicographic component. Axioms for the latter model are obtained from the general axioms with one slight modification.     

Alternative measures of fit for the Schönemann-carroll matrix fitting algorithm

In connection with a least-squares solution for fitting one matrix,A, to another,B, under optimal choice of a rigid motion and a dilation, Schönemann and Carroll suggested two measures of fit: a raw measure,e, and a refined similarity measure,e _s , which is symmetric. Both measures share the weakness of depending upon the norm of the target matrix,B,e.g.,e(A,kB) ≠e(A,B) fork ≠ 1. Therefore, both measures are useless for answering questions of the type: “DoesA fitB better thanA fitsC?”. In this note two new measures of fit are suggested which do not depend upon the norms ofA andB, which are (0, 1)-bounded, and which, therefore, provide meaningful answers for comparative analyses.     

Analysis of the Talmudic Argumentum A Fortiori Inference Rule (Kal Vachomer) using Matrix Abduction

We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of non-deductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix \({\mathbb {A}}\) with entries in {0, 1}, we allow for one or more blank squares in the matrix, say a _i,j =?. The method allows us to decide whether to declare a _i,j = 0 or a _i,j = 1 or a _i,j =? undecided. This algorithmic method is then applied to modelling several legal and practical reasoning situations including the Talmudic rule of Kal-Vachomer. We add an Appendix showing that this new rule of Matrix Abduction, arising from the Talmud, can also be applied to the analysis of paradoxes in voting and judgement aggregation. In fact we have here a general method for executing non-deductive inferences.     

Similarity of rectangles

Krantz and Tversky found that neither (log-) height (y) and width (x), nor area (x + y) and shape (x ? y) qualify as “subjective dimensions of rectangles” because both pairs violate the decomposability condition for their dissimilarity data. However, the data suggest a nonlinear transformation of x, y into a pair of subjective dimensions u(x, y), v(x, y) for which decomposability should be approximately satisfied. An explicit statement of this mapping is given.     

Binary choice probabilities: on the varieties of stochastic transitivity

Let {P_λ} denote the family of decisiveness relations {$\text{P}{}_{\mathrm{\lambda }}\text{:}\text{1}\text{2}\text{≤ λ < 1}$} with aP_λb if and only if P(a,b) > λ, where P is a binary choice probability function. Families in which all decisiveness relations are of the same type, such as all strict partial orders or all semiorders, are characterized by stochastic transitivity conditions. The conditions used for this purpose differ in various ways from the traditional forms of strong, moderate, and weak stochastic transitivity. The family {P_λ} is then examined from the viewpoint of interval representation models, the most general of which is aP_λb if and only if I(a, λ) > I(b, λ), where the I's are real intervals with I(a, λ) > I(b, λ) if and only if the first interval is completely to the right of the second. With I(a, λ) = [f(a, λ), f(a, λ) + σ(a, λ)], the specializations of the interval model that are discussed include those where the location function f (for left end-points) depends only on the set A of alternatives or stimuli and where the length function σ depends only on A or on λ or neither.     

Comparing the meanings of “if” and “all”

In this study, we compared the everyday meanings of conditionals (“if p then q”) and universally quantified statements (“all p are q”) when applied to sets of elements. The interpretation of conditionals was predicted to be directly related to the conditional probability, such that P(“if p then q”) = P(q|p). Quantified statements were assumed to have two interpretations. According to an instance-focused interpretation, quantified statements are equivalent to conditionals, such that P(“all p are q”) = P(q|p). According to a set-focused interpretation, “all p are q” is true if and only if every instance in set p is an instance of q, so that the statement would be accepted when P(q|p) = 1 and rejected when this probability was below 1. We predicted an instance-focused interpretation of “all” when the relation between p and q expressed a general law for an infinite set of elements. A set-focused interpretation of “all” was predicted when the relation between p and q expressed a coincidence among the elements of a finite set. Participants were given short context stories providing information about the frequency of co-occurrence of cases of p, q, not-p, and not-q in a population. They were then asked to estimate the probability that a statement (conditional or quantified) would be true for a random sample taken from that population. The probability estimates for conditionals were in accordance with an instance-focused interpretation, whereas the estimates for quantified statements showed features of a set-focused interpretation. The type of the relation between p and q had no effect on this outcome.     

The corroboration paradox

Evidentiary propositions E ₁ and E ₂, each p-positively relevant to some hypothesis H, are mutually corroborating if p(H|E ₁ ∩ E ₂) > p(H|E _i ), i = 1, 2. Failures of such mutual corroboration are instances of what may be called the corroboration paradox. This paper assesses two rather different analyses of the corroboration paradox due, respectively, to John Pollock and Jonathan Cohen. Pollock invokes a particular embodiment of the principle of insufficient reason to argue that instances of the corroboration paradox are of negligible probability, and that it is therefore defeasibly reasonable to assume that items of evidence positively relevant to some hypothesis are mutually corroborating. Taking a different approach, Cohen seeks to identify supplementary conditions that are sufficient to ensure that such items of evidence will be mutually corroborating, and claims to have identified conditions which account for most cases of mutual corroboration. Combining a proposed common framework for the general study of paradoxes of positive relevance with a simulation experiment, we conclude that neither Pollock’s nor Cohen’s claims stand up to detailed scrutiny. I am quite prepared to be told…”oh, that is an extreme case: it could never really happen!” Now I have observed that this answer is always given instantly, with perfect confidence, and without any examination of the proposed case. It must therefore rest on some general principle: the mental process being something like this—“I have formed a theory. This case contradicts my theory. Therefore, this is an extreme case, and would never occur in practice.” Rev. Charles L. Dodgson      

The Poznań school methodology of idealization and concretization from the point of view of a revised structuralist theory conception

My thesis is that some methodological ideas of the Pozna school, i.e., the principles of idealization and concretization (factualization), and the correspondence principle can be represented rather successfully using the relations of theoretization and specialization of revised structuralism.Let <n(i), t(j)> (i=1,...m, j=1,...k) denote the conceptual apparatus of a theory T, and a class M={} (i=1,...m, j=1,...k) the models of T. The n-components refer to the values of dependent variables and t-components to the values of independent variables of the theory. The n- and t-components in turn represent appropriate concepts. Consider T ^* as a conceptual enrichment of T with concepts <n(i ^*), t(j ^*)> (i<i ^* or j<j ^*) and models M ^*={<D ^*, n(i ^*), t(j ^*)>}. If the classes M and M ^* are suitably related, then the situation illustrates both the case of the theoretization-relation of (revised) structuralism and of the factualization-principle of the Pozna school.Assume now that the concepts n(i), t(j) of T for some i, j are operationalized using some special assumptions generating appropriate empirical values n and t for these concepts. Let M denote the class {<D,...n,...t,...>} which is formed by substituting n and t for values of concepts n(i), t(j) in the elements of M. If the classes M and M are related in a suitable way then the situation is an example of both the specialization-relation of (revised) structuralism and the concretization-principle of the Pozna school. The correspondence principle in turn can be represented as a limiting case of the theoretization-relation of (revised) structuralism.Many thanks to my anonymous referees for critical and fruitful comments and special thanks to Dr. Carol Norris for correcting the language of this paper.     

Eta,disco, odisco,andF

Two coefficients are proposed for measuring the extent of overlap in distributions as a direct function of the variance between the arithmetic means (“disco” and “odisco”). They are designed to answer such questions as: “Given the value of a numerical variablex, to which population should an individual be assigned so that minimum error would be incurred?” This is just the reverse of the question addressed by ANOVA. These coefficients are shown to be analytic inx and they are related to Pearson's eta and Fisher'sF. Extensions of these coefficients (designed for univariate, one-way discrimination) tok-way and multivariate discriminant analysis and measurement of “interaction” are suggested.     

An approach to geometry of visual space with no a priori mapping functions: Multidimensional mapping according to Riemannian metrics

A method of multidimensional mapping is described which constructs a configuration of points {P_i} in a Euclidean map of Riemannian space of constant curvature (hyperbolic, Euclidean, and elliptic) from the dissimilarity matrix (d_ij). The method was applied to the distance matrix in visual space where stimulus points Q_i were either small light points in the dark or small black points in the illuminated field surrounded by white curtains and d_ij represent scaled values of perceptual distances. Configuration of points {Q_i} were at intersections of parallel or distance alleys and horopters for the subject in the horizontal plane of the eye level. In contrast to the theoretical equations for {Q_i} by Luneburg and Blank, no a priori assumption on mapping functions between {Q_i} and {P_i} is necessary in this procedure to fit theoretical curves to {P_i} in the Euclidean map. The data were accounted for better by equations in the hyperbolic plane than by ones in the Euclidean plane. Discussions are made on robustness of Euclidean representation and on how to approach geometry of visual space as a dynamic entity under more natural conditions than the traditional frameless condition for alley and horopter experiments.     

A Statistical Hypothesis Testing Method for the Rank Ordering of the Priorities of the Alternatives in the Analytic Hierarchy Process

In analytic hierarchy process (AHP), a ratio scale (π₁, π₂, ⋯, π_t) for the priorities of the alternatives {T₁, T₂, ⋯, T_t} is used for a decision problem in which π_i/π_j is used to quantify the ratio of the priority of T_i to that of T_j. In a group decision‐making setup, the subjective estimates of π_i/π_j are obtained as entries of a pairwise comparison matrix for each member of the group. On the basis of these pairwise comparison matrices, one of the topics of interest in some situation is the total rank ordering of the priorities of the alternatives. In this article, a statistical method is proposed for testing a specific total rank ordering of the priorities of the alternatives. The method developed is then illustrated using numerical examples. Copyright © 2014 John Wiley & Sons, Ltd.     

On the functional form of partial masking functions in psychoacoustics

Partial masking of pure tones is often investigated in terms of matching functions which record the intensity φ(x, n) of an unmasked tone which matches, in perceived loudness, a tone of intensity x embedded in a flat, broadband noise of intensity n. Empirically, the following property of “shift invariance” is observed to hold for these matching functions: φ(λx, λ^θn) = λφ(x, n), for any λ > 0, and some θ < 1. In the context of the model $\text{φ(x, n) = F}{}_0\text{[}\text{g}{}_0\text{(x)}\text{(h}{}_0\text{(x) + k}{}_0\text{(n))}\text{]}$ which expresses the idea that the effect of a noise mask is to control the gain of a pure tone signal in a multiplicative fashion, shift invariance proves to be an extremely powerful theoretical constraint. Specifically, we show that only two parametric families of functions (F₀, g₀, h₀, k₀) are possible candidates for interpolating empirical data. These two parametric families are given by the following expressions: $\text{φ}{}_1\text{(x, n) = A(}\text{x}{}^{\mathrm{\alpha }}\text{(x}{}^{\mathrm{\alpha \prime }}\text{+ Kn}{}^{\mathrm{<mtext>\alpha \prime </mtext><mtext>\theta </mtext>}}\text{)}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>(\alpha \; ?\; \alpha \prime )</mtext>}}$, $\text{φ}{}_2\text{(x, n) = A[x}{}^{\mathrm{\alpha }}\text{(x}{}^{\mathrm{\alpha \prime }}\text{? Kn}{}^{\mathrm{<mtext>\alpha \prime </mtext><mtext>\theta </mtext>}}\text{)]}{}^{\mathrm{<mtext>1</mtext><mtext>(\alpha \; +\; \alpha \prime )</mtext>}}$. Both of these expressions are in good agreement with a large array of partial masking data.