• Journal of the Korean Society of Safety
• /
• v.11 no.2
• /
• pp.122-127
• /
• 1996

The purpose of this study has been studied and investigated to prediction algorithms of the Kalman Filtering theory which are based on the state-vector description, including system identification, model structure determination, parameter estimation. And the prediction algorithms applied of rainfall-runoff process, has been worked out. The analysis of runoff process and runoff prediction algorithms of the river-basin established, for the verification of prediction algorithms by the Kalman Filtering theory, the observed historical data of the hourly rainfall and streamflows were used for the algorithms. In consisted of the above, Kalman Filtering rainfall-runoff model applied and analysised to Wi-Stream basin in Nak-dong River(Basin area : $472.53km^2$).

• Journal of information and communication convergence engineering
• /
• v.19 no.4
• /
• pp.241-247
• /
• 2021

Particulate matter has emerged as a serious global problem, necessitating highly reliable information on the matter. Therefore, various algorithms have been used in studies to predict particulate matter. In this study, we compared the prediction performance of neural network models that have been actively studied for particulate matter prediction. Among the neural network algorithms, a deep neural network (DNN), a recurrent neural network, and long short-term memory were used to design the optimal prediction model using a hyper-parameter search. In the comparative analysis of the prediction performance of each model, the DNN model showed a lower root mean square error (RMSE) than the other algorithms in the performance comparison using the RMSE and the level of accuracy as metrics for evaluation. The stability of the recurrent neural network was slightly lower than that of the other algorithms, although the accuracy was higher.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.655-660
• /
• 2009

The context prediction algorithms are not suitable to provide real-time personalized service for users in context-awareness environment. The algorithms have problems like time delay in training data processing and the difficulties of implementation in real-time environment. In this paper, we propose a prediction algorithm with user modeling to shorten of processing time and to improve the prediction accuracy in the context prediction algorithm. The algorithm uses moving path of user contexts for context prediction and generates user model by time-series analysis of user's moving path. And that predicts the user context with the user model by sequence matching method. We compared our algorithms with the prediction algorithms by processing time and prediction accuracy. As the result, the prediction accuracy of our algorithm is similar to the prediction algorithms, and processing time is reduced by 40% in real time service environment.

• Soft Computing and Machine Intelligence
• /
• v.1 no.1
• /
• pp.11-23
• /
• 2021

House price prediction is a significant financial decision for individuals working in the housing market as well as for potential buyers. From investment to buying a house for residence, a person investing in the housing market is interested in the potential gain. This paper presents machine learning algorithms to develop intelligent regressions models for House price prediction. The proposed research methodology consists of four stages, namely Data Collection, Pre Processing the data collected and transforming it to the best format, developing intelligent models using machine learning algorithms, training, testing, and validating the model on house prices of the housing market in the Capital, Islamabad. The data used for model validation and testing is the asking price from online property stores, which provide a reasonable estimate of the city housing market. The prediction model can significantly assist in the prediction of future housing prices in Pakistan. The regression results are encouraging and give promising directions for future prediction work on the collected dataset.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.213-226
• /
• 2021

Given that most of the link prediction algorithms for signed social networks can only complete sign prediction, a novel algorithm is proposed aiming to achieve both link prediction and sign prediction in signed networks. Based on the structural balance theory, the local link tightness and global link tightness are defined respectively by using the structural information of paths with the step size of 2 and 3 between the two nodes. Then the total similarity of the node pair can be obtained by combining them. Its absolute value measures the possibility of the two nodes to establish a link, and its sign is the sign prediction result of the predicted link. The effectiveness and correctness of the proposed algorithm are verified on six typical datasets. Comparison and analysis are also carried out with the classical prediction algorithms in signed networks such as CN-Predict, ICN-Predict, and PSNBS (prediction in signed networks based on balance and similarity) using the evaluation indexes like area under the curve (AUC), Precision, improved AUC', improved Accuracy', and so on. Results show that the proposed algorithm achieves good performance in both link prediction and sign prediction, and its accuracy is higher than other algorithms. Moreover, it can achieve a good balance between prediction accuracy and computational complexity.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1196-1213
• /
• 2020

There is a growing interest in the development of smart environments through predicting the behaviors of inhabitants of smart spaces in the recent past. Various smart services are deployed in modern smart cities to facilitate residents and city administration. Prediction algorithms are broadly used in the smart fields in order to well equip the smart services for the future demands. Hence, an accurate prediction technology plays a vital role in the smart services. In this paper, we take out an extensive survey of smart spaces such as smart homes, smart farms and smart cars and smart applications such as smart health and smart energy. Our extensive survey is based on more than 400 articles and the final list of research studies included in this survey consist of 134 research papers selected using Google Scholar database for period of 2008 to 2018. In this survey, we highlight the role of prediction algorithms in each sub-domain of smart Internet of Things (IoT) environments. We also discuss the main algorithms which play pivotal role in a particular IoT subfield and effectiveness of these algorithms. The conducted survey provides an efficient way to analyze and have a quick understanding of state of the art work in the targeted domain. To the best of our knowledge, this is the very first survey paper on main categories of prediction algorithms covering statistical, heuristic and hybrid approaches for smart environments.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.647-652
• /
• 2000

This paper proposes a collision warning/avoidance algorithm using a trajectory prediction method. This algorithm is based on 2-dimensional kinematics and the Kalman filter has been used to obtain the information of the object vehicle. This algorithm has been investigated via computer simulation and showed a good trajectory prediction performance. The proposed collision warning/avoidance algorithm would enhanced driver acceptance for a collision warning/avoidance system.

• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1029-1035
• /
• 2019

In recent years, artificial intelligence (AI) services have become one of the most essential parts to extend human capabilities in various fields such as face recognition for security, weather prediction, and so on. Various learning algorithms for existing AI services are utilized, such as classification, regression, and deep learning, to increase accuracy and efficiency for humans. Nonetheless, these services face many challenges such as fake news spread on social media, stock selection, and volatility delay in stock prediction systems and inaccurate movie-based recommendation systems. In this paper, various algorithms are presented to mitigate these issues in different systems and services. Convolutional neural network algorithms are used for detecting fake news in Korean language with a Word-Embedded model. It is based on k-clique and data mining and increased accuracy in personalized recommendation-based services stock selection and volatility delay in stock prediction. Other algorithms like multi-level fusion processing address problems of lack of real-time database.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.370-376
• /
• 2010

Ensemble learning is a method for improving the performance of classification and prediction algorithms. However, its performance can be degraded due to multicollinearity problem where multiple classifiers of an ensemble are highly correlated with. This paper proposes genetic algorithm-based optimization techniques of SVM ensemble to solve multicollinearity problem. Empirical results with bankruptcy prediction on Korea firms indicate that the proposed optimization techniques can improve the performance of SVM ensemble.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.550-557
• /
• 2007

We predict a context of various structures by using Bayesian Networks Algorithms, Three-Dimensional Structures Algorithms and Genetic Algorithms. However, these algorithms have unavoidable problems when providing a context-aware service in reality due to a lack of practicality and the delay of process time in real-time environment. As far as context-aware system for specific purpose is concerned, it is very hard to be sure about the accuracy and reliability of prediction. This paper focuses on reasoning and prediction technology which provides a stochastic mechanism for context information by incorporating various context information data. The objective of this paper is to provide optimum services to users by suggesting an intellectual reasoning and prediction based on hierarchical context information. Thus, we propose a design of user location prediction algorithm using sequential matching with n-size flexible window scheme by taking user's habit or behavior into consideration. This algorithm improves average 5.10% than traditional algorithms in the accuracy and reliability of prediction using the Flexible Window Scheme.