• 제목/요약/키워드: Prediction Algorithms

검색결과 996건 처리시간 0.036초

토양수분 예측을 위한 수치지형 인자와 격자 크기에 대한 연구 (The Resolution of the Digital Terrain Index for the Prediction of Soil Moisture)

  • 한지영;김상현;김남원
    • 한국수자원학회논문집
    • /
    • 제36권2호
    • /
    • pp.251-261
    • /
    • 2003
  • 여러 가지 토양수분의 예측인자에 대한 해상도 문제를 고찰하였다. 다양한 인자에 대한 민감도는 통계적인 분석을 기반으로 논의되었다. 수치지형모형에서 세 가지 흐름 결정 알고리즘의 해상도에 대한 통계적인 분석이 수행되었다. 단방향 흐름알고리즘으로 계산한 상부사면 기여면적은 다른 두 알고리즘(다방향 알고리즘, DEMON)보다 더욱 민감한 것으로 나타났다. 습윤지수의 경우는 해상도나 계산과정의 변화에 상대적으로 민감도가 미소한 것으로 나타났다.

The cluster-indexing collaborative filtering recommendation

  • Park, Tae-Hyup;Ingoo Han
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2003년도 춘계학술대회
    • /
    • pp.400-409
    • /
    • 2003
  • Collaborative filtering (CF) recommendation is a knowledge sharing technology for distribution of opinions and facilitating contacts in network society between people with similar interests. The main concerns of the CF algorithm are about prediction accuracy, speed of response time, problem of data sparsity, and scalability. In general, the efforts of improving prediction algorithms and lessening response time are decoupled. We propose a three-step CF recommendation model which is composed of profiling, inferring, and predicting steps while considering prediction accuracy and computing speed simultaneously. This model combines a CF algorithm with two machine learning processes, SOM (Self-Organizing Map) and CBR (Case Based Reasoning) by changing an unsupervised clustering problem into a supervised user preference reasoning problem, which is a novel approach for the CF recommendation field. This paper demonstrates the utility of the CF recommendation based on SOM cluster-indexing CBR with validation against control algorithms through an open dataset of user preference.

  • PDF

Predicting movie audience with stacked generalization by combining machine learning algorithms

  • Park, Junghoon;Lim, Changwon
    • Communications for Statistical Applications and Methods
    • /
    • 제28권3호
    • /
    • pp.217-232
    • /
    • 2021
  • The Korea film industry has matured and the number of movie-watching per capita has reached the highest level in the world. Since then, movie industry growth rate is decreasing and even the total sales of movies per year slightly decreased in 2018. The number of moviegoers is the first factor of sales in movie industry and also an important factor influencing additional sales. Thus it is important to predict the number of movie audiences. In this study, we predict the cumulative number of audiences of films using stacking, an ensemble method. Stacking is a kind of ensemble method that combines all the algorithms used in the prediction. We use box office data from Korea Film Council and web comment data from Daum Movie (www.movie.daum.net). This paper describes the process of collecting and preprocessing of explanatory variables and explains regression models used in stacking. Final stacking model outperforms in the prediction of test set in terms of RMSE.

Incorporating BERT-based NLP and Transformer for An Ensemble Model and its Application to Personal Credit Prediction

  • Sophot Ky;Ju-Hong Lee;Kwangtek Na
    • 스마트미디어저널
    • /
    • 제13권4호
    • /
    • pp.9-15
    • /
    • 2024
  • Tree-based algorithms have been the dominant methods used build a prediction model for tabular data. This also includes personal credit data. However, they are limited to compatibility with categorical and numerical data only, and also do not capture information of the relationship between other features. In this work, we proposed an ensemble model using the Transformer architecture that includes text features and harness the self-attention mechanism to tackle the feature relationships limitation. We describe a text formatter module, that converts the original tabular data into sentence data that is fed into FinBERT along with other text features. Furthermore, we employed FT-Transformer that train with the original tabular data. We evaluate this multi-modal approach with two popular tree-based algorithms known as, Random Forest and Extreme Gradient Boosting, XGBoost and TabTransformer. Our proposed method shows superior Default Recall, F1 score and AUC results across two public data sets. Our results are significant for financial institutions to reduce the risk of financial loss regarding defaulters.

Lattice 알고리즘을 이용한 신호 추정에 관한 연구 (A study on the signal estimation using lattice algorithms)

  • 정동학;양해원
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
    • /
    • pp.451-455
    • /
    • 1987
  • In this Paper, recursive least-squares lattice algorithms for prewindowed given data case are considered, and some experimental results to linear prediction, the sequence of monthly electrical power sales is taken as time series, am presented.

  • PDF

