• 제목/요약/키워드: Sequential data

검색결과 1,091건 처리시간 0.022초

Modified Fixed-Threshold SMO for 1-Slack Structural SVMs

  • Lee, Chang-Ki;Jang, Myung-Gil
    • ETRI Journal
    • /
    • 제32권1호
    • /
    • pp.120-128
    • /
    • 2010
  • In this paper, we describe a modified fixed-threshold sequential minimal optimization (FSMO) for 1-slack structural support vector machine (SVM) problems. Because the modified FSMO uses the fact that the formulation of 1-slack structural SVMs has no bias, it breaks down the quadratic programming (QP) problems of 1-slack structural SVMs into a series of smallest QP problems, each involving only one variable. For various test sets, the modified FSMO is as accurate as existing structural SVM implementations (n-slack and 1-slack SVM-struct) but is faster on large data sets.

Design and Implementation of AI Recommendation Platform for Commercial Services

  • Jong-Eon Lee
    • International journal of advanced smart convergence
    • /
    • 제12권4호
    • /
    • pp.202-207
    • /
    • 2023
  • In this paper, we discuss the design and implementation of a recommendation platform actually built in the field. We survey deep learning-based recommendation models that are effective in reflecting individual user characteristics. The recently proposed RNN-based sequential recommendation models reflect individual user characteristics well. The recommendation platform we proposed has an architecture that can collect, store, and process big data from a company's commercial services. Our recommendation platform provides service providers with intuitive tools to evaluate and apply timely optimized recommendation models. In the model evaluation we performed, RNN-based sequential recommendation models showed high scores.

A Comparison of Optimization Algorithms: An Assessment of Hydrodynamic Coefficients

  • Kim, Daewon
    • 해양환경안전학회지
    • /
    • 제24권3호
    • /
    • pp.295-301
    • /
    • 2018
  • This study compares optimization algorithms for efficient estimations of ship's hydrodynamic coefficients. Two constrained algorithms, the interior point and the sequential quadratic programming, are compared for the estimation. Mathematical optimization is designed to get optimal hydrodynamic coefficients for modelling a ship, and benchmark data are collected from sea trials of a training ship. A calibration for environmental influence and a sensitivity analysis for efficiency are carried out prior to implementing the optimization. The optimization is composed of three steps considering correlation between coefficients and manoeuvre characteristics. Manoeuvre characteristics of simulation results for both sets of optimized coefficients are close to each other, and they are also fit to the benchmark data. However, this similarity interferes with the comparison, and it is supposed that optimization conditions, such as designed variables and constraints, are not sufficient to compare them strictly. An enhanced optimization with additional sea trial measurement data should be carried out in future studies.

데이터마이닝을 이용한 설계변경의 효율향상 - B전자의 사례를 중심으로 - (Raise the efficiency of engineering changes using Data mining - B Electronics Case -)

  • 박승헌;이석환
    • 대한안전경영과학회지
    • /
    • 제9권3호
    • /
    • pp.135-142
    • /
    • 2007
  • The authors used association rules and patterns in sequential of data mining in order to raise the efficiency of engineering changes. The association rule can reduce the number of engineering changes since it can estimate the parts to be changed. The patterns in sequential can perform engineering changes effectively by estimating the parts to be changed from sequence estimation. According to this result, unnecessary engineering changes are eliminated and the number of engineering changes decrease. This method can be used for improving design quality and productivity in company managing engineering changes and related information.

신경망을 이용한 원격탐사자료의 군집화 기법 연구 (Study on Application of Neural Network for Unsupervised Training of Remote Sensing Data)

  • 김광은;이태섭;채효석
    • Spatial Information Research
    • /
    • 제2권2호
    • /
    • pp.175-188
    • /
    • 1994
  • 본 연구에서는 최근 많은 분야데서 패턴인식을 위한 효과적인 기법으로 이용되고 있는 신경망 기법을 원격탐사자료의 군집화 기법으로서 적용하고자 하였다. 이를 위해 선택된 신경망 모델은 경쟁학습 신경망이며 이를 구성하는 각종 변수들을 재구성하여 원격탐사자료의 군집화를 위한 신경망모델을 설정하였다. 본 신경망을 이용한 군집화 기법은 항공기를 이용하여 획득된 원격탐사자료를 이용하여 순차적(sequential)군집화 기법 K 평균 군집화 기법과 비교되었다. 계산시간은 순차적 기법이나 K 평균기법에 비하여 더 많이 소요되나 정확도면에 있어서는 비교적 우수한 결과를 나타냈다.

  • PDF

