• Journal of the Korean Society of Clothing and Textiles
• /
• v.14 no.2
• /
• pp.129-136
• /
• 1990

The purpose of the study was to develope brand positioning map for ladies' ready-to-wear, to find out evaluative criteria in perception and preference to brands, and to persent the relationship between consumer's characteristics and brand preference. Subjects were selected for the housewives of middle and high socioeconomic classes living in Seoul area. A questionnaire including items of life style, self image, similarity between brands, preference degree to brands, and demographic variables was developed for the empirical study. The questionnaire was administrated to 137 housewives during fall in 1989. Data were analyzed by cluster analysis and multidimensional scaling method. The study had two research problems. The first research problem was to construct a brand perceptual map for ladies' ready-to-wear brands, selected for the study The perceptual map was constructed on the basis of brand similarity scores by multidimensional scaling method. As a result, brands were grouped into 4 clusters, and evaluative criteria for perceptual map were found to be fashionability (classic- fashionable) and familiarity (familiar-unfamiliar). The second problem was to construct a brand preference map for ladies' ready-to-wear brands, selected for the study. The preference map was constructed on the basis of brand preference scores by multidimensional scaling method. As a result, the brands were grouped into 4 clusters and evaluative critiera for preference map were found to be fashionability (unfashionable-fashionable) and image to age (mature-young directed). Also was shown the relationship among self image, age, socioeconomic class, and brand preference. The multidimensional scaling method was found to be useful as well as valid instrument for brand positioning research and the result can be utilized for establishing strategies for ladies' ready-to-wear brands.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.93-97
• /
• 2002

In this paper, we propose personalized recommendation techniques based on multidimensional scaling (MDS) method for Business to Consumer Electronic Commerce. The multidimensional scaling method is traditionally used in marketing domain for analyzing customers' perceptional differences about brands and products. In this study, using purchase history data, customers in learning dataset are assigned to specific product categories, and after then using MDS a positioning map is generated to map product categories and alternative advertisements. The positioning map will be used to select personalized advertisement in real time situation. In this paper, we suggest the detail design of personalized recommendation method using MDS and compare with other approaches (random approach, collaborative filtering, and TOP3 approach)

• The Korean Journal of Applied Statistics
• /
• v.27 no.4
• /
• pp.619-627
• /
• 2014

Distances or dissimilarities among units are assumed to be symmetric in most cases of multidimensional scaling(MDS); consequently, it is not an easy task to deal with asymmetric distances. Current asymmetric MDS still face difficulties in the interpretation of results. This study proposes a simpler asymmetric MDS that utilizes the order statistic of an asymmetric matrix. The proposed Web method demonstrates that some influences among objects are visualized by direction, size and shape of arrow to ease the interpretability of users.

• Journal of the Korean Society for information Management
• /
• v.29 no.2
• /
• pp.45-70
• /
• 2012

There have been many methods and algorithms proposed for multidimensional scaling to mapping the relationships between data objects into low dimensional space. But traditional techniques, such as PROXSCAL or ALSCAL, were found not effective for visualizing the proximities between objects and the structure of clusters of large data sets have more than 50 objects. The CLUSCAL(CLUster-oriented SCALing) technique introduced in this paper differs from them especially in that it uses cluster structure of input data set. The CLUSCAL procedure was tested and evaluated on two data sets, one is 50 authors co-citation data and the other is 85 words co-occurrence data. The results can be regarded as promising the usefulness of CLUSCAL method especially in identifying clusters on MDS maps.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.427-431
• /
• 2010

Multidimensional scaling (MDS) is a widely used method for dimensionality reduction, of which purpose is to represent high-dimensional data in a low-dimensional space while preserving distances among objects as much as possible. MDS has mainly been applied to data visualization and feature selection. Among various MDS methods, the classical MDS is not readily applicable to data which has large numbers of objects, on normal desktop computers due to its computational complexity. More precisely, it needs to solve eigenpair problems on dissimilarity matrices based on Euclidean distance. Thus, running time and required memory of the classical MDS highly increase as n (the number of objects) grows up, restricting its use in large-scale domains. In this paper, we propose an efficient approximation algorithm for the classical MDS based on divide-and-conquer and CUDA. Through a set of experiments, we show that our approach is highly efficient and effective for analysis and visualization of data consisting of several thousands of objects.

• Journal of Biomedical Engineering Research
• /
• v.31 no.2
• /
• pp.134-140
• /
• 2010

