• Journal of the Korean Data and Information Science Society
• /
• v.19 no.3
• /
• pp.819-830
• /
• 2008

Web recommender system was suggested in order to solve the problem which is cause by overflow of information. Collaborative filtering is the technique which predicts and recommends the suitable goods to the user with collection of preference information based on the history which user was interested in. However, there is a difficulty of recommendation by lack of information of goods which have less popularity. In this paper, it has been researched the way to select the sparsity of goods and the preference in order to solve the problem of recommender system's sparsity which is occurred by lack of information, as well as it has been described the solution which develops the quality of recommender system by selection of customers who were interested in.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.492-504
• /
• 2023

Researchers have recently shown an increased interest in estimating the direction-of-arrival (DOA) of wideband noncircular sources, but existing studies have been restricted to subspace-based methods. An off-grid sparse recovery-based algorithm is proposed in this paper to improve the accuracy of existing algorithms in low signal-to-noise ratio situations. The covariance and pseudo covariance matrices can be jointly represented subject to block sparsity constraints by taking advantage of the joint sparsity between signal components and bias. Furthermore, the estimation problem is transformed into a single measurement vector problem utilizing the focused operation, resulting in a significant reduction in computational complexity. The proposed algorithm's error threshold and the Cramer-Rao bound for wideband noncircular DOA estimation are deduced in detail. The proposed algorithm's effectiveness and feasibility are demonstrated by simulation results.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.173-180
• /
• 2014

Compressive sensing is a new signal acquisition paradigm that enables sparse/compressible signal to be sampled under the Nyquist-rate. To fully benefit from its much simplified acquisition process, huge efforts have been made on improving the performance of compressive sensing recovery. However, concerning color images, compressive sensing recovery lacks in addressing image characteristics like energy distribution or human visual system. In order to overcome the problem, this paper proposes a new group-sparsity hard thresholding process by preserving some RGB-grouped coefficients important in both terms of energy and perceptual sensitivity. Moreover, a smoothed group-sparsity iterative hard thresholding algorithm for compressive sensing of color images is proposed by incorporating a frame-based filter with group-sparsity hard thresholding process. In this way, our proposed method not only pursues sparsity of image in transform domain but also pursues smoothness of image in spatial domain. Experimental results show average PSNR gains up to 2.7dB over the state-of-the-art group-sparsity smoothed recovery method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2400-2413
• /
• 2019

Doubly-selective (DS) fading channel is often occurred in many orthogonal frequency division multiplexing (OFDM) communication systems, such as high-speed rail communication systems and underwater acoustic (UWA) wireless networks. It is challenging to provide an accurate and fast estimation over the doubly-selective channel, due to the strong Doppler shift. This paper addresses the doubly selective channel estimation problem based on complex exponential basis expansion model (CE-BEM) in OFDM systems from the perspective of distributed compressive sensing (DCS). We propose a novel DCS-based improved sparsity adaptive matching pursuit (DCS-IMSAMP) algorithm. The advantage of the proposed algorithm is that it can exploit the joint channel sparsity information using dynamic threshold, variable step size and tailoring mechanism. Simulation results show that the proposed algorithm achieves 5dB performance gain with faster operation speed, in comparison with traditional DCS-based sparsity adaptive matching pursuit (DCS-SAMP) algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2310-2332
• /
• 2020

In recent years, deep learning techniques have achieved tremendous successes in natural language processing, speech recognition and image processing. Collaborative filtering(CF) recommendation is one of widely used methods and has significant effects in implementing the new recommendation function, but it also has limitations in dealing with the problem of poor scalability, cold start and data sparsity, etc. Combining the traditional recommendation algorithm with the deep learning model has brought great opportunity for the construction of a new recommender system. In this paper, we propose a novel collaborative recommendation model based on auxiliary stacked denoising autoencoder(ASDAE), the model learns effective the preferences of users from auxiliary information. Firstly, we integrate auxiliary information with rating information. Then, we design a stacked denoising autoencoder based collaborative recommendation model to learn the preferences of users from auxiliary information and rating information. Finally, we conduct comprehensive experiments on three real datasets to compare our proposed model with state-of-the-art methods. Experimental results demonstrate that our proposed model is superior to other recommendation methods.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.175-178
• /
• 2003

