• Title/Summary/Keyword: Decision Algorithm

Search Result 2,369, Processing Time 0.031 seconds

Long-Term Arrival Time Estimation Model Based on Service Time (버스의 정차시간을 고려한 장기 도착시간 예측 모델)

  • Park, Chul Young;Kim, Hong Geun;Shin, Chang Sun;Cho, Yong Yun;Park, Jang Woo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.7
    • /
    • pp.297-306
    • /
    • 2017
  • Citizens want more accurate forecast information using Bus Information System. However, most bus information systems that use an average based short-term prediction algorithm include many errors because they do not consider the effects of the traffic flow, signal period, and halting time. In this paper, we try to improve the precision of forecast information by analyzing the influencing factors of the error, thereby making the convenience of the citizens. We analyzed the influence factors of the error using BIS data. It is shown in the analyzed data that the effects of the time characteristics and geographical conditions are mixed, and that effects on halting time and passes speed is different. Therefore, the halt time is constructed using Generalized Additive Model with explanatory variable such as hour, GPS coordinate and number of routes, and we used Hidden Markov Model to construct a pattern considering the influence of traffic flow on the unit section. As a result of the pattern construction, accurate real-time forecasting and long-term prediction of route travel time were possible. Finally, it is shown that this model is suitable for travel time prediction through statistical test between observed data and predicted data. As a result of this paper, we can provide more precise forecast information to the citizens, and we think that long-term forecasting can play an important role in decision making such as route scheduling.

A Deep Learning Based Recommender System Using Visual Information (시각 정보를 활용한 딥러닝 기반 추천 시스템)

  • Moon, Hyunsil;Lim, Jinhyuk;Kim, Doyeon;Cho, Yoonho
    • Knowledge Management Research
    • /
    • v.21 no.3
    • /
    • pp.27-44
    • /
    • 2020
  • In order to solve the user's information overload problem, recommender systems infer users' preferences and suggest items that match them. The collaborative filtering (CF), the most successful recommendation algorithm, has been improving performance until recently and applied to various business domains. Visual information, such as book covers, could influence consumers' purchase decision making. However, CF-based recommender systems have rarely considered for visual information. In this study, we propose VizNCS, a CF-based deep learning model that uses visual information as additional information. VizNCS consists of two phases. In the first phase, we build convolutional neural networks (CNN) to extract visual features from image data. In the second phase, we supply the visual features to the NCF model that is known to easy to extend to other information among the deep learning-based recommendation systems. As the results of the performance comparison experiments, VizNCS showed higher performance than the vanilla NCF. We also conducted an additional experiment to see if the visual information affects differently depending on the product category. The result enables us to identify which categories were affected and which were not. We expect VizNCS to improve the recommender system performance and expand the recommender system's data source to visual information.

Reducing False Alarm and Shortening Worm Detection Time in Virus Throttling (Virus Throttling의 웜 탐지오판 감소 및 탐지시간 단축)

  • Shim Jae-Hong;Kim Jang-bok;Choi Hyung-Hee;Jung Gi-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.847-854
    • /
    • 2005
  • Since the propagation speed of the Internet worms is quite fast, worm detection in early propagation stage is very important for reducing the damage. Virus throttling technique, one of many early worm detection techniques, detects the Internet worm propagation by limiting the connection requests within a certain ratio.[6, 7] The typical throttling technique increases the possibility of false detection by treating destination IP addresses independently in their delay queue managements. In addition, it uses a simple decision strategy that determines a worn intrusion if the delay queue is overflown. This paper proposes a two dimensional delay queue management technique in which the sessions with the same destination IP are linked and thus a IP is not stored more than once. The virus throttling technique with the proposed delay queue management can reduce the possibility of false worm detection, compared with the typical throttling since the proposed technique never counts the number of a IP more than once when it chicks the length of delay queue. Moreover, this paper proposes a worm detection algorithm based on weighted average queue length for reducing worm detection time and the number of worm packets, without increasing the length of delay queue. Through deep experiments, it is verified that the proposed technique taking account of the length of past delay queue as well as current delay queue forecasts the worn propagation earlier than the typical iuぉ throttling techniques do.

A Model Study of Dissolved Oxygen Change by Waste Water Discharge in the River (하수방류에 따른 하천의 용존산소변화 예측)

  • Sung, Dong-Gwon;Kim, Tae-Keun;Choi, Kyoung-Sik
    • Korean Journal of Ecology and Environment
    • /
    • v.34 no.2 s.94
    • /
    • pp.126-132
    • /
    • 2001
  • Urbanization and population increase result in the construction of STPs (Sewage Treatment Plants). Discharge from STPs greatly influences on the water quality in the stream which receives discharges. The decision of STP location should be considered with the discharge capacity of STP and self-purification of river in the water quality perspectively. In this study, a change of dissolved oxygen (DO) in a river being affected by STP discharge was simulated by the STELLA model. Minimum DO was 4.98 ppm in 42.6 km downstream of STP. Approximately, it takes 8days to recover the DO by the self-purification and this location is 340 km down-stream from the STP. If the model run for the consideration of the self-purification without phytoplankton algorithms, minimum DO was 4.92 ppm. It took 0.25 day longer to be the minimum DO than that with the phytoplankton functions. Without the phytoplankton algorithm, it took 11days to recover the DO. This proves the importance of phytoplankton in the self-purification processes. Additionally, the effect of adjacent STP discharge should be considered in the construction of new STP.

  • PDF

