• 제목/요약/키워드: multidimensional scaling

검색결과 354건 처리시간 0.023초

Resistant Multidimensional Scaling

  • Shin, Yang-Kyu
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2005년도 추계학술대회
    • /
    • pp.47-48
    • /
    • 2005
  • Multidimensional scaling is a multivariate technique for constructing a configuration of n points in Euclidean space using information about the distances between the objects. This can be done by the singular value decomposition of the data matrix. But it is known that the singular value decomposition is not resistant. In this study, we provide a resistant version of the multidimensional scaling.

  • PDF

UNDERSTANDING SERVICE QUALITY: A MULTIDIMENSIONAL SCALING APPROACH

  • Lee, Dong-Won;Kim, Youn-Sung
    • 품질경영학회지
    • /
    • 제32권3호
    • /
    • pp.68-80
    • /
    • 2004
  • This paper purports to uncover the underlying attributes used by customers to gauge service quality. Data was collected by administering questionnaires to 50 respondents and then analyzed by using Multidimensional Scaling methodology. The findings indicate that there are two primary dimensions to service quality. This analysis helped determine us two alternatives to naming the dimensions. Experience properties of service and Price value of the service, or Responsiveness of service provider employees and Reliability of service providers.

UNDERSTANDING SERVICE QUALITY: A MULTIDIMENSIONAL SCALING APPROACH

  • Lee Dongwon;Kim Youn Sung
    • 한국품질경영학회:학술대회논문집
    • /
    • 한국품질경영학회 2004년도 품질경영모델을 통한 가치 창출
    • /
    • pp.639-645
    • /
    • 2004
  • This paper purports to uncover the underlying attributes used by customers to gauge service quality. Data was collected by administering questionnaires to 50 respondents and then analyzed by using Multidimensional Scaling methodology. The findings indicate that there are two primary dimensions to service quality. A considerable analysis helped determine two alternatives to naming the dimensions: Experience properties of service and Price value of the service, or Responsiveness of service provider employees and Reliability of service providers.

  • PDF

클러스터링을 고려한 다차원척도법의 개선: 군집 지향 척도법 (Improved Multidimensional Scaling Techniques Considering Cluster Analysis: Cluster-oriented Scaling)

  • 이재윤
    • 정보관리학회지
    • /
    • 제29권2호
    • /
    • pp.45-70
    • /
    • 2012
  • 개체들 사이의 관계를 저차원 공간에 매핑하는 다차원척도법을 수행하기 위한 다양한 방법과 알고리즘이 개발되어왔다. 그러나 PROXSCAL이나 ALSCAL과 같은 기존의 기법들은 50개 이상의 개체를 포함하는 데이터 집합을 대상으로 개체 간의 관계와 군집 구조를 시각화하는데 있어서 효과적이지 못한 것으로 나타났다. 이 연구에서 제안하는 군집 지향 척도법 CLUSCAL(CLUster-oriented SCALing)은 기존 방법과 달리 입력되는 데이터의 군집 구조를 고려하도록 고안되었다. 50명의 저자동시인용 데이터와 85개 단어의 동시출현 데이터에 대해서 적용해본 결과 제안한 CLUSCAL 기법은 군집 구조를 잘 식별할 수 있는 MDS 지도를 생성하는 유용한 기법임이 확인되었다.

새로운 적합도 함수를 사용한 비계량형 다차원 척도법에 대한 연구 (A Study on Non-Metric Multidimensional Scaling Using A New Fitness Function)

  • 이동주;이창용
    • 산업경영시스템학회지
    • /
    • 제34권2호
    • /
    • pp.60-67
    • /
    • 2011
  • Since the non-metric Multidimensional scaling (nMDS), a data visualization technique, provides with insights about engineering, economic, and scientific applications, it is widely used for analyzing large non-metric multidimensional data sets. The nMDS requires a fitness function to measure fit of the proximity data by the distances among n objects. Most commonly used fitness functions are nonlinear and have a difficulty to find a good configuration. In this paper, we propose a new fitness function, an absolute value type, and show its advantages.

CUDA 및 분할-정복 기반의 효율적인 다차원 척도법 (An Efficient Multidimensional Scaling Method based on CUDA and Divide-and-Conquer)

  • 박성인;황규백
    • 한국정보과학회논문지:컴퓨팅의 실제 및 레터
    • /
    • 제16권4호
    • /
    • pp.427-431
    • /
    • 2010
  • 다차원 척도법(multidimensional scaling)은 고차원의 데이터를 낮은 차원의 공간에 매핑(mapping)하여 데이터 간의 유사성을 표현하는 방법이다. 이는 주로 자질 선정 및 데이터를 시각화하는 데 이용된다. 그러한 다차원 척도법 중, 전통 다차원 척도법(classical multidimensional scaling)은 긴 수행 시간과 큰 공간을 필요로 하기 때문에 객체의 수가 많은 경우에 대해 적용하기 어렵다. 이는 유클리드 거리(Euclidean distance)에 기반한 $n{\times}n$ 상이도 행렬(dissimilarity matrix)에 대해 고유쌍 문제(eigenpair problem)를 풀어야 하기 때문이다(단, n은 객체의 개수). 따라서, n이 커질수록 수행 시간이 길어지며, 메모리 사용량 증가로 인해 적용할 수 있는 데이터 크기에 한계가 있다. 본 논문에서는 이러한 문제를 완화하기 위해 GPGPU 기술 중 하나인 CUDA와 분할-정복(divide-and-conquer)기법을 활용한 효율적인 다차원 척도법을 제안하며, 다양한 실험을 통해 제안하는 기법이 객체의 개수가 많은 경우에 매우 효율적일 수 있음을 보인다.

다차원척도법을 이용한 여성기성복 상표 포지셔닝 연구 (A Study on Development of Brand Positioning Map for Ladies' Ready-to-Wear Utilizing Multidimensional Scaling Method)

  • 오현주;이은영
    • 한국의류학회지
    • /
    • 제14권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.

  • PDF

비대칭 다차원척도법의 시각화 (Visualizations of Asymmetric Multidimensional Scaling)

  • 이수기;최용석;이보희
    • 응용통계연구
    • /
    • 제27권4호
    • /
    • pp.619-627
    • /
    • 2014
  • 다차원척도법(MDS)에서는 대게 개체간의 거리나 유사성이 대칭성을 따른다. 따라서 비대칭 거리를 다루기는 쉽지 않다. 통용되고 있는 비대칭 다차원척도법도 여전히 결과를 해석하는데 어려움이 있다. 본 연구는 비대칭행렬의 순서 통계량을 활용하여 더 간단한 비대칭 대차원척도법을 제안한다. 제안된 웹(Web) 방법은 개체간의 영향력을 사용자들이 해석을 쉽게 하도록 화살표의 방향크기와 모양에 따라 시각화하여 보여준다.

Multidimensional Scaling of Asymmetric Distance Matrices

  • Huh, Myung-Hoe;Lee, Yong-Goo
    • 응용통계연구
    • /
    • 제25권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.

멀티로봇 위치 인식을 위한 강화 다차원 척도법 (Robust Multidimensional Scaling for Multi-robot Localization)

  • 제홍모;김대진
    • 로봇학회논문지
    • /
    • 제3권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).

  • PDF