Drought Monitoring with Indexed Sequential Modeling

  • Kim, Hung-Soo;Yoon, Yong-Nam
    • Korean Journal of Hydrosciences
    • /
    • 제8권
    • /
    • pp.125-136
    • /
    • 1997
  • The simulation techniques of hydrologic data series have develped for the purposes of the design of water resources system, the optimization of reservoir operation, and the design of flood control of reservoir, etc. While the stochastic models are usually used in most analysis of water resources fields for the generation of data sequences, the indexed sequential modeling (ISM) method based on generation of a series of overlapping short-term flow sequences directly from the historical record has been used for the data generation in the western USA since the early of 1980s. It was reported that the reliable results by ISM were obtained in practical applications. In this study, we generate annual inflow series at a location of Hong Cheon Dam site by using ISM method and autoregressive, order-1 model (AR(1)), and estimate the drought characteristics for the comparison aim between ISM and AR(1).

  • PDF

인터넷 쇼핑몰에서의 축차분석법 활용 방안 (Application of sequential analysis in internet shopping malls)

  • 박희창
    • Journal of the Korean Data and Information Science Society
    • /
    • 제20권6호
    • /
    • pp.1009-1014
    • /
    • 2009
  • 인터넷은 우리나라뿐만 아니라 세계 도처에서 인간의 일상생활과 전통적인 상거래의 패러다임을 변화시켰으며, 새로운 비즈니스 모델을 구축할 수 있는 무한한 기회를 제공하였다. 이로 인하여 최근에는 상거래 수단으로서 인터넷 쇼핑몰이 등장하였다. 인터넷 쇼핑몰이 경쟁력을 갖기 위해서는 효과적인 고객만족서비스가 제공되어야 한다. 이를 위해 고객들에게 적절한 마케팅 프로모션을 실시하기 위해서는 시간의 변화에 따른 고객들의 구매행위 패턴을 예측할 수 있는 동적인 분석 방법이 필요하다. 본 논문에서는 통계적 추정 방법 중의 하나인 축차분석법을 이용하여 유사한 품목들 간의 매출액을 비교함으로써 고객들의 구매행위 패턴을 예측을 통해 매출 향상을 도모하는 방안에 대해 연구하고자 한다.

  • PDF

The Precision Validation of the Precise Baseline Determination for Satellite Formation

  • Choi, Jong-Yeoun;Lee, Sang-Jeong
    • Journal of Astronomy and Space Sciences
    • /
    • 제28권1호
    • /
    • pp.63-70
    • /
    • 2011
  • The needs for satellite formation flying are gradually increasing to perform the advanced space missions in remote sensing and observation of the space or Earth. Formation flying in low Earth orbit can perform the scientific missions that cannot be realized with a single spacecraft. One of the various techniques of satellite formation flying is the determination of the precise baselines between the satellites within the formation, which has to be in company with the precision validation. In this paper, the baseline of Gravity Recovery and Climate Experiment (GRACE) A and B was determined with the real global positioning system (GPS) measurements of GRACE satellites. And baseline precision was validated with the batch and sequential processing methods using K/Ka-band ranging system (KBR) biased range measurements. Because the proposed sequential method validate the baseline precision, removing the KBR bias with the epoch difference instead of its estimation, the validating data (KBR biased range) are independent of the data validated (GPS-baseline) and this method can be applied to the real-time precision validation. The result of sequential precision validation was 1.5~3.0 mm which is similar to the batch precision validation.

The inference and estimation for latent discrete outcomes with a small sample

  • Choi, Hyung;Chung, Hwan
    • Communications for Statistical Applications and Methods
    • /
    • 제23권2호
    • /
    • pp.131-146
    • /
    • 2016
  • In research on behavioral studies, significant attention has been paid to the stage-sequential process for longitudinal data. Latent class profile analysis (LCPA) is an useful method to study sequential patterns of the behavioral development by the two-step identification process: identifying a small number of latent classes at each measurement occasion and two or more homogeneous subgroups in which individuals exhibit a similar sequence of latent class membership over time. Maximum likelihood (ML) estimates for LCPA are easily obtained by expectation-maximization (EM) algorithm, and Bayesian inference can be implemented via Markov chain Monte Carlo (MCMC). However, unusual properties in the likelihood of LCPA can cause difficulties in ML and Bayesian inference as well as estimation in small samples. This article describes and addresses erratic problems that involve conventional ML and Bayesian estimates for LCPA with small samples. We argue that these problems can be alleviated with a small amount of prior input. This study evaluates the performance of likelihood and MCMC-based estimates with the proposed prior in drawing inference over repeated sampling. Our simulation shows that estimates from the proposed methods perform better than those from the conventional ML and Bayesian method.