• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.1-7
• /
• 2009

In recent years, compressed sensing (CS) algorithm has been studied in various research areas including medical imaging. To use the CS algorithm, the signal that is to be reconstructed needs to have the property of sparsity But, most medical images generally don't have this property. One method to overcome this problem is by using sparsifying transform. However, MR imaging, compared to other medical imaging modality, has the unique property that by using appropriate image acquisition pulse sequences, the image contrast can be modified. In this paper, we propose the possibility of applying the CS algorithm with non-sparsifying transform to the pulse sequence modified MR images and improve the reconstruction performance of the CS algorithm by using an appropriate sparsifying transform. We verified the proposed contents by computer simulation using Shepp-Logan phantom and in vivo data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.285-297
• /
• 2015

In this paper, Ulta-WideBand (UWB) channel measurement and modeling based on compressive sampling (CS) are proposed. The sparsity of the channel impulse response (CIR) of the UWB signal in frequency domain enables the proposed channel measurement to have a low-complexity and to provide a comparable performance compared with the existing approaches especially used for the indoor geo-localization purpose. Furthermore, to improve the performance under noisy situation, the soft thresholding method is also investigated in solving the optimization problem for signal recovery of CS. Via numerical results, the proposed channel measurement and modeling are evaluated with the real measured data in terms of location estimation error, bandwidth, and compression ratio for indoor geo-localization using UWB system.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.287-296
• /
• 2003

There has been much research focused on collaborative filtering technique in Recommender System. However, these studies have shown the First-Rater Problem and the Sparsity Problem. The main purpose of this Paper is to solve these Problems. In this Paper, we suggest the user's predicting preference method using Bayesian estimated value and the associative user clustering for the recalculation of preference. In addition to this method, to complement a shortcoming, which doesn't regard the attribution of item, we use Representative Attribute-Neighborhood method that is used for the prediction when we find the similar neighborhood through extracting the representative attribution, which most affect the preference. We improved the efficiency by using the associative user's clustering analysis in order to calculate the preference of specific item within the cluster item vector to the collaborative filtering algorithm. Besides, for the problem of the Sparsity and First-Rater, through using Association Rule Hypergraph Partitioning algorithm associative users are clustered according to the genre. New users are classified into one of these genres by Naive Bayes classifier. In addition, in order to get the similarity value between users belonged to the classified genre and new users, and this paper allows the different estimated value to item which user evaluated through Naive Bayes learning. As applying the preference granted the estimated value to Pearson correlation coefficient, it can make the higher accuracy because the errors that cause the missing value come less. We evaluate our method on a large collaborative filtering database of user rating and it significantly outperforms previous proposed method.

• Journal of Intelligence and Information Systems
• /
• v.20 no.4
• /
• pp.107-120
• /
• 2014

This study proposes a novel recommender system using the structural hole analysis to reflect qualitative and emotional information in recommendation process. Although collaborative filtering (CF) is known as the most popular recommendation algorithm, it has some limitations including scalability and sparsity problems. The scalability problem arises when the volume of users and items become quite large. It means that CF cannot scale up due to large computation time for finding neighbors from the user-item matrix as the number of users and items increases in real-world e-commerce sites. Sparsity is a common problem of most recommender systems due to the fact that users generally evaluate only a small portion of the whole items. In addition, the cold-start problem is the special case of the sparsity problem when users or items newly added to the system with no ratings at all. When the user's preference evaluation data is sparse, two users or items are unlikely to have common ratings, and finally, CF will predict ratings using a very limited number of similar users. Moreover, it may produces biased recommendations because similarity weights may be estimated using only a small portion of rating data. In this study, we suggest a novel limitation of the conventional CF. The limitation is that CF does not consider qualitative and emotional information about users in the recommendation process because it only utilizes user's preference scores of the user-item matrix. To address this novel limitation, this study proposes cluster-indexing CF model with the structural hole analysis for recommendations. In general, the structural hole means a location which connects two separate actors without any redundant connections in the network. The actor who occupies the structural hole can easily access to non-redundant, various and fresh information. Therefore, the actor who occupies the structural hole may be a important person in the focal network and he or she may be the representative person in the focal subgroup in the network. Thus, his or her characteristics may represent the general characteristics of the users in the focal subgroup. In this sense, we can distinguish friends and strangers of the focal user utilizing the structural hole analysis. This study uses the structural hole analysis to select structural holes in subgroups as an initial seeds for a cluster analysis. First, we gather data about users' preference ratings for items and their social network information. For gathering research data, we develop a data collection system. Then, we perform structural hole analysis and find structural holes of social network. Next, we use these structural holes as cluster centroids for the clustering algorithm. Finally, this study makes recommendations using CF within user's cluster, and compare the recommendation performances of comparative models. For implementing experiments of the proposed model, we composite the experimental results from two experiments. The first experiment is the structural hole analysis. For the first one, this study employs a software package for the analysis of social network data - UCINET version 6. The second one is for performing modified clustering, and CF using the result of the cluster analysis. We develop an experimental system using VBA (Visual Basic for Application) of Microsoft Excel 2007 for the second one. This study designs to analyzing clustering based on a novel similarity measure - Pearson correlation between user preference rating vectors for the modified clustering experiment. In addition, this study uses 'all-but-one' approach for the CF experiment. In order to validate the effectiveness of our proposed model, we apply three comparative types of CF models to the same dataset. The experimental results show that the proposed model outperforms the other comparative models. In especial, the proposed model significantly performs better than two comparative modes with the cluster analysis from the statistical significance test. However, the difference between the proposed model and the naive model does not have statistical significance.