Readily available high resolution brain MRI scans allow detailed visualization of the brain structures. Researchers have focused on developing methods to quantify shape differences specific to diseased scans. We have developed a novel method to quantify shape information for a specific population based on Multidimensional scaling(MDS). MDS is a well known tool in statistics and here we apply this classical tool to quantify shape change. Distance measures are required in MDS which are computed from pair-wise image registrations of the training set. Registration step establishes spatial correspondence among scans so that they can be compared in the same spatial framework. One benefit of our method is that it is quite robust to errors in registrations. Applying our method to 13 brain MRI showed clear separation between normal and diseased (Cushing's syndrome). Intentionally perturbing the image registration results did not significantly affect the separability of two clusters. We have developed a novel method to quantify shape based on MDS, which is robust to image mis-registration.

• The Korean Journal of Applied Statistics
• /
• v.25 no.4
• /
• pp.613-620
• /
• 2012

In most cases of multidimensional scaling(MDS), the distances or dissimilarities among units are assumed to be symmetric. Thus, it is not an easy task to deal with asymmetric distances. Asymmetric MDS developed so far face difficulties in the interpretation of results. This study proposes a much simpler asymmetric MDS, that utilizes the notion of "altitude". The analogy arises in mountaineering: It is easier (more difficult) to move from the higher (lower) point to the lower (higher). The idea is formulated as a quantification problem, in which the disparity of distances is maximally related to the altitude difference. The proposed method is demonstrated in three examples, in which the altitudes are visualized by rainbow colors to ease the interpretability of users.

• The Journal of Korea Robotics Society
• /
• v.3 no.2
• /
• pp.117-122
• /
• 2008

This paper presents a multi-robot localization based on multidimensional scaling (MDS) in spite of the existence of incomplete and noisy data. While the traditional algorithms for MDS work on the full-rank distance matrix, there might be many missing data in the real world due to occlusions. Moreover, it has no considerations to dealing with the uncertainty due to noisy observations. We propose a robust MDS to handle both the incomplete and noisy data, which is applied to solve the multi-robot localization problem. To deal with the incomplete data, we use the Nystr$\ddot{o}$m approximation which approximates the full distance matrix. To deal with the uncertainty, we formulate a Bayesian framework for MDS which finds the posterior of coordinates of objects by means of statistical inference. We not only verify the performance of MDS-based multi-robot localization by computer simulations, but also implement a real world localization of multi-robot team. Using extensive empirical results, we show that the accuracy of the proposed method is almost similar to that of Monte Carlo Localization(MCL).

• The Korean Journal of Applied Statistics
• /
• v.30 no.4
• /
• pp.567-578
• /
• 2017

Grouped multivariate data can be tested for differences between two or more groups using multivariate analysis of variance (MANOVA). However, this method cannot be used if several assumptions of MANOVA are violated. In this case, multidimensional scaling (MDS) and analysis of distance (AOD) can be applied to grouped dissimilarities based on the various distances. A permutation test is a non-parametric method that can also be used to test differences between groups. MDS is used to calculate the coordinates of observations from dissimilarities and AOD is useful for finding group structure using the coordinates. In particular, AOD is mathematically associated with MANOVA if using the Euclidean distance when computing dissimilarities. In this paper, we study the between and within group structure by applying MDS and AOD to the grouped dissimilarities. In addition, we propose a new test statistic using the group structure for the permutation test. Finally, we investigate the relationship between AOD and MANOVA from dissimilarities based on the Euclidean distance.

• Journal of the Korean Society for information Management
• /
• v.23 no.4 s.62
• /
• pp.215-231
• /
• 2006

Recently there are many bibliometric studies attempting to utilize Pathfinder networks(PFNets) for examining and analyzing the intellectual structure of a scholarly field. Pathfinder network scaling has many advantages over traditional multidimensional scaling, including its ability to represent local details as well as global intellectual structure. However there are some limitations in PFNets including very high time complexity. And Pathfinder network scaling cannot be combined with cluster analysis, which has been combined well with traditional multidimensional scaling method. In this paper, a new method named as Parallel Nearest Neighbor Clustering (PNNC) are proposed for complementing those weak points of PFNets. Comparing the clustering performance with traditional hierarchical agglomerative clustering methods shows that PNNC is not only a complement to PFNets but also a fast and powerful clustering method for organizing informations.