Two defects have been pointed out in existing user-based collaborative filtering such as sparsity and scalability, and the research has been also made progress, which tries to improve these defects using item-based collaborative filtering. Actually there were many results, but the problem of sparsity still remains because of being based on an explicit data. In addition, the issue has been pointed out. which attributes of item arenot reflected in the recommendation. This paper suggests a recommendation method using nave Bayesian algorithm in hybrid user and item-based collaborative filtering to improve above-mentioned defects of existing item-based collaborative filtering. This method generates a similarity table for each user and item, then it improves the accuracy of prediction and recommendation item using naive Bayesianalgorithm. It was compared and evaluated with existing item-based collaborative filtering technique to estimate the accuracy.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.43-52
• /
• 2013

Pervasive computing and social network are good resources in recommendation method. Collaborative filtering is one of the most popular recommendation methods, but it has some limitations such as rating sparsity. Moreover, it does not consider social network in pervasive computing environment. We propose an effective proactive friend recommendation method using social network and contexts in pervasive computing environment. In collaborative filtering method, users need to rate sufficient number of items. However, many users don't rate items sufficiently, because the rating information must be manually input into system. We solve the rating sparsity problem in the collaboration filtering method by using contexts. Our method considers both a static and a dynamic friendship using contexts and social network. It makes more effective recommendation. This paper describes a new friend recommendation method and then presents a music friend scenario. Our work will help e-commerce recommendation system using collaborative filtering and friend recommendation applications in social network services.

• Journal of Broadcast Engineering
• /
• v.26 no.7
• /
• pp.862-867
• /
• 2021

Although Deep Neural Networks (DNNs) have shown remarkable performance in various artificial intelligence fields, it is well known that DNNs are vulnerable to adversarial attacks. Since adversarial attacks are implemented by adding perturbations onto benign examples, increasing the sparsity of DNNs minimizes the propagation of errors to high-level layers. In this paper, unlike the traditional pruning scheme removing low magnitude weights, we eliminate high magnitude weights that are usually considered high absolute values, named 'reverse pruning' to ensure robustness. By conducting both theoretical and experimental analyses, we observe that reverse pruning ensures the robustness of DNNs. Experimental results show that our reverse pruning outperforms previous work with 29.01% in Top-1 accuracy on perturbed CIFAR-10. However, reverse pruning does not guarantee benign samples. To relax this problem, we further conducted experiments by adding a regularization term for the high magnitude weights. With adding the regularization term, we also applied conventional pruning to ensure the robustness of DNNs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1260-1272
• /
• 2024

This paper tackles the prevalent challenges faced by existing tourism route recommendation methods, including data sparsity, cold start, and low accuracy. To address these issues, a novel intelligent tourism route recommendation method based on collaborative filtering is introduced. The proposed method incorporates a series of key steps. Firstly, it calculates the interest level of users by analyzing the item attribute rating values. By leveraging this information, the method can effectively capture the preferences and interests of users. Additionally, a user attribute rating matrix is constructed by extracting implicit user behavior preferences, providing a comprehensive understanding of user preferences. Recognizing that user interests can evolve over time, a weight function is introduced to account for the possibility of interest shifting during product use. This weight function enhances the accuracy of recommendations by adapting to the changing preferences of users, improving the overall quality of the suggested tourism routes. The results demonstrate the significant advantages of the approach. Specifically, the proposed method successfully alleviates the problem of data sparsity, enhances neighbor selection, and generates tourism route recommendations that exhibit higher accuracy compared to existing methods.

• Smart Structures and Systems
• /
• v.21 no.6
• /
• pp.741-749
• /
• 2018

Structural health monitoring (SHM) systems are necessary to achieve smart predictive maintenance and repair planning as well as they lead to a safe operation of mechanical structures. In the context of vibration-based SHM the measured structural responses are employed to draw conclusions about the structural integrity. This usually leads to a mathematically illposed inverse problem which needs regularization. The restriction of the solution set of this inverse problem by using prior information about the damage properties is advisable to obtain meaningful solutions. Compared to the undamaged state typically only a few local stiffness changes occur while the other areas remain unchanged. This change can be described by a sparse damage parameter vector. Such a sparse vector can be identified by employing $L_1$-regularization techniques. This paper presents a novel framework for damage parameter identification by combining sparse solution techniques with an Extended Kalman Filter. In order to ensure sparsity of the damage parameter vector the measurement equation is expanded by an additional nonlinear $L_1$-minimizing observation. This fictive measurement equation accomplishes stability of the Extended Kalman Filter and leads to a sparse estimation. For verification, a proof-of-concept example on a quadratic aluminum plate is presented.