• International journal of advanced smart convergence
• /
• v.9 no.3
• /
• pp.42-48
• /
• 2020

These days people are overwhelmed by information on the Internet thus searching for useful information becomes burdensome, often failing to acquire some in a reasonable time. Recommender systems are indispensable to fulfill such user needs through many practical commercial sites. This study proposes a novel similarity measure for user-based collaborative filtering which is a most popular technique for recommender systems. Compared to existing similarity measures, the main advantages of the suggested measure are that it takes all the ratings given by users into account for computing similarity, thus relieving the inherent data sparsity problem and that it reflects the uncertainty or vagueness of user ratings through fuzzy logic. Performance of the proposed measure is examined by conducting extensive experiments. It is found that it demonstrates superiority over previous relevant measures in terms of major quality metrics.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.613-614
• /
• 2008

A content recommendation according to users preferences comes up in the Internet application due to contents overwhelming. This paper newly proposes a method to predict contents preference using tags in conjunction with Content-Based Filtering. By implementing this method, this paper cleans up the contents sparsity problem in Content-Based Filtering, and shows the outstanding improvements.

• Journal of International Society for Simulation Surgery
• /
• v.3 no.2
• /
• pp.46-48
• /
• 2016

Purpose In face reocognition area, estimating occlusion in face images is on the rise. In this paper, we propose a new face recognition algorithm based on dual sparse representation to solve this problem. Method Each face image is partitioned into several pieces and sparse representation is implemented in each part. Then, some parts that have large sparse concentration index are combined and sparse representation is performed one more time. Each test sample is classified by using the final sparse coefficient where correlation between the test sample and training sample is applied. Results The recognition rate of the proposed algorithm is higher than that of the basic sparse representation classification. Conclusion The proposed method can be applied in real life which needs to identify someone exactly whether the person disguises his face or not.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.6
• /
• pp.1271-1278
• /
• 2017

Although the $L_0$-penalty is the most natural choice to identify the sparsity structure of the model, it has not been widely used due to the computational bottleneck. Recently, the adaptive ridge procedure is developed to efficiently approximate a $L_q$-penalized problem to an iterative $L_2$-penalized one. In this article, we proposed to apply the adaptive ridge procedure to solve the $L_0$-penalized weighted support vector machine (WSVM) to facilitate the corresponding optimization. Our numerical investigation shows the advantageous performance of the $L_0$-penalized WSVM compared to the conventional WSVM with $L_2$ penalty for both simulated and real data sets.

• Communications for Statistical Applications and Methods
• /
• v.16 no.1
• /
• pp.209-215
• /
• 2009

In regression problem, the SCAD estimator proposed by Fan and Li (2001), has many desirable property such as continuity, sparsity and unbiasedness. In this paper, we extend SCAD penalized regression framework to quantile regression and hence, we propose new SCAD penalized quantile estimator on high-dimensions and also present an efficient algorithm. From the simulation and real data set, the proposed estimator performs better than quantile regression estimator with $L_1$ norm.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.11
• /
• pp.121-126
• /
• 2016

In recommender systems based on collaborative filtering, measuring similarity is very critical for determining the range of recommenders. Data sparsity problem is fundamental in collaborative filtering systems, which is partly solved by Jaccard coefficient combined with traditional similarity measures. This study proposes a new coefficient for improving performance of Jaccard coefficient by compensating for its drawbacks. We conducted experiments using datasets of various characteristics for performance analysis. As a result of comparison between the proposed and the similarity metric of Pearson correlation widely used up to date, it is found that the two metrics yielded competitive performance on a dense dataset while the proposed showed much better performance on a sparser dataset. Also, the result of comparing the proposed with Jaccard coefficient showed that the proposed yielded far better performance as the dataset is denser. Overall, the proposed coefficient demonstrated the best prediction and recommendation performance among the experimented metrics.