• 대한전기학회논문지
• /
• 제41권4호
• /
• pp.362-368
• /
• 1992

This paper presents a coupling scheme, which couples an analytical solution and the standard finite element, for analyzing the electromagnetic fields. The former is a solution of the magnetic field in free space, i.e., the outer region of boundary, and the latter represents the system with source currents and magnetic materials in the inner region of boundary. The proposed method retains the sparsity and symmetry of the final system matrix, the merits of the standard FEM. To verify the usefulness of the proposed algorithm, an example which can be solved analytically is chosen and analyzed. The results are compared with those of the standard FEM and the analytic solutions.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• 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
• /
• 제3권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.

• 대한전자공학회논문지
• /
• 제11권2호
• /
• pp.1-4
• /
• 1974

큰 규모의 계통이나 회로망의 해석익 있어서 0이 대부분 포함되어 있는 행렬을 반전하여 해를 구하는 것은 대단히 비능룰적이다. 이러한 계통을 Sparse행렬을 이용하여 풀면 계산시간이 적게 들고 기억용량이 감소되며 둥근(round-off)오차를 줄일 수 있다. 본논문은 Sparse 행렬를 이용하여 회로망을 푸는 방법고ㅘ 전산 프로그래밍을 제공한다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2017년도 추계학술대회
• /
• pp.202-203
• /
• 2017

비음수 행렬 인수분해(Non-negative Matrix Factorization, NMF)의 신호분리 성능을 개선하기 위해 희소조건을 인가한 방법이 희소 비음수 행렬 인수분해 알고리즘(Sparse NMF, SNMF)이다. 기존의 SNMF 알고리즘은 개별 음원의 희소성을 고려하지 않고 임의로 결정한 희소 조건을 사용한다. 본 논문에서는 음원의 특성에 따른 희소성을 추정하고 이를 SNMF 학습알고리즘에 적용하는 새로운 신호분리 기법을 제안한다. 혼합 신호에서의 잡음제거 실험을 통해, 제안한 방법이 기존의 NMF와 SNMF에 비해 성능이 더 우수함을 보였다.

• Journal of the Korean Data and Information Science Society
• /
• 제28권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 추계학술대회 논문집 학회본부
• /
• pp.231-234
• /
• 1997

This paper presents improved direct method for calculating the closest saddle node bifurcation (CSNB) point, which is also applicable to the selection of appropriate load shedding, reactive power compensation point detection. The proposed method reduced dimension of nonlinear equation compared with that of Dobson's direct method. The improved direct method, utilizing Newton Iterative method converges very quickly. But it diverges if the initial guess is not very close to CSNB. So the direct method is performed with the initial values obtained by carrying out the iterative method twice, which is considered most efficient at this time. Since sparsity techniques can be employed, this method is a good choice to a large scale system on-line application. Proposed method has been tested for 5-bus, New England 30-bus system.

• Asia pacific journal of information systems
• /
• 제15권1호
• /
• pp.63-79
• /
• 2005

Recommender systems are a personalized information filtering technology to help customers find the products they would like to purchase. Collaborative filtering is known to be the most successful recommendation technology, but its widespread use has exposed some problems such as sparsity and scalability in the e-business environment. In this paper, we propose a recommendation system, WebCF-PT based on Web usage mining and product taxonomy to enhance the recommendation quality and the system performance of traditional CF-based recommender systems. Web usage mining populates the rating database by tracking customers' shopping behaviors on the Web, so leading to better quality recommendations. The product taxonomy is used to improve the performance of searching for nearest neighbors through dimensionality reduction of the rating database. A prototype recommendation system, WebCF-PT is developed and Internet shopping mall, EBIB(e-Business & Intelligence Business) is constructed to test the WebCF-PT system.

• 경영과학
• /
• 제13권3호
• /
• pp.105-113
• /
• 1996

Constructing an initial basis is an important process in the simplex method. An initial basis greatly affects the number of iterations of iterations and the execution time in the simplex method. The purpose of this paper is to construct a good initial basis. First, to avoid linear dependency among the chosen columns, an enhanced Gaussian elimination method and a method using non-duplicated nonzero elements are developed. Second, for an order to choose variables, the sparsity of the column is used. Experimenal results show that the proposed method can reduce the number of iterations and the execution time compared with Bixby's method by 12%.

• 한국멀티미디어학회논문지
• /
• 제20권2호
• /
• pp.336-343
• /
• 2017

We propose a real time personalized recommendation algorithm on the mobile device. We use a unified collaborative filtering with reduced data. We use Fuzzy C-means clustering to obtain the reduced data and Konohen SOM is applied to get initial values of the cluster centers. The proposed algorithm overcomes data sparsity since it extends data to the similar users and similar items. Also, it enables real time service on the mobile device since it reduces computing time by data clustering. Applying the suggested algorithm to the MovieLens data, we show that the suggested algorithm has reasonable performance in comparison with collaborative filtering. We developed Android-based smart-phone application, which recommends restaurants with coupons and restaurant information.