A Study on Analyzing Children's Crossing Behaviors on Non-signalized Crosswalk (비신호 횡단보도에서의 어린이 횡단행태 분석 연구)

  • Lee, Deok Whan;Lee, Yun Suk;Kim, Won Ho;Lee, Back Jin
    • Journal of Korean Society of Transportation
    • /
    • v.31 no.3
    • /
    • pp.19-32
    • /
    • 2013
  • The study aims to find the characteristics of children's crossing behavior on crosswalk in school zones. It considers accident occurrence and physical form of school zones. Seven elementary school zones were investigated. Using data collected by field observation and video recording, statistical analysis, CHAID algorithm analysis, and pattern analysis were performed. As a result, it was found that children's waiting, attention and distraction were related to the accident occurrence. While 69.1% children showed waiting-before-crossing behavior in low-accident occurrence crosswalk, 83.6% children showed non waiting-before-crossing behavior in high-accident occurrence crosswalk. Moreover, the ratio of waiting, attention behavior was found to be higher when the width of the crosswalk was wide and the distance from the school's entrance to the crosswalk was long. These research findings showed that children's behavior-oriented approach was required to improve safety in school zone.

Performance Improvement of an Energy Efficient Cluster Management Based on Autonomous Learning (자율학습기반의 에너지 효율적인 클러스터 관리에서의 성능 개선)

  • Cho, Sungchul;Chung, Kyusik
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.11
    • /
    • pp.369-382
    • /
    • 2015
  • Energy aware server clusters aim to reduce power consumption at maximum while keeping QoS(quality of service) compared to energy non-aware server clusters. They adjust the power mode of each server in a fixed or variable time interval to activate only the minimum number of servers needed to handle current user requests. Previous studies on energy aware server cluster put efforts to reduce power consumption or heat dissipation, but they do not consider energy efficiency well. In this paper, we propose an energy efficient cluster management method to improve not only performance per watt but also QoS of the existing server power mode control method based on autonomous learning. Our proposed method is to adjust server power mode based on a hybrid approach of autonomous learning method with multi level thresholds and power consumption prediction method. Autonomous learning method with multi level thresholds is applied under normal load situation whereas power consumption prediction method is applied under abnormal load situation. The decision on whether current load is normal or abnormal depends on the ratio of the number of current user requests over the average number of user requests during recent past few minutes. Also, a dynamic shutdown method is additionally applied to shorten the time delay to make servers off. We performed experiments with a cluster of 16 servers using three different kinds of load patterns. The multi-threshold based learning method with prediction and dynamic shutdown shows the best result in terms of normalized QoS and performance per watt (valid responses). For banking load pattern, real load pattern, and virtual load pattern, the numbers of good response per watt in the proposed method increase by 1.66%, 2.9% and 3.84%, respectively, whereas QoS in the proposed method increase by 0.45%, 1.33% and 8.82%, respectively, compared to those in the existing autonomous learning method with single level threshold.

Optimizing Similarity Threshold and Coverage of CBR (사례기반추론의 유사 임계치 및 커버리지 최적화)

  • Ahn, Hyunchul
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.8
    • /
    • pp.535-542
    • /
    • 2013
  • Since case-based reasoning(CBR) has many advantages, it has been used for supporting decision making in various areas including medical checkup, production planning, customer classification, and so on. However, there are several factors to be set by heuristics when designing effective CBR systems. Among these factors, this study addresses the issue of selecting appropriate neighbors in case retrieval step. As the criterion for selecting appropriate neighbors, conventional studies have used the preset number of neighbors to combine(i.e. k of k-nearest neighbor), or the relative portion of the maximum similarity. However, this study proposes to use the absolute similarity threshold varying from 0 to 1, as the criterion for selecting appropriate neighbors to combine. In this case, too small similarity threshold value may make the model rarely produce the solution. To avoid this, we propose to adopt the coverage, which implies the ratio of the cases in which solutions are produced over the total number of the training cases, and to set it as the constraint when optimizing the similarity threshold. To validate the usefulness of the proposed model, we applied it to a real-world target marketing case of an online shopping mall in Korea. As a result, we found that the proposed model might significantly improve the performance of CBR.

