• Journal of The Korean Society of Grassland and Forage Science
• /
• v.18 no.2
• /
• pp.143-150
• /
• 1998

Six field bean (GI-vcine soza S and Z ) plants were examined for their genetic polymorphisms and intraspecific variations using randomly amplified polymorphic DNA(RAPD) markers. In RAPD analysis of 5 random primers (Rp-1, Rp2, Rp-3, Rp-4, Rp-5), 30 of total 155 bands obtained kom 5 primers were polymorphic and sizes of polymirphic band ranged between 0.5 and 3.0 kb. Number of bands amplyfied per primer was varied from 2 to 11 and average number was 6.0. Genetic variation of intraspecies in the samples of six region was ranged behveen 11 to 25 percent, and genetic similarity among intraspecies was ranged from 0.69 to 0.78. In pairwise genetic similarity test of six field bean plants, Mun and Hoj showed highest coefficient of genetic similarity as 0.67, whereas Sin and Hoj was lowest as 0.45. According to the genetic similarity, the level of intraspecific variation is higher than that of regional distance in GI-vcine soza.

• Communications for Statistical Applications and Methods
• /
• v.27 no.6
• /
• pp.589-602
• /
• 2020

The development of smart grids has enabled the easy collection of a large amount of power data. There are some common patterns that make it useful to cluster power consumption patterns when analyzing s power big data. In this paper, clustering analysis is based on distance functions for time series and clustering algorithms to discover patterns for power consumption data. In clustering, we use 10 distance measures to find the clusters that consider the characteristics of time series data. A simulation study is done to compare the distance measures for clustering. Cluster validity measures are also calculated and compared such as error rate, similarity index, Dunn index and silhouette values. Real power consumption data are used for clustering, with five distance measures whose performances are better than others in the simulation.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.3
• /
• pp.37-46
• /
• 2013

Similarity measure of catchments is essential for regionalization studies, which provide in depth analysis in hydrological response and flood estimations at ungauged catchments. However, this similarity measure is often biased to the selected catchments and is not clearly explained in hydrological sense. This study applied a type of hydrological similarity distance measure-Flood Estimation Handbook to 25 Geum River catchments, Korea. Three Catchment Characteristics, Area(A)-Annual precipitation(SAAR)-SCS Curve Number(CN), are used in Euclidian distance measures. Furthermore, six index of Flow Duration Curve are applied to clustering analysis of SPSS. The catchments' grouping of hydrological similarity measures suggests three groups (H1, H2 and H3) and the four catchments are not grouped in this study. The clustering analysis of FDC provides four Groups; F1, F2, F3 and F4. The six catchments (out of seven) of H1 are grouped in F1, while Sangyeogyo is grouped in F2. The four catchments (out of six) of H2 are also grouped in F2, while Cheongju and Guryong are grouped in F1. The catchments of H3 are categorized in F1. The authors examine the results (H1, H2 and H3) of similarity measure based on catchment physical descriptors with results (F1 and F2) of clustering based on catchment hydrological response. The results of hydrological similarity measures are supported by clustering analysis of FDC. This study shows a potential of hydrological catchment similarity measures in Korea.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.3E
• /
• pp.69-73
• /
• 2007

This paper presents an efficient algorithm to retrieve similar music files from a large archive of digital music database. Users are able to navigate and discover new music files which sound similar to a given query music file by searching for the archive. Since most of the methods for finding similar music files from a large database requires on computing the distance between a given query music file and every music file in the database, they are very time-consuming procedures. By measuring the acoustic distance between the pre-classified music files with the same type of emotion, the proposed method significantly speeds up the search process and increases the precision in comparison with the brute-force method.

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.136-144
• /
• 2002

In this paper, a novel approach that makes use of both shape and color information to retrieve character images in terms of similarity distance from a large-capacity image database or from a streaming image database, in particular, character image logo or trademark. In order to combine both features of completely different characteristics bipartite matching has been employed in computing similarity distance, The proposed method turned out to bealso very effective in matching natural object or human-drawn images whose shape varies substantially.

• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.185-199
• /
• 2024

In this paper, an improved automated spectral clustering (IASC) algorithm is proposed to address the limitations of the traditional spectral clustering (TSC) algorithm, particularly its inability to automatically determine the number of clusters. Firstly, a cluster number evaluation factor based on the optimal clustering principle is proposed. By iterating through different k values, the value corresponding to the largest evaluation factor was selected as the first-rank number of clusters. Secondly, the IASC algorithm adopts a density-sensitive distance to measure the similarity between the sample points. This rendered a high similarity to the data distributed in the same high-density area. Thirdly, to improve clustering accuracy, the IASC algorithm uses the cosine angle classification method instead of K-means to classify the eigenvectors. Six algorithms-K-means, fuzzy C-means, TSC, EIGENGAP, DBSCAN, and density peak-were compared with the proposed algorithm on six datasets. The results show that the IASC algorithm not only automatically determines the number of clusters but also obtains better clustering accuracy on both synthetic and UCI datasets.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.538-561
• /
• 2020

