Subscale Distance and Item Clustering E ects in Surveys: A New Metric
نویسندگان
چکیده
We explore the e ect of a form of question context on responses to a computer-mediated marketing research survey. As an increasing proportion of marketing research is conducted through computer interfaces, the pool of potential context e ects is rapidly expanding. We conduct an experiment using a multi-item scale that consists of ve dimensions and manipulate three such context e ects: whether an item is explicitly labeled according to subscale (labeled), whether an item is presented in isolation or with other items on the screen (grouped), and, of principal interest, whether all the items from a subscale are presented contiguously or not (clustered). An initial analysis using analysis of variance (ANOVA) indicates a signi cant reduction in variation of item scores within a subscale (subscale variance), and hence an increase in reliability, due to each of labeling, grouping, and clustering. In a more re ned analysis, we use a special onedimensional case of the spatial and attribute based distance metric proposed in Hoch, Bradlow, and Wansink (1999) to explain subscale variance, replacing the indicator variable for clustering used in the ANOVA. This metric provides a scalar measure of how much variation exists in the order of presentation of items within a subscale (the subscale distance). This analysis indicates a signi cant decrease in subscale variance (increased reliability) with decreasing subscale distance, but no longer signi cant e ects due to labeling and grouping. Implications for researchers conducting surveys in computer-mediated environments are discussed.
منابع مشابه
Research Notes and Communications
The authors explore the effect of a form of question context on responses to a computer-mediated marketing research survey. As an increasing proportion of marketing research is conducted through computer interfaces, the pool of potential context effects is rapidly expanding. The authors conduct an experiment using a multi-item scale that consists of five dimensions and manipulate three such con...
متن کاملیادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیکهای یادگیری معیار فاصله
Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...
متن کاملComposite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کاملAn Effective Approach for Robust Metric Learning in the Presence of Label Noise
Many algorithms in machine learning, pattern recognition, and data mining are based on a similarity/distance measure. For example, the kNN classifier and clustering algorithms such as k-means require a similarity/distance function. Also, in Content-Based Information Retrieval (CBIR) systems, we need to rank the retrieved objects based on the similarity to the query. As generic measures such as ...
متن کاملMulti-valued operators with respect $wt$-distance on metric type spaces
Recently, Hussain et al., discussed the concept of $wt$-distance on a metric type space. In this paper, we prove some fixed point theorems for classes of contractive type multi-valued operators, by using $wt$-distances in the setting of a complete metric type space. These results generalize a result of Feng and Liu on multi-valued operators.
متن کامل