scispace - formally typeset
B

Bong-Jin Yum

Researcher at KAIST

Publications -  63
Citations -  1525

Bong-Jin Yum is an academic researcher from KAIST. The author has contributed to research in topics: Taguchi methods & Observational error. The author has an hindex of 20, co-authored 62 publications receiving 1373 citations.

Papers
More filters
Journal ArticleDOI

Optimal design of accelerated degradation tests based on Wiener process models

TL;DR: In this article, optimal accelerated degradation test (ADT) plans are developed assuming that the constant-stress loading method is employed and the degradation characteristic follows a Wiener process, and the test stress levels and the proportion of test units allocated to each stress level such that the asymptotic variance of the maximum-likelihood estimator of the qth quantile of the lifetime distribution at the use condition is minimized.
Journal ArticleDOI

A bibliography of the literature on process capability indices: 2000–2009

TL;DR: This paper contains a bibliography of approximately 530 journal papers and books on process capability indices for the period 2000–2009, and special applications include acceptance sampling plans, supplier selection, and tolerance design and other optimizations.
Journal ArticleDOI

Development of a recommender system based on navigational and behavioral patterns of customers in e-commerce sites

TL;DR: The proposed CF (collaborative filtering)-based recommender system is versatile and can be applied to a variety of e-commerce sites as long as the navigational and behavioral patterns of customers can be captured.
Journal ArticleDOI

Collaborative filtering based on iterative principal component analysis

TL;DR: Developed in this article is an iterative PCA approach in which no gauge set is required, and singular value decomposition is employed for estimating missing ratings and dimensionality reduction, and principal component values for users in reduced dimension are used for clustering users.
Journal ArticleDOI

A heuristic method for solving redundancy optimization problems in complex systems

TL;DR: The authors present a heuristic method for solving constrained redundancy optimization problems in complex systems that allows excursions over a bounded infeasible region, which can alleviate the risks of being trapped at a local optimum.