• Journal of Digital Convergence
• /
• v.10 no.5
• /
• pp.267-273
• /
• 2012

The semantic relationship structures hierarchically the huge amount of document objects which is usually not formatted. However, it is very difficult to structure relevant data from various distributed application domains. This paper proposed a new object management method to service the distributed domain objects by using semantic reference relationship. The proposed mechanism utilized the profile structure in order to extract the semantic similarity from application domain objects and utilized the joint matrix to decide the semantic relationship of the extracted objects. This paper performed the simulation to show the performance of the proposed method, and simulation results show that the proposed method has better retrieval performance than the existing text mining method and information extraction method.

• The Journal of Asian Finance, Economics and Business
• /
• v.6 no.4
• /
• pp.179-187
• /
• 2019

This study aims to investigate the effects of market commonality and resource similarity on price competition and the recursive consequences in the Korean lodging market. Price comparison among hotels in the same geographic market has been facilitated through the development of information technology, rendering little search cost of consumers. While the literature implies the heterogeneous price attack and response among hotels, a limited number of empirical researches focus on the asymmetric and recursive pattern in the competitive dynamics. This study empirically examines the price interactions in the Korean lodging market based on the theoretical framework of competitive price interactions and countervailing power. Demonstrating superiority to the spatial lag model and the ordinary least squares in the estimation, the results from spatial error model suggest that the hotels with longer operational history pose an asymmetric impact on the price of the newer hotels. The asymmetry is also found in chain hotels over the independent, further implying the possibility of predatory pricing. The findings of this study provide the evidence of a hierarchical structure in the price competition, with different countervailing power by the resources of the hotels. Theoretical and managerial implications are discussed, with suggestions for future study.

• Smart Structures and Systems
• /
• v.26 no.1
• /
• pp.23-33
• /
• 2020

Majority of the damage in engineering structures is nonlinear. Damage sensitive features (DSFs) extracted by traditional methods from linear time series models cannot effectively handle nonlinearity induced by structural damage. A new DSF is proposed based on vector space cosine similarity (VSCS), which combines K-means cluster analysis and Bayesian discrimination to detect nonlinear structural damage. A reference autoregressive moving average (ARMA) model is built based on measured acceleration data. This study first considers an existing DSF, residual standard deviation (RSD). The DSF is further advanced using the VSCS, and then the advanced VSCS is classified using K-means cluster analysis and Bayes discriminant analysis, respectively. The performance of the proposed approach is then verified using experimental data from a three-story shear building structure, and compared with the results of existing RSD. It is demonstrated that combining the linear ARMA model and the advanced VSCS, with cluster analysis and Bayes discriminant analysis, respectively, is an effective approach for detection of nonlinear damage. This approach improves the reliability and accuracy of the nonlinear damage detection using the linear model and significantly reduces the computational cost. The results indicate that the proposed approach is potential to be a promising damage detection technique.

• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.94-106
• /
• 2014

Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance.

• Bulletin of the Korean Chemical Society
• /
• v.34 no.4
• /
• pp.1212-1220
• /
• 2013

The human coagulation factor XI (FXI) is a serine protease that plays a significant role in blocking of the blood coagulation cascade as an attractive antithrombotic target. Selective inhibition of FXIa (an activated form of factor XI) disrupts the intrinsic coagulation pathway without affecting the extrinsic pathway or other coagulation factors such as FXa, FIIa, FVIIa. Furthermore, targeting the FXIa might significantly reduce the bleeding side effects and improve the safety index. This paper reports on a docking-based three dimensional quantitative structure activity relationship (3D-QSAR) study of the potent FXIa inhibitors, the chloro-phenyl tetrazole scaffold series, using comparative molecular field analysis (CoMFA) and comparative molecular similarity analysis (CoMSIA) methods. Due to the characterization of FXIa binding site, we classified the alignment of the known FXIa inhibitors into two groups according to the docked pose: S1-S2-S4 and S1-S1'-S2'. Consequently, highly predictive 3D-QSAR models of our result will provide insight for designing new potent FXIa inhibitors.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.6
• /
• pp.404-414
• /
• 2009