화방 정찰 체계에서의 다수의 이동 로봇을 위한 시간 효율적인 경로 계획 알고리즘에 대한 연구 (Time-Efficient Trajectory Planning Algorithms for Multiple Mobile Robots in Nuclear/Chemical Reconnaissance System)

  • 김재성;김병국
    • 제어로봇시스템학회논문지
    • /
    • 제15권10호
    • /
    • pp.1047-1055
    • /
    • 2009
  • Since nuclear and chemical materials could damage people and disturb battlefield missions in a wide region, nuclear/chemical reconnaissance systems utilizing multiple mobile robots are highly desirable for rapid and safe reconnaissance. In this paper, we design a nuclear/chemical reconnaissance system including mobile robots. Also we propose time-efficient trajectory planning algorithms using grid coverage and contour finding methods for reconnaissance operation. For grid coverage, we performed in analysis on time consumption for various trajectory patterns generated by straight lines and arcs. We proposed BCF (Bounded Contour Finding) and BCFEP (Bounded Contour Finding with Ellipse Prediction) algorithms for contour finding. With these grid coverage and contour finding algorithms, we suggest trajectory planning algorithms for single, two or four mobile robots. Various simulations reveal that the proposed algorithms improve time-efficiency in nuclear/chemical reconnaissance missions in the given area. Also we conduct basic experiments using a commercial mobile robot and verify the time efficiency of the proposed contour finding algorithms.

A Study on Stock Trend Determination in Stock Trend Prediction

  • Lim, Chungsoo
    • 한국컴퓨터정보학회논문지
    • /
    • 제25권12호
    • /
    • pp.35-44
    • /
    • 2020
  • 본 연구에서는 주가 결정 방법이 주가 경향 예측에 미치는 영향을 확인하기 위한 분석을 수행한다. 주식시장에서 성공적인 투자를 위해서는 주가의 상승과 하락을 정확하게 예측하는 것이 큰 도움이 되므로 주가 경향 예측에 관해 많은 연구가 진행되고 있다. 예를 들어 근래에는 SNS나 뉴스의 내용을 텍스트 마이닝을 이용하여 분석하고, 이를 이용한 주가 등락의 예측 방법이 제안되었으며 다양한 기계학습 기법들이 활용되고 있다. 그러나 주가의 경향을 '상승' 또는 '하락'으로 결정하는 방법은 제대로 분석된 적 없으며 일반적으로 쓰던 방법을 답습하고 있다. 이에 본 논문에서는 주가 경향 결정 방법을 이동평균을 이용해 일반화하고 주가 경향 결정 방법이 예측 정확도에 미치는 영향을 분석한다. 분석 결과, 다음 날의 주가 경향을 예측하는 경우, 주가 경향 결정방법에 따라 예측 정확도가 47%까지 차이가 남을 발견하였다. 또한 경향 결정에 사용되는 기준값 윈도우의 크기와 예측의 정확도는 비례 관계이며, 대상값 윈도우의 크기와 정확도는 반비례 관례임을 알 수 있었다.

Prediction of Larix kaempferi Stand Growth in Gangwon, Korea, Using Machine Learning Algorithms

  • Hyo-Bin Ji;Jin-Woo Park;Jung-Kee Choi
    • Journal of Forest and Environmental Science
    • /
    • 제39권4호
    • /
    • pp.195-202
    • /
    • 2023
  • In this study, we sought to compare and evaluate the accuracy and predictive performance of machine learning algorithms for estimating the growth of individual Larix kaempferi trees in Gangwon Province, Korea. We employed linear regression, random forest, XGBoost, and LightGBM algorithms to predict tree growth using monitoring data organized based on different thinning intensities. Furthermore, we compared and evaluated the goodness-of-fit of these models using metrics such as the coefficient of determination (R2), mean absolute error (MAE), and root mean square error (RMSE). The results revealed that XGBoost provided the highest goodness-of-fit, with an R2 value of 0.62 across all thinning intensities, while also yielding the lowest values for MAE and RMSE, thereby indicating the best model fit. When predicting the growth volume of individual trees after 3 years using the XGBoost model, the agreement was exceptionally high, reaching approximately 97% for all stand sites in accordance with the different thinning intensities. Notably, in non-thinned plots, the predicted volumes were approximately 2.1 m3 lower than the actual volumes; however, the agreement remained highly accurate at approximately 99.5%. These findings will contribute to the development of growth prediction models for individual trees using machine learning algorithms.

Adaptive Frame Rate Up-Conversion Algorithms using Block Complexity Information

  • Lee, Kangjun
    • 한국멀티미디어학회논문지
    • /
    • 제21권8호
    • /
    • pp.813-820
    • /
    • 2018
  • This paper proposes new frame rate up-conversion algorithms. Adaptive motion estimation based on block complexity information are used to obtain more accurate motion vectors. Because the information on block complexity is extracted from the motion estimation prediction size from the original frame, additional computational complexity is not imparted. In experimental results, the proposed algorithms provide robust frame interpolation performance for whole test sequences. Also, the computational complexity of the proposed algorithm is reduced to a benchmark algorithm.

A STUDY ON FUEL ESTIMATION ALGORITHMS FOR A GEOSTATIONARY COMMUNICATION & BROADCASTING SATELLITE

  • Eun, Jeong-Won
    • Journal of Astronomy and Space Sciences
    • /
    • 제17권2호
    • /
    • pp.249-256
    • /
    • 2000
  • It has been developed to calculate fuel budget for a geostationary communication and broadcasting satellite. It is quite essential that the pre-launch fuel budget estimation must account for the deterministic transfer and drift orbit maneuver requirements. After on-station, the calculation of satellite lifetime should be based on the estimation of remaining fuel and assessment of actual performance. These estimations step from the proper algorithms to produce the prediction of satellite lifetime. This paper concentrates on the fuel estimation method that was studied for calculation of the propellant budget by using the given algorithms. Applications of this method are discussed for a communication and broadcasting satellite.

  • PDF