A Rule-driven Automatic Learner Grouping System Supporting Various Class Types (다양한 수업 유형을 지원하는 규칙 기반 학습자 자동 그룹핑 시스템)

  • Kim, Eun-Hee;Park, Jong-Hyun;Kang, Ji-Hoon
    • Journal of The Korean Association of Information Education
    • /
    • v.14 no.3
    • /
    • pp.291-300
    • /
    • 2010
  • Group-based learning is known to be an effective means to improve scholastic achievement in online learning. Therefore, there are some previous researches for the group-based learning. A lot of previous researches define factors for grouping from the characteristics of classes, teacher's decision and students' preferences and then generate a group based on the defined factors. However, many algorithms proposed by previous researches depend on a specific class and is not a general approach since there exist several differences in terms of the need of courses, learners, and teachers. Moreover it is hard to find a automatic system for group generation. This paper proposes a grouping system which automatically generate a learner group according to characteristics of various classes. the proposed system automatically generates a learner group by using basic information for a class or additional factors inputted from a user. The proposed system defines a set of rules for learner grouping which enables automatic selection of a learner grouping algorithm tailored to the characteristics of a given class. This rule based approach allows the proposed system to accommodate various learner grouping algorithms for a later use. Also we show the usability of our system by serviceability evaluation.

  • PDF

The Speaker Recognition System using the Pitch Alteration (피치변경을 이용한 화자인식 시스템)

  • Jung JongSoon;Bae MyungJin
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • spring
    • /
    • pp.115-118
    • /
    • 2002
  • Parameters used in a speaker recognition system are desirable expressing speaker's characteristics filly and have in a speech. That is to say, if inter-speaker than intra-speaker variance a big characteristic, it is useful to distinguish between speakers. Also, to make minimum error between speakers, it is required the improved recognition technology as well as the distinguishing characteristics. When we see the result of recent simulation performance, we obtain more exact performance by using dynamic characteristics and constant characteristics by a speaking habit. Therefore we suggest it to solve this problem as followings. The prosodic information is used by a characteristic vector of speech. Characteristics vector generally using in speaker recognition system is a modeling spectrum information and is working for a high performance in non-noise circumstance. However, it is found a problem that characteristic vector is distorted in noise circumstance and it makes a reduction of recognition rate. In this paper, we change pitch line divided by segment which can estimate a dynamic characteristic and it is used as a recognition characteristic. we confirmed that the dynamic characteristic is very robust in noise circumstance with a simulation. We make a decision of acceptance or rejection by comparing test pattern and recognition rate using the proposed algorithm has more improvement than using spectrum and prosodic information. Especially stational recognition rate can be obtained in noise circumstance through the simulation.

  • PDF

Classification Tree Analysis to Assess Contributing Factors Influencing Biosecurity Level on Farrow-to-Finish Pig Farms in Korea (분류 트리 기법을 이용한 국내 일괄사육 양돈장의 차단방역 수준에 영향을 미치는 기여 요인 평가)

  • Kim, Kyu-Wook;Pak, Son-Il
    • Journal of Veterinary Clinics
    • /
    • v.33 no.2
    • /
    • pp.107-112
    • /
    • 2016
  • The objective of this study was to determine potential contributing factors associated with biosecurity level of farrow-to-finish pig farms and to develop a classification tree model to explore how these factors related to each other based on prediction model. To this end, the author analyzed data (n = 193) extracted from a cross-sectional study of 344 farrow-to-finish farms which was conducted between March and September 2014 aimed to explore swine disease status at farm level. Standardized questionnaires with information about basic demographical data and management practices were collected in each farm by on-site visit of trained veterinarians. For the classification of the data sets regarding biosecurity level as a dependent variable and predictor variables, Chi-squared Automatic Interaction Detection (CHAID) algorithm was applied for modeling classification tree. The statistics of misclassification risk was used to evaluate the fitness of the model in terms of prediction results. Categorical multivariate input data (40 variables) was used to construct a classification tree, and the target variable was biosecurity level dichotomized into low versus high. In general, the level of biosecurity was lower in the majority of farms studied, mainly due to the limited implementation of on-farm basic biosecurity measures aimed at controlling the potential introduction and transmission of swine diseases. The CHAID model illustrated the relative importance of significant predictors in explaining the level of biosecurity; maintenance of medical records of treatment and vaccination, use of dedicated clothing to enter the farm, installing fence surrounding the farm perimeter, and periodic monitoring of the herd using written biosecurity plan in place. The misclassification risk estimate of the prediction model was 0.145 with the standard error of 0.025, indicating that 85.5% of the cases could be classified correctly by using the decision rule based on the current tree. Although CHAID approach could provide detailed information and insight about interactions among factors associated with biosecurity level, further evaluation of potential bias intervened in the course of data collection should be included in future studies. In addition, there is still need to validate findings through the external dataset with larger sample size to improve the external validity of the current model.