• Title/Summary/Keyword: Similarity Distance

Search Result 632, Processing Time 0.022 seconds

Effects of Temporal Distance on Brand Extension Evaluation: Applying the Construal-Level Perspective to Brand Extensions

  • Park, Kiwan
    • Asia Marketing Journal
    • /
    • v.17 no.1
    • /
    • pp.97-121
    • /
    • 2015
  • In this research, we examine whether and why temporal distance influences evaluations of two different types of brand extensions: concept-based extensions, defined as extensions primarily based on the importance or relevance of brand concepts to extension products; and similarity-based extensions, defined as extensions primarily based on the amount of feature similarity at the product-category level. In Study 1, we test the hypothesis that concept-based extensions are evaluated more favorably when they are framed to launch in the distant rather than in the near future, whereas similaritybased extensions are evaluated more favorably when they are framed to launch in the near rather than in the distant future. In Study 2, we confirm that this time-dependent differential evaluation is driven by the difference in construal level between the bases of the two types of extensions - i.e., brand-concept consistency and product-category feature similarity. As such, we find that conceptbased extensions are evaluated more favorably under the abstract than concrete mindset, whereas similarity-based extensions are evaluated more favorably under the concrete than abstract mindset. In Study 3, we extend to the case for a broad brand (i.e., brands that market products across multiple categories), finding that making accessible a specific product category of a broad parent brand influences evaluations of near-future, but not distant-future, brand extensions. Combined together, our findings suggest that temporal distance influences brand extension evaluation through its effect on the importance placed on brand concepts and feature similarity. That is, consumers rely on different bases to evaluate brand extensions, depending on their perception of when the extensions take place and on under what mindset they are placed. This research makes theoretical contributions to the brand extension research by identifying one important determinant to brand extension evaluation and also uncovering its underlying dynamics. It also contributes to expanding the scope of the construal level theory by putting forth a novel interpretation of two bases of perceived fit in terms of construal level. Marketers who are about to launch and advertise brand extensions may benefit by considering temporal-distance information in determining what content to deliver about extensions in their communication efforts. Conceptual relation of a parent brand to extensions needs to be emphasized in the distant future, whereas feature similarity should be highlighted in the near future.

Similarity Analysis Between Fuzzy Set and Crisp Set

  • Park, Hyun-Jeong;Lee, Sang-Hyuk.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.7 no.4
    • /
    • pp.295-300
    • /
    • 2007
  • The similarity analysis for fuzzy set pair or crisp set pair are carried out. The similarity measure that is based on distance measure is derived and proved. The proposed similarity measure is considered with the help of analysis for uncertainty or certainty part of the membership functions. The usefulness of proposed similarity is verified through the computation of similarity between fuzzy set and crisp set or fuzzy set and fuzzy set. Our results are also compared with those of previous similarity measure which is based on fuzzy number.

Reliable Data Selection using Similarity Measure (유사측도를 이용한 신뢰성 있는 데이터의 추출)

  • Ryu, Soo-Rok;Lee, Sang-Hyuk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.2
    • /
    • pp.200-205
    • /
    • 2008
  • For data analysis, fuzzy entropy is introduced as the measure of fuzziness, similarity measure is also constructed to represent similarity between data. Similarity measure between fuzzy membership functions is constructed through distance measure, and the proposed similarity measure are proved. Application of proposed similarity measure to the example of reliable data selection is also carried out. Application results are compared with the previous results that is obtained through fuzzy entropy and statistical knowledge.

DYNAMIC TIME WARPING FOR EFFICIENT RANGE QUERY

  • Long Chuyu Li;Jin Sungbo Seo;Ryu Keun Ho
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.294-297
    • /
    • 2005
  • Time series are comprehensively appeared and developed in many applications, ranging from science and technology to business and entertainrilent. Similarity search under time warping has attracted much interest between the time series in the large sequence databases. DTW (Dynamic Time Warping) is a robust distance measure and is superior to Euclidean distance for time series, allowing similarity matching although one of the sequences can elastic shift along the time axis. Nevertheless, it is more unfortunate that DTW has a quadratic time. Simultaneously the false dismissals are come forth since DTW distance does not satisfy the triangular inequality. In this paper, we propose an efficient range query algorithmbased on a new similarity search method under time warping. When our range query applies for this method, it can remove the significant non-qualify time series as early as possible before computing the accuracy DTW distance. Hence, it speeds up the calculation time and reduces the number of scanning the time series. Guaranteeing no false dismissals, the lower bounding function is advised that consistently underestimate the DTW distance and satisfy the triangular inequality. Through the experimental result, our range query algorithm outperforms the existing others.

  • PDF

Distance measure between intuitionistic fuzzy sets and its application to pattern recognition

  • Park, Jin-Han;Lim, Ki-Moon;Kwun, Young-Chel
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.4
    • /
    • pp.556-561
    • /
    • 2009
  • In this paper, we propose new method to calculate the distance between intuitionistic fuzzy sets(IFSs) based on the three dimensional representation of IFSs and analyze the relations of similarity measure and distance measure of IFSs. Finally, we apply the proposed measures to pattern recognitions.

A note on distance measure and similarity measure defined by Choquet integral on interval-valued fuzzy sets (구간치 퍼지집합 상에서 쇼케이적분에 의해 정의된 거리측도와 유사측도에 관한 연구)

  • Jang, Lee-Chae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.4
    • /
    • pp.455-459
    • /
    • 2007
  • Interval-valued fuzzy sets were suggested for the first time by Gorzafczany(1983) and Turksen(1986). Based on this, Zeng and Li(2006) introduced concepts of similarity measure and entropy on interval-valued fuzzy sets which are different from Bustince and Burillo(1996). In this paper, by using Choquet integral with respect to a fuzzy measure, we introduce distance measure and similarity measure defined by Choquet integral on interval-valued fuzzy sets and discuss some properties of them. Choquet integral is a generalization concept of Lebesgue inetgral, because the two definitions of Choquet integral and Lebesgue integral are equal if a fuzzy measure is a classical measure.

Measurement of graphs similarity using graph centralities

  • Cho, Tae-Soo;Han, Chi-Geun;Lee, Sang-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.12
    • /
    • pp.57-64
    • /
    • 2018
  • In this paper, a method to measure similarity between two graphs is proposed, which is based on centralities of the graphs. The similarity between two graphs $G_1$ and $G_2$ is defined by the difference of distance($G_1$, $G_{R_1}$) and distance($G_2$, $G_{R_2}$), where $G_{R_1}$ and $G_{R_2}$ are set of random graphs that have the same number of nodes and edges as $G_1$ and $G_2$, respectively. Each distance ($G_*$, $G_{R_*}$) is obtained by comparing centralities of $G_*$ and $G_{R_*}$. Through the computational experiments, we show that it is possible to compare graphs regardless of the number of vertices or edges of the graphs. Also, it is possible to identify and classify the properties of the graphs by measuring and comparing similarities between two graphs.

Centroid-model based music similarity with alpha divergence (알파 다이버전스를 이용한 무게중심 모델 기반 음악 유사도)

  • Seo, Jin Soo;Kim, Jeonghyun;Park, Jihyun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.35 no.2
    • /
    • pp.83-91
    • /
    • 2016
  • Music-similarity computation is crucial in developing music information retrieval systems for browsing and classification. This paper overviews the recently-proposed centroid-model based music retrieval method and applies the distributional similarity measures to the model for retrieval-performance evaluation. Probabilistic distance measures (also called divergence) compute the distance between two probability distributions in a certain sense. In this paper, we consider the alpha divergence in computing distance between two centroid models for music retrieval. The alpha divergence includes the widely-used Kullback-Leibler divergence and Bhattacharyya distance depending on the values of alpha. Experiments were conducted on both genre and singer datasets. We compare the music-retrieval performance of the distributional similarity with that of the vector distances. The experimental results show that the alpha divergence improves the performance of the centroid-model based music retrieval.

Evaluating the Contribution of Spectral Features to Image Classification Using Class Separability

  • Ye, Chul-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.36 no.1
    • /
    • pp.55-65
    • /
    • 2020
  • Image classification needs the spectral similarity comparison between spectral features of each pixel and the representative spectral features of each class. The spectral similarity is obtained by computing the spectral feature vector distance between the pixel and the class. Each spectral feature contributes differently in the image classification depending on the class separability of the spectral feature, which is computed using a suitable vector distance measure such as the Bhattacharyya distance. We propose a method to determine the weight value of each spectral feature in the computation of feature vector distance for the similarity measurement. The weight value is determined by the ratio between each feature separability value to the total separability values of all the spectral features. We created ten spectral features consisting of seven bands of Landsat-8 OLI image and three indices, NDVI, NDWI and NDBI. For three experimental test sites, we obtained the overall accuracies between 95.0% and 97.5% and the kappa coefficients between 90.43% and 94.47%.

Comparison of Reseults using Average Taxonomic Distance and Correlation Coefficient Matrices for Cluster Analyses (Cluster Analyses에서 Average Taxonomic Distance와 Correlation Coefficient 행렬식들을 이용한 결과의 비교)

  • Koh, Hung-Sun
    • The Korean Journal of Zoology
    • /
    • v.24 no.2
    • /
    • pp.91-98
    • /
    • 1981
  • It has been confirmed that two dendrograms resulted from two similarity matrices, average taxonomic distance and correlation coefficient matrices, are different with each other when cluster analyses were performed with 571 adults of deer mice, Peromyscus maniculatus using 30 morphometric characters. To choose one of two similarity matrices mentioned above in order to construct a dendrogram representing phenetic relationships among taxa, an objective method using the result from principal component analysis as a standard result to compare with two matrices has been suggested.

  • PDF