In the computational molecular analysis, 3D structural comparison for protein searching plays a very important role. As protein databases have been grown rapidly in size, exhaustive search methods cannot provide satisfactory performance. Because exhaustive search methods try to handle the structure of protein by using sphere set which is converted from atoms set, the similarity calculation about two sphere sets is very expensive. Instead, the filter-and-refine paradigm offers an efficient alternative to database search without compromising the accuracy of the answers. In recent, a very fast algorithm based on the inter-atomic distance has been suggested by Ballester and Richard. Since they adopted the moments of distribution with inter-atomic distance between atoms which are rotational invariant, they can eliminate the structure alignment and orientation fix process and perform the searching faster than previous methods. In this paper, we propose a new 3D shape descriptor. It has properties of the general shape distribution and useful property in screening the molecular database. We show some experimental results for the validity of our method.

• Journal of the Korean Society for Library and Information Science
• /
• v.22
• /
• pp.331-360
• /
• 1992

This research presents author co-citation analysis of the subject area in the humanities - Korean history. Three approaches to multivariate analyses were used to display the inter-author relationships in the similarity matrix. Data on co-citation of sixty seven authors for the period of 1980­1989 were extracted from the database constructed by author. The author's name, here refers to a body of writings by a person, is the unit of analysis. The data were subjected to non-metric multidimensional scaling program create two-dimensional map of authors. Authors with similarity are clustered using hierarchical agglomerative procedure and it is found that five clusters in Korean history represent primarily research specializations. Author map of Korean history reveals the first dimension corresponding to subject orientation of authors and the second dimension corresponds to research method or research style. In factor analysis, each factor reflects research specialty made up of authors, and factor locadings demonstrate the breadth or concentration of sixty seven authors' scholarly contributions on Korean history. It is demonstrated that the· specific methodology employed by this research, author co-citation analysis, is useful to represent the intellectual structure of Korean history.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.812-824
• /
• 2021

Recently, with an increase in Internet usage, users of online social networks (OSNs) have increased. Consequently, privacy leakage has become more serious. However, few studies have investigated the difference between privacy and actual behaviors. In particular, users' desire to change their privacy status is not supported by their privacy literacy. Presenting an accurate measurement of users' privacy status can cultivate the privacy literacy of users. However, the highly interactive nature of interpersonal communication on OSNs has promoted privacy to be viewed as a communal issue. As a large number of redundant users on social networks are unrelated to the user's privacy, existing algorithms are no longer applicable. To solve this problem, we propose a structural similarity measurement method suitable for the characteristics of social networks. The proposed method excludes redundant users and combines the attribute information to measure the privacy status of users. Using this approach, users can intuitively recognize their privacy status on OSNs. Experiments using real data show that our method can effectively and accurately help users improve their privacy disclosures.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.501-512
• /
• 2003

This paper proposes an indexing technique for fast retrieval of similar image subsequences using the multi-dimensional time warping distance. The time warping distance is a more suitable similarity measure than Lp distance in many applications where sequences may be of different lengths and/or different sampling rates. Our indexing scheme employs a disk-based suffix tree as an index structure and uses a lower-bound distance function to filter out dissimilar subsequences without false dismissals. It applies the normaliration for an easier control of relative weighting of feature dimensions and the discretization to compress the index tree. Experiments on medical and synthetic image sequences verify that the proposed method significantly outperforms the naive method and scales well in a large volume of image sequence databases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2568-2584
• /
• 2015

Spectral clustering has become one of the most popular clustering approaches in recent years. Similarity graph constructed on the data is one of the key factors that influence the performance of spectral clustering. However, the similarity graphs constructed by existing methods usually contain some unreliable edges. To construct reliable similarity graph for spectral clustering, an efficient method based on Markov random walk (MRW) is proposed in this paper. In the proposed method, theMRW model is defined on the raw k-NN graph and the neighbors of each sample are determined by the probability of the MRW. Since the high order transition probabilities carry complex relationships among data, the neighbors in the graph determined by our proposed method are more reliable than those of the existing methods. Experiments are performed on the synthetic and real-world datasets for performance evaluation and comparison. The results show that the graph obtained by our proposed method reflects the structure of the data better than those of the state-of-the-art methods and can effectively improve the performance of spectral clustering.