• Title/Summary/Keyword: Box-Jenkin's model

Search Result 14, Processing Time 0.025 seconds

Self-Organizing Fuzzy Modeling Using Creation of Clusters (클러스터 생성을 이용한 자기구성 퍼지 모델링)

  • Koh, Taek-Beom
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.334-340
    • /
    • 2002
  • This paper proposes a self-organizing fuzzy modeling which can create a new hyperplane-shaped cluster by applying multiple regression to input/output data with relatively large fuzzy entropy, add the new cluster to fuzzy rule base and adjust parameters of the fuzzy model in repetition. Tn the coarse tuning, weighted recursive least squared algorithm and fuzzy C-regression model clustering are used and in the fine tuning, gradient descent algorithm is used to adjust parameters of the fuzzy model precisely And learning rates are optimized by utilizing meiosis-genetic algorithm. To check the effectiveness and feasibility of the suggested algorithm, four representative examples for system identification are examined and the performance of the identified fuzzy model is demonstrated in comparison with that of the conventional fuzzy models.

Long term trends in the Korean professional baseball (한국프로야구 기록들의 장기추세)

  • Lee, Jang Taek
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.1
    • /
    • pp.1-10
    • /
    • 2015
  • This paper offers some long term perspective on what has been happening to some baseball statistics for Korean professional baseball. The data used are league summaries by year over the period 1982-2013. For the baseball statistics, statistically significant positive correlations (p < 0.01) were found for doubles (2B), runs batted in (RBI), bases on balls (BB), strike outs (SO), grounded into double play (GIDP), hit by pitch (HBP), on base percentage (OBP), OPS, earned run average (ERA), wild pitches (WP) and walks plus hits divided by innings pitched (WHIP) increased with year. There was a statistically significant decreasing trend in the correlations for triples (3B), caught stealing (CS), errors (E), completed games (CG), shutouts (SHO) and balks (BK) with year (trend p < 0.01). The ARIMA model of Box-Jenkins is applied to find a model to forecast future baseball measures. Univariate time series results suggest that simple lag-1 models fit some baseball measures quite well. In conclusion, the single most important change in Korean professional baseball is the overall incidence of completed games (CG) downward. Also the decrease of strike outs (SO) is very remarkable.

Estiamtion of Time Series Model on Forest Fire Occurrences and Burned Area from 1970 to 2005 (1970-2005년 동안의 산불 발생건수 및 연소면적에 대한 시계열모형 추정)

  • Lee, Byungdoo;Chung, Joosang
    • Journal of Korean Society of Forest Science
    • /
    • v.95 no.6
    • /
    • pp.643-648
    • /
    • 2006
  • It is important to understand the patterns of forest fire in terms of effective prevention and suppression activities. In this study, the monthly forest fire occurrences and their burned areas were investigated to enhance the understanding of the patterns of forest fire in Korea. The statistics of forest fires in Korea, 1970 through 2005, built by Korea Forest Service was analyzed by using time series analysis technique to fit ARIMA models proposed by Box-Jenkins. The monthly differences in forest fire characteristics were clearly distinguished, with 59% of total forest fire occurrences and 72% of total burned area being in March and April. ARIMA(1, 0, 1) was the best fitted model to both the fire accurrences and the burned area time series. The fire time series have a strong relation to the fire occurrences and the burned area of 1 month and 12 months before.

Dynamic Polling Algorithm Based on Line Utilization Prediction (선로 이용률 예측 기반의 동적 폴링 기법)

  • Jo, Gang-Hong;An, Seong-Jin;Jeong, Jin-Uk
    • The KIPS Transactions:PartC
    • /
    • v.9C no.4
    • /
    • pp.489-496
    • /
    • 2002
  • This study proposes a new polling algorithm allowing dynamic change in polling period based on line utilization prediction. Polling is the most important function in network monitoring, but excessive polling data causes rather serious congestion conditions of network when network is In congestion. Therefore, existing multiple polling algorithms decided network congestion or load of agent with previously performed polling Round Trip Time or line utilization, chanced polling period, and controlled polling traffic. But, this algorithm is to change the polling period based on the previous polling and does not reflect network conditions in the current time to be polled. A algorithm proposed in this study is to predict whether polling traffic exceeds threshold of line utilization on polling path based on the past data and to change the polling period with the prediction. In this study, utilization of each line configuring network was predicted with AR model and violation of threshold was presented in probability. In addition, suitability was evaluated by applying the proposed dynamic polling algorithm based on line utilization prediction to the actual network, reasonable level of threshold for line utilization and the violation probability of threshold were decided by experiment. Performance of this algorithm was maximized with these processes.