• Wind and Structures
• /
• 제36권6호
• /
• pp.355-366
• /
• 2023

Although machine learning (ML) techniques have been widely used in various fields of engineering practice, their applications in the field of wind engineering are still at the initial stage. In order to evaluate the feasibility of machine learning algorithms for prediction of wind loads on high-rise buildings, this study took the exposure category type, wind direction and the height of local wind force as the input features and adopted four different machine learning algorithms including k-nearest neighbor (KNN), support vector machine (SVM), gradient boosting regression tree (GBRT) and extreme gradient (XG) boosting to predict wind force coefficients of CAARC standard tall building model. All the hyper-parameters of four ML algorithms are optimized by tree-structured Parzen estimator (TPE). The result shows that mean drag force coefficients and RMS lift force coefficients can be well predicted by the GBRT algorithm model while the RMS drag force coefficients can be forecasted preferably by the XG boosting algorithm model. The proposed machine learning based algorithms for wind loads prediction can be an alternative of traditional wind tunnel tests and computational fluid dynamic simulations.

• 문화기술의 융합
• /
• 제10권3호
• /
• pp.461-466
• /
• 2024

한국의 주민참여예산제도는 자치단체별로 자율적으로 운영되도록 하고 있어서, 본 연구는 이들을 몇 개의 유사한 유형들로 구분하여서 각각의 특징들을 살펴보고자 한다. 본 연구는 다양한 머신 러닝 기법들을 활용하여 2022년도 기초 시(市)를 중심으로 운영유형을 분류하였다. 그 결과, 여러 머신 러닝 기법(Neural Network, Rule Induction(CN2), KNN, Decision Tree, Random Forest, Gradient Boosting, SVM, Naïve Bayes) 중에서 SVM 기법이 성능이 가장 좋은 것으로 확인되었다. SVM 기법이 밝혀낸 운영유형은 모두 3개인데, 하나는 위원회 활동은 적게 하지만, 참여예산은 많이 확보하는 클러스터(C1)이고, 다른 하나는 주민참여예산제에 매우 소극적인 도시들의 클러스터(C3)이다. 마지막 클러스터(C2)는 참여예산에 전반적으로 적극적인데, 대다수 지역이 여기에 해당한다. 결론적으로 한국의 대다수 자치단체는 주민참여예산제를 긍정적으로 운영하고 있으며, 오직 소수의 자치단체만 소극적이다. 후속 연구로 지난 10여 년간의 시계열 자료를 분석한다면, 우리는 주민참여예산에 관한 지방자치단체 유형 분류의 신뢰도를 더욱 높일 수 있을 것으로 기대한다.

• 인터넷정보학회논문지
• /
• 제21권5호
• /
• pp.57-65
• /
• 2020

At present, the existing virus recognition systems usually use signature approach to detect malicious executable files, but these methods often fail to detect new and invisible malware. At the same time, some methods try to use more general features to detect malware, and achieve some success. Moreover, machine learning-based approaches are applied to detect malware, which depend on features extracted from malicious codes. However, the different distribution of features oftraining and testing datasets also impacts the effectiveness of the detection models. And the generation oflabeled datasets need to spend a significant amount time, which degrades the performance of the learning method. In this paper, we use transfer learning to detect new and previously unseen malware. We first extract the features of Portable Executable (PE) files, then combine transfer learning training model with KNN approachto detect the new and unseen malware. We also evaluate the detection performance of a classifier in terms of precision, recall, F1, and so on. The experimental results demonstrate that proposed method with high detection rates andcan be anticipated to carry out as well in the real-world environment.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2018년도 추계학술발표대회
• /
• pp.648-651
• /
• 2018

흡연여부를 감별하는 지표가 있지만 반감기 등 여러 가지 요인에 따라 결과가 변한다는 단점이 있다. 그렇기 때문에 흡연여부 감별 시 외부요인에 영향을 덜 받는 지표가 필요하게 되었다. 그래서 흡연 여부 감별하는데 적합한 모형을 찾아 외부요인에 영향이 적은 지표를 개발에 도움이 될 것을 기대하며 연구를 진행하였다. 실험은 국민건강보험공단에서 제공한 건강검진정보데이터를 기반으로, SVM, Logistic Regression, KNN 등의 머신러닝 모델을 이용하여 흡연 여부를 감별하는 것을 진행한다. 이 실험은 속성에 따른 모형의 성능변화와 학습데이터 수에 따른 모형의 성능변화에 대한 2가지 측면에서 모델의 성능을 측정하였다. 모델의 평가는 정확도(accuracy), 정밀도(precision), 재현율(recall), 조화 평균(f1-score)으로 진행하였으며, 약 70퍼센트 정도의 정확도와, 60퍼센트 대의 재현율을 보인다. 실험 결과, SVM이 속성에 따른 모형의 성능 변화 실험에서는 63%의 재현율, 학습데이터 수에 따른 성능 변화 실험에서는 68%의 재현율을 보여, 흡연자 판별에 가장 좋은 성능을 보였다. 또한 재현율을 기준으로 실험 차수별로 가장 좋은 성능을 보인 모델과 가장 저조한 성능을 보인 모델의 차이를 비교한 결과, '속성에 따른 모형의 성능 변화 실험'에서는 최고 36%의 차이를 보였으며, '학습데이터 수에 따른 성능 변화 실험'에서 최고 42%의 차이를 보여 주었다. 이에 판별을 위한 속성도 중요하지만, 적합한 모형 선택 또한 중요하다는 것을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권5호
• /
• pp.1708-1727
• /
• 2021

In the advent of the twenty-first century, human beings began to closely interact with technology. Today, technology is developing, and as a result, the world wide web (www) has a very important place on the Internet and the significant task is fulfilled by Web services. A lot of Web services are available on the Internet and, therefore, it is difficult to find matching Web services among the available Web services. The recommendation systems can help in fixing this problem. In this paper, our observation was based on the recommended method such as the collaborative filtering (CF) technique which faces some failure from the data sparsity and the cold-start problems. To overcome these problems, we first applied an ontology-based clustering and then the k-nearest neighbor (KNN) algorithm for each separate cluster group that effectively increased the data density using the past user interests. Then, user ratings were predicted based on the model-based approach, such as singular value decomposition (SVD) and the predictions used for the recommendation. The evaluation results showed that our proposed approach has a less prediction error rate with high accuracy after analyzing the existing recommendation methods.

• 한국기계가공학회지
• /
• 제21권3호
• /
• pp.77-85
• /
• 2022

In this study, to diagnose the grinding state of a micro drill bit, a sensor attachment location was selected through random vibration analysis of the grinding unit of the micro drill-bit grinding system. In addition, the vibration data generated during the drill bit grinding were collected from the grinding unit for the grinding wheels under the steady and worn conditions, and data feature extraction and dimension reduction were performed. The wear of the micro-drill-bit grinding wheel was diagnosed by applying KNN, a machine-learning algorithm. The classification model showed excellent performance, with an accuracy of 99.2%. The precision, recall and f1-score were higher than 99% in both the steady and wear conditions.

• Geomechanics and Engineering
• /
• 제31권3호
• /
• pp.265-279
• /
• 2022

Tunnel convergence prediction is essential for the safe construction and design of tunnels. This study proposes five machine learning models of deep neural network (DNN), K-nearest neighbors (KNN), Gaussian process regression (GPR), support vector regression (SVR), and decision trees (DT) to predict the convergence phenomenon during or shortly after the excavation of tunnels. In this respect, a database including 650 datasets (440 for training, 110 for validation, and 100 for test) was gathered from the previously constructed tunnels. In the database, 12 effective parameters on the tunnel convergence and a target of tunnel wall convergence were considered. Both 5-fold and hold-out cross validation methods were used to analyze the predicted outcomes in the ML models. Finally, the DNN method was proposed as the most robust model. Also, to assess each parameter's contribution to the prediction problem, the backward selection method was used. The results showed that the highest and lowest impact parameters for tunnel convergence are tunnel depth and tunnel width, respectively.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2006년도 하계학술대회 논문집 Vol.7
• /
• pp.282-283
• /
• 2006

본 연구에서는 분말입자의 미립화에 따른 $(K,Na)NbO_3$(KNN) 세라믹스의 소결밀도와 압전특성을 평가하였다. 먼저 입자를 미립화 시키기 위해 planetary milling machine을 이용하였으며, 소결밀도 및 압전 특성을 측정하였다. Ball milling을 24~72시간동안 한 결과 particle size는 730~490nm 정도였다. Milling 시간이 증가할수록 입자크기는 감소하였고, 소결밀도는 particle size가 작을수록 증가하였고, $4.50g/cm^3$으로 가장 높은 밀도를 나타냈다. 또한 소결 밀도가 증가함에 따라 기계적 품질 계수(Qm) 역시 증가한 반면, particle size가 작아짐에 따라 전기기계 결합계수(Kp)는 감소하는 경황을 보였다.

• 한국컴퓨터정보학회논문지
• /
• 제22권7호
• /
• pp.63-74
• /
• 2017

Recently in the area of ICT, the M2M and IoT are in the spotlight as a cutting edge technology with the help of advancement of internet. Among those fields, the smart home is the closest area to our daily lives. Smart home has the purpose to lead a user more convenient living in the house with WLAN (Wireless Local Area Network) or other short-range communication environments using automated appliances. With an arrival of the age of IoT, this can be described as one axis of a variety of applications as for the M2H (Machine to Home) field in M2M. In this paper, we propose a novel technique for estimating the location of a terminal that freely move within a specified area using the RSSI (Received Signal Strength Indication) in the WLAN environment. In order to perform the location estimation, the Fingerprint and KNN methods are utilized and the LMS with the gradient descent method and the proposed algorithm are also used through the error correction functions for locating the real-time position of a moving user who is keeping a smart terminal. From the estimated location, the nearest fixed devices which are general electric appliances were supposed to work appropriately for self-operating of virtual smart home. Through the experiments, connection and operation success rate, and the performance results are analyzed, presenting the verification results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3654-3670
• /
• 2019

This paper proposes an Image Texture Median Filter (ITMF) to analyze and detect Android malware on Drebin datasets. We design a model of "ITMF" combined with Image Processing of Median Filter (MF) to reflect the similarity of the malware binary file block. At the same time, using the MAEVS (Malware Activity Embedding in Vector Space) to reflect the potential dynamic activity of malware. In order to ensure the improvement of the classification accuracy, the above-mentioned features(ITMF feature and MAEVS feature)are studied to train Restricted Boltzmann Machine (RBM) and Back Propagation (BP). The experimental results show that the model has an average accuracy rate of 95.43% with few false alarms. to Android malicious code, which is significantly higher than 95.2% of without ITMF, 93.8% of shallow machine learning model SVM, 94.8% of KNN, 94.6% of ANN.