• Journal of Digital Contents Society
• /
• v.12 no.4
• /
• pp.457-465
• /
• 2011

The annual R&D investment in Korea increased by an average of 12.2percent during the last 5 years. Therefore, prevention of duplicate projects being performed became an important factor in promoting the efficiency of R&D investment and the originality of R&D projects. On measuring the similarity of projects, the measurement model used to estimate the accuracy of the similarity is crucial. In this paper, we propose an advanced measurement model on checking the similarity of R&D projects for promoting the efficiency of R&D investment. The proposed model is made up of the following steps for the model measurement, sampling and analyzing. During the sampling step, we append the abstract of R&D reports on the search engine based on document vector. We then measure the similarity on projects to use research title network which is consists of the compound keyword and the weight of items on during the analysis. The proposed method improved the accuracy for measuring the similarity of projects by an average of 0.19 over the existing search engine and by 9.25 over the simple keyword search on R&D projects. On searching the similarity with the appending conditions and high sampling, it improved the accuracy of measuring the similarity of R&D projects.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.213-226
• /
• 2021

Given that most of the link prediction algorithms for signed social networks can only complete sign prediction, a novel algorithm is proposed aiming to achieve both link prediction and sign prediction in signed networks. Based on the structural balance theory, the local link tightness and global link tightness are defined respectively by using the structural information of paths with the step size of 2 and 3 between the two nodes. Then the total similarity of the node pair can be obtained by combining them. Its absolute value measures the possibility of the two nodes to establish a link, and its sign is the sign prediction result of the predicted link. The effectiveness and correctness of the proposed algorithm are verified on six typical datasets. Comparison and analysis are also carried out with the classical prediction algorithms in signed networks such as CN-Predict, ICN-Predict, and PSNBS (prediction in signed networks based on balance and similarity) using the evaluation indexes like area under the curve (AUC), Precision, improved AUC', improved Accuracy', and so on. Results show that the proposed algorithm achieves good performance in both link prediction and sign prediction, and its accuracy is higher than other algorithms. Moreover, it can achieve a good balance between prediction accuracy and computational complexity.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.697-699
• /
• 2007

Spatiograms are histograms augmented with spatial means and covariances to capture a richer description of the target. We present a particle filtering framework for region-based tracking using spatiograms. Unlike mean shift, the framework allows for non-differentiable similarity measures to compare two spatiograms; we present one such similarity measure, a combination of a recent weighting scheme and histogram intersection. Experimental results show improved performance with the new measure as well as the importance of global spatial information for tracking. The performance of spatiograms is compared with color histograms and several texture histogram methods.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.3
• /
• pp.51-55
• /
• 2020

In this paper, an improved FAM is proposed by adopting similarity learning in the existing FAM (Fuzzy Associative Memory) used in image restoration. Image restoration refers to the recovery of the latent clean image from its noise-corrupted version. In serious application like face recognition, this process should be noise-tolerant, robust, fast, and scalable. The existing FAM is a simple single layered neural network that can be applied to this domain with its robust fuzzy control but has low capacity problem in real world applications. That similarity measure is implied to the connection strength of the FAM structure to minimize the root mean square error between the recovered and the original image. The efficacy of the proposed algorithm is verified with significant low error magnitude from random noise in our experiment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4461-4475
• /
• 2017

Recently, introduction of the hospital information system has remarkably improved the efficiency of health care services within hospitals. Due to improvement of the hospital information system, the issue of integration of medical information has emerged, and attempts to achieve it have been made. However, as a preceding step for integration of medical information, the problem of searching the same patient should be solved first, and studies on patient identification algorithm are required. As a typical case, similarity can be calculated through MPI (Master Patient Index) module, by comparing various fields such as patient's basic information and treatment information, etc. but it has many problems including the language system not suitable to Korean, estimation of an optimal weight by field, etc. This paper proposes a method searching the same patient using MRI information besides patient's field information as a supplementary method to increase the accuracy of matching algorithm such as MPI, etc. Unlike existing methods only using image information, upon identifying a patient, a highest weight was given to physical information of medical image and set as an unchangeable unique value, and as a result a high accuracy was detected. We aim to use the similarity measurement result as secondary measures in identifying a patient in the future.

• 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.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.4
• /
• pp.853-861
• /
• 2003

An improved K-means document clustering method has been presented, where a concept vector is manipulated for each cluster on the basis of cosine similarity of text documents. The concept vectors are unit vectors that have been normalized on the n-dimensional sphere. Because the standard K-means method is sensitive to initial starting condition, our improvement focused on starting condition for estimating the modes of a distribution. The improved K-means clustering algorithm has been applied to a set of text documents, called Classic3, to test and prove efficiency and correctness of clustering result, and showed 7% improvements in its worst case.

• Proceedings of the Korea Contents Association Conference
• /
• 2014.06a
• /
• pp.471-472
• /
• 2014

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.8
• /
• pp.45-50
• /
• 2018

Many of the current successful commercial recommender systems utilize collaborative filtering techniques. This technique recommends products to the active user based on product preference history of the neighbor users. Those users with similar preferences to the active user are typically named his/her neighbors. Hence, finding neighbors is critical to performance of the system. Although much effort for developing similarity measures has been devoted in the literature, there leaves a lot to be improved, especially in the aspect of handling subjectivity or vagueness in user preference ratings. This paper addresses this problem and presents a novel similarity measure using fuzzy logic for selecting neighbors. Experimental studies are conducted to reveal that the proposed measure achieved significant performance improvement.

• Communications for Statistical Applications and Methods
• /
• v.11 no.2
• /
• pp.369-380
• /
• 2004

Clustering algorithms with different similarity measures are commonly used to find an optimal clustering or close to original clustering. The recovery level of using Euclidean distance and distances transformed from correlation coefficients is evaluated and compared using Rand's (1971) C statistic. The C values present how the resultant clustering is close to the original clustering. In simulation study, the recovery level is improved by applying the correlation coefficients between objects. Using the data set from Spellman et al. (1998), the recovery levels with different similarity measures are also presented. In general, the recovery level of true clusters was increased by using the correlation coefficients.