Recommender Systems (RecSys) have a major role in e-commerce for recommending products, which they may like for every user and thus improve their business aspects. Although many types of RecSyss are there in the research field, the state of the art RecSys has focused on finding the user similarity based on sequence (e.g. purchase history, movie-watching history) analyzing and prediction techniques like Recurrent Neural Network in Deep learning. That is RecSys has considered as a sequence prediction problem. However, evaluation of similarities among the customers is challenging while considering temporal aspects, context and multi-component ratings of the item-records in the customer sequences. For addressing this issue, we are proposing a Deep Learning based model which learns customer similarity directly from the sequence to sequence similarity as well as item to item similarity by considering all features of the item, contexts, and rating components using Dynamic Temporal Warping(DTW) distance measure for dynamic temporal matching and 2D-GRU (Two Dimensional-Gated Recurrent Unit) architecture. This will overcome the limitation of non-linearity in the time dimension while measuring the similarity, and the find patterns more accurately and speedily from temporal and spatial contexts. Experiment on the real world movie data set LDOS-CoMoDa demonstrates the efficacy and promising utility of the proposed personalized RecSys architecture.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.1
• /
• pp.159-166
• /
• 2004

Custom-tailored products are meant by the products having various sizes and shapes to meet the customer's different tastes or needs. Thus fabrication of custom-tailored products inherently involves inefficiency. To minimize this inefficiency, a new paradigm is proposed in this work. In this paradigm, different parts are grouped together according to their sizes and shapes. Then, representative shape of each group is derived and it will be used as the work-piece from which the parts in the group are machined. Once a new product is ordered, the optimal work-piece is selected through making similarity comparisons of new product and each representative shape. Then an effective NC tool-path is generated to machine only the different portions between the work-piece and the ordered product. The efficient machining conditions are also derived from this shape difference. By machining only the different portions between the work-piece and the ordered product, it saves time. Similarity comparison starts with the determination of the closest pose between two shapes in consideration. The closest pose is derived by comparing the ray distances while one shape is virtually rotated with respect to the other. Shape similarity value and overall similarity value calculated from ray distances are used for grouping. A prototype system based on the proposed methodology has been implemented and applied to the grouping and machining of the shoe lasts of various shapes and sizes.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.70-73
• /
• 2003

Custom-tailored products are meant by the products having various sizes and shapes to meet the customer's different tastes or needs. Thus fabrication of custom-tailored products inherently involves inefficiency. To minimize this inefficiency, a new paradigm is proposed in this work. In this paradigm. different paris are grouped together according to their sizes and shapes. Then, representative shape of each group is derived and it will be used as the work-piece from which the parts in the group are machined. Once a new product is ordered, the optimal work-piece is selected through making similarity comparisons of new product and each representative shape. Then an effective NC tool-path is generated to machine only the different portions between the work-piece and the ordered product. The efficient machining conditions are also derived from this shape difference. By machining only the different portions between the work-piece and the ordered product, it saves time. Similarity comparison starts with the determination of the closest pose between two shapes in consideration. The closest pose is derived by comparing the ray distances while one shape is virtually rotated with respect to the other. Shape similarity value and overall similarity value calculated from ray distances are used for grouping. A prototype system based on the proposed methodology has been implemented and applied to the grouping and machining of the shoe lasts of various shapes and sizes.

• Smart Structures and Systems
• /
• v.23 no.3
• /
• pp.279-293
• /
• 2019

To ensure high quality data being used for data mining or feature extraction in the bridge structural health monitoring (SHM) system, a practical sensor fault diagnosis methodology has been developed based on the similarity of symmetric structure responses. First, the similarity of symmetric response is discussed using field monitoring data from different sensor types. All the sensors are initially paired and sensor faults are then detected pair by pair to achieve the multi-fault diagnosis of sensor systems. To resolve the coupling response issue between structural damage and sensor fault, the similarity for the target zone (where the studied sensor pair is located) is assessed to determine whether the localized structural damage or sensor fault results in the dissimilarity of the studied sensor pair. If the suspected sensor pair is detected with at least one sensor being faulty, field test could be implemented to support the regression analysis based on the monitoring and field test data for sensor fault isolation and reconstruction. Finally, a case study is adopted to demonstrate the effectiveness of the proposed methodology. As a result, Dasarathy's information fusion model is adopted for multi-sensor information fusion. Euclidean distance is selected as the index to assess the similarity. In conclusion, the proposed method is practical for actual engineering which ensures the reliability of further analysis based on monitoring data.