• The Korean Journal of Applied Statistics
• /
• v.28 no.1
• /
• pp.1-8
• /
• 2015

Security has become an issue due to the rapid increases in internet traffic data network. Especially P2P traffic data poses a great challenge to network systems administrators. Preemptive measures are necessary for network quality of service(QoS) and efficient resource management like blocking suspicious traffic data. Deep packet inspection(DPI) is the most exact way to detect an intrusion but it may pose a private security problem that requires time. We used several machine learning methods to compare the performance in classifying network traffic data accurately over time. The Random Forest method shows an excellent performance in both accuracy and time.

• Journal of the Korean Physical Society
• /
• v.73 no.10
• /
• pp.1589-1595
• /
• 2018

Similarity index measures the topological proximity of node pairs in a complex network. Numerous similarity indices have been defined and investigated, but the dependency of structure on the performance of similarity indices has not been sufficiently investigated. In this study, we investigated the relationship between the performance of similarity indices and structural properties of a network by employing a two-state random network. A node in a two-state network has binary types that are initially given, and a connection probability is determined from the state of the node pair. The performances of similarity indices are affected by the number of links and the ratio of intra-connections to inter-connections. Similarity indices have different characteristics depending on their type. Local indices perform well in small-size networks and do not depend on whether the structure is intra-dominant or inter-dominant. In contrast, global indices perform better in large-size networks, and some such indices do not perform well in an inter-dominant structure. We also found that link prediction performance and the performance of similarity are correlated in both model networks and empirical networks. This relationship implies that link prediction performance can be used as an approximation for the performance of the similarity index when information about node type is unavailable. This relationship may help to find the appropriate index for given networks.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.26-32
• /
• 2020

There are many airline customer evaluation data, but they are insufficient in terms of predicting customer satisfaction in practice. In particular, they are generally insufficient in case of verification of data value and development of a customer satisfaction prediction model based on customer evaluation data. In this paper, airline customer satisfaction analysis is conducted through an experiment of correlation analysis between customer evaluation data provided by Google's Kaggle. The difference in accuracy varied according to the three types, which are the overall variables, the top 4 and top 8 variables with the highest correlation. To build an airline customer satisfaction prediction model, they are applied to three classification algorithms of Random Forest, SVM, DNN and conduct a classification experiment. They are divided into training data and verification data by 7:3. As a result, the DNN model showed the lowest accuracy at 86.4%, while the SVM model at 89% and the Random Forest model at 95.7% showed the highest accuracy and performance.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2000.11a
• /
• pp.69-73
• /
• 2000

We systematically analyze the influence of fracture junction, solute transfer characteristics on transport patterns in discrete, two-dimensional fracture network models. Regular lattices and random fracture networks with power-law length distributions are considered in conjunction with particle tracking methods. Solute transfer probabilities at fracture junctions are determined from analytical considerations and from simple complete mixing and streamline routing models. For regular fracture networks, mixing conditions at fracture junctions are always dominated by either complete mixing or streamline routing end member cases. Moreover bulk transport properties such as the spreading and the dilution of solute are highly sensitive to the mixing rule. However in power-law length networks there is no significant difference in bulk transport properties, as calculated by assuming either of the two extreme mixing rules. This apparent discrepancy between the effects of mixing properties at fracture junctions in regular and random fracture networks is explained by the statistics of the coordination number and of the flow conditions at fracture intersections. We suggest that the influence of mixing rules on bulk solute transport could be important in systematic orthogonal fracture networks but insignificant in random networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.30-38
• /
• 2008

The traditional TCP was designed assuming wired networks. Thus, if it is used networks consisting of both wired and wireless networks, all packet losses including random losses in wireless links are regarded as network congestion losses. Misclassification of packet losses causes unnecessary reduction of transmission rate, and results in waste of bandwidth. In this paper, we present WTCP(wireless TCP) congestion control algorithm that differentiates the random losses more accurately, and adopts improved congestion control which results in better network throughput. To evaluate the performance of proposed scheme, we compared the proposed algorithm with TCP Westwood and TCP Veno via simulations.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.81-88
• /
• 2023

In the present scenario, enormous amounts of data are produced every second. These data also contain private information from sources including media platforms, the banking sector, finance, healthcare, and criminal histories. Data mining is a method for looking through and analyzing massive volumes of data to find usable information. Preserving personal data during data mining has become difficult, thus privacy-preserving data mining (PPDM) is used to do so. Data perturbation is one of the several tactics used by the PPDM data privacy protection mechanism. In Perturbation, datasets are perturbed in order to preserve personal information. Both data accuracy and data privacy are addressed by it. This paper will explore and compare several perturbation strategies that may be used to protect data privacy. For this experiment, two perturbation techniques based on random projection and principal component analysis were used. These techniques include Improved Random Projection Perturbation (IRPP) and Enhanced Principal Component Analysis based Technique (EPCAT). The Naive Bayes classification algorithm is used for data mining approaches. These methods are employed to assess the precision, run time, and accuracy of the experimental results. The best perturbation method in the Nave-Bayes classification is determined to be a random projection-based technique (IRPP) for both the cardiovascular and hypothyroid datasets.

• Structural Engineering and Mechanics
• /
• v.31 no.2
• /
• pp.153-162
• /
• 2009

The reduction of the dynamic response of an offshore structure subjected to wind-generated random ocean waves is of extreme significance in the aspects of serviceability, fatigue life and safety of the structure. In this study, a new neuro-control scheme is applied to the vibration control of a fixed offshore platform under random wave loads to examine the applicability of the proposed method. It is called the Lattice Probabilistic Neural Network (LPNN), as it utilizes lattice pattern of state vectors as the training data of PNN. When control results of the LPNN are compared with those of the NN and PNN, LPNN showed better performance in effectively suppressing the structural responses in a shorter computational time.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.208-213
• /
• 2004

Methods for estimation of the effective stress intensity factor range (${\Delta}K_{eff}$) are evaluated for narrow and wide band random loading crack growth test data of 2024-T351 aluminum alloy. Three methods of determining $K_{op}$, visual measurement, ASTM offset compliance method, and the neural network method proposed by Kang and Song, and three methods of estimating ${\Delta}K_{eff}$, conventional, the 2/PI0 and 2/PI methods proposed by Donald and Paris, are compared in a quantitative manner by using the results of fatigue crack growth life prediction under random loading. For all $K_{op}$ determination methods discussed, the 2/PI0 and 2/PI methods of estimating ${\Delta}K_{eff}$ provide better results than conventional method for narrow and wide band random loading data.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.941-946
• /
• 2005

In this paper an active random noise control using adaptive learning rate neural networks is presented. The adaptive learning rate strategy increases the learning rate by a small constant if the current partial derivative of the objective function with respect to the weight and the exponential average of the previous derivatives have the same sign, otherwise the learning rate is decreased by a proportion of its value. The use of an adaptive learning rate attempts to keep the learning step size as large as possible without leading to oscillation. It is expected that a cost function minimize rapidly and training time is decreased. Numerical simulations and experiments of active random noise control with the transfer function of the error path will be performed, to validate the convergence properties of the adaptive learning rate Neural Networks. Control results show that adaptive learning rate Neural Networks control structure can outperform linear controllers and conventional neural network controller for the active random noise control.

• Journal of Sensor Science and Technology
• /
• v.29 no.4
• /
• pp.227-231
• /
• 2020

Silver nanowire random networks are promising candidates for replacing indium tin oxide (ITO) as transparent and conductive electrodes. They can also be used as transparent heating films with self-cleaning and defogging properties. By virtue of the Joule heating effect, silver nanowire random networks can be heated when voltage bias is applied; however, they are unsuitable for long-term use. In this work, we study the Joule heating of silver nanowire random networks embedded in polymers. Silver nanowire random networks embedded in polymers exhibit breakdown under the application of electric current. Their surface morphological changes indicate that nanoparticle formation may be the main cause of this electrical breakdown. Numerical analyses are used to investigate the temperatures of the silver nanowire and substrate.