• Title/Summary/Keyword: data network

Search Result 18,029, Processing Time 0.046 seconds

Social Network Analysis to Analyze the Purchase Behavior Of Churning Customers and Loyal Customers (사회 네트워크 분석을 이용한 충성고객과 이탈고객의 구매 특성 비교 연구)

  • Kim, Jae-Kyeong;Choi, Il-Young;Kim, Hyea-Kyeong;Kim, Nam-Hee
    • Korean Management Science Review
    • /
    • v.26 no.1
    • /
    • pp.183-196
    • /
    • 2009
  • Customer retention has been a pressing issue for companies to get and maintain the loyal customers in the competing environment. Lots of researchers make effort to seek the characteristics of the churning customers and the loyal customers using the data mining techniques such as decision tree. However, such existing researches don't consider relationships among customers. Social network analysis has been used to search relationships among social entities such as genetics network, traffic network, organization network and so on. In this study, a customer network is proposed to investigate the differences of network characteristics of churning customers and loyal customers. The customer networks are constructed by analyzing the real purchase data collected from a Korean cosmetic provider. We investigated whether the churning customers and the loyal customers have different degree centralities and densities of the customer networks. In addition, we compared products purchased by the churning customers and those by the loyal customers. Our data analysis results indicate that degree centrality and density of the churning customer network are higher than those of the loyal customer network, and the various products are purchased by churning customers rather than by the loyal customers. We expect that the suggested social network analysis is used to as a complementary analysis methodology with existing statistical analysis and data mining analysis.

A Model to Investigate the Security Challenges and Vulnerabilities of Cloud Computing Services in Wireless Networks

  • Desta Dana Data
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.10
    • /
    • pp.107-114
    • /
    • 2023
  • The study provides the identification of vulnerabilities in the security issues by Wireless Network. To achieve it the research focus on packet flow analysis, end to end data communication, and the security challenges (Cybercrime, insider threat, attackers, hactivist, malware and Ransomware). To solve this I have used the systematic literature review mechanisms and demonstrative tool namely Wireshark network analyzer. The practical demonstration identifies the packet flow, packet length time, data flow statistics, end- to- end packet flow, reached and lost packets in the network and input/output packet statics graphs. Then, I have developed the proposed model that used to secure the Wireless network solution and prevention vulnerabilities of the network security challenges. And applying the model that used to investigate the security challenges and vulnerabilities of cloud computing services is used to fulfill the network security goals in Wireless network. Finally the research provides the model that investigate the security challenges and vulnerabilities of cloud computing services in wireless networks

SHM data anomaly classification using machine learning strategies: A comparative study

  • Chou, Jau-Yu;Fu, Yuguang;Huang, Shieh-Kung;Chang, Chia-Ming
    • Smart Structures and Systems
    • /
    • v.29 no.1
    • /
    • pp.77-91
    • /
    • 2022
  • Various monitoring systems have been implemented in civil infrastructure to ensure structural safety and integrity. In long-term monitoring, these systems generate a large amount of data, where anomalies are not unusual and can pose unique challenges for structural health monitoring applications, such as system identification and damage detection. Therefore, developing efficient techniques is quite essential to recognize the anomalies in monitoring data. In this study, several machine learning techniques are explored and implemented to detect and classify various types of data anomalies. A field dataset, which consists of one month long acceleration data obtained from a long-span cable-stayed bridge in China, is employed to examine the machine learning techniques for automated data anomaly detection. These techniques include the statistic-based pattern recognition network, spectrogram-based convolutional neural network, image-based time history convolutional neural network, image-based time-frequency hybrid convolution neural network (GoogLeNet), and proposed ensemble neural network model. The ensemble model deliberately combines different machine learning models to enhance anomaly classification performance. The results show that all these techniques can successfully detect and classify six types of data anomalies (i.e., missing, minor, outlier, square, trend, drift). Moreover, both image-based time history convolutional neural network and GoogLeNet are further investigated for the capability of autonomous online anomaly classification and found to effectively classify anomalies with decent performance. As seen in comparison with accuracy, the proposed ensemble neural network model outperforms the other three machine learning techniques. This study also evaluates the proposed ensemble neural network model to a blind test dataset. As found in the results, this ensemble model is effective for data anomaly detection and applicable for the signal characteristics changing over time.

Detecting Anomalies, Sabotage, and Malicious Acts in a Cyber-physical System Using Fractal Dimension Based on Higuchi's Algorithm

  • Marwan Albahar
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.4
    • /
    • pp.69-78
    • /
    • 2023
  • With the global rise of digital data, the uncontrolled quantity of data is susceptible to cyber warfare or cyber attacks. Therefore, it is necessary to improve cyber security systems. This research studies the behavior of malicious acts and uses Higuchi Fractal Dimension (HFD), which is a non-linear mathematical method to examine the intricacy of the behavior of these malicious acts and anomalies within the cyber physical system. The HFD algorithm was tested successfully using synthetic time series network data and validated on real-time network data, producing accurate results. It was found that the highest fractal dimension value was computed from the DoS attack time series data. Furthermore, the difference in the HFD values between the DoS attack data and the normal traffic data was the highest. The malicious network data and the non-malicious network data were successfully classified using the Receiver Operating Characteristics (ROC) method in conjunction with a scaling stationary index that helps to boost the ROC technique in classifying normal and malicious traffic. Hence, the suggested methodology may be utilized to rapidly detect the existence of abnormalities in traffic with the aim of further using other methods of cyber-attack detection.

Performance Evaluations of the Computer Networks for the Voice/Data Coexisted Network Design (음성/데이터 통합망 설계를 위한 이행 단계별 성능평가)

  • Eom, Ki-Bok;Yoe, Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.4
    • /
    • pp.678-683
    • /
    • 2003
  • This study presents a result of performance with the design of network topology for voice and data integration under computer network. This network is consisted of FastEthernet, other LANs and ATM WAN(wide area network), and performance evaluation of delay in a PBX+IP network, delay in a VoIP network and delay in a IP+ATM network will be shown. We use parameters including network bandwidth, number of packet, routing protocol(IGRP, OSPF). We simulate integrated of voice and data used PBX. we will study further about the case of integrated of voice and data environments using PBX. and, evaluate IP+ATM WAN average measured network delay and average delay of VoIP network.

An Intra-domain Network Topologyd Discovery Algorithm (자치영역 네트워크 토플로지 작성 알고리즘)

  • Min, Gyeong-Hun;Jang, Hyeok-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1193-1200
    • /
    • 2000
  • A network topology has been an important factor for an efficient network management, but data collection for the network configuration has been done manually or semi automatically by a network administrator or an expert. Requirements to generate an intro-domain network topology ar usually either all IP addresses with subne $t^ernet mask or the network identification of all IP addresses. The amounts of traffic are generally high in the semi-automatic system due to using large number of low-level protocols and commands to get rather simple data. In this paper, we propose an algorithm which can be executed with only publicly available input. It can find all IP addresses as well as the network boundary of an intra-domain by using an intelligent method developed in this algorithm. The collected data will be used to draw a network map automatically by using a proposed network topology generation algorithm.hm.

  • PDF

A holistic distributed clustering algorithm based on sensor network (센서 네트워크 기반의 홀리스틱 분산 클러스터링 알고리즘)

  • Chen Ping;Kee-Wook Rim;Nam Ji-Yeun;Lee KyungOh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.874-877
    • /
    • 2008
  • Nowadays the existing data processing systems can only support some simple query for sensor network. It is increasingly important to process the vast data streams in sensor network, and achieve effective acknowledges for users. In this paper, we propose a holistic distributed k-means algorithm for sensor network. In order to verify the effectiveness of this method, we compare it with central k-means algorithm to process the data streams in sensor network. From the evaluation experiments, we can verify that the proposed algorithm is highly capable of processing vast data stream with less computation time. This algorithm prefers to cluster the data streams at the distributed nodes, and therefore it largely reduces redundant data communications compared to the central processing algorithm.

Study of Virtual Goods Purchase Model Applying Dynamic Social Network Structure Variables (동적 소셜네트워크 구조 변수를 적용한 가상 재화 구매 모형 연구)

  • Lee, Hee-Tae;Bae, Jungho
    • Journal of Distribution Science
    • /
    • v.17 no.3
    • /
    • pp.85-95
    • /
    • 2019
  • Purpose - The existing marketing studies using Social Network Analysis have assumed that network structure variables are time-invariant. However, a node's network position can fluctuate considerably over time and the node's network structure can be changed dynamically. Hence, if such a dynamic structural network characteristics are not specified for virtual goods purchase model, estimated parameters can be biased. In this paper, by comparing a time-invariant network structure specification model(base model) and time-varying network specification model(proposed model), the authors intend to prove whether the proposed model is superior to the base model. In addition, the authors also intend to investigate whether coefficients of network structure variables are random over time. Research design, data, and methodology - The data of this study are obtained from a Korean social network provider. The authors construct a monthly panel data by calculating the raw data. To fit the panel data, the authors derive random effects panel tobit model and multi-level mixed effects model. Results - First, the proposed model is better than that of the base model in terms of performance. Second, except for constraint, multi-level mixed effects models with random coefficient of every network structure variable(in-degree, out-degree, in-closeness centrality, out-closeness centrality, clustering coefficient) perform better than not random coefficient specification model. Conclusion - The size and importance of virtual goods market has been dramatically increasing. Notwithstanding such a strategic importance of virtual goods, there is little research on social influential factors which impact the intention of virtual good purchase. Even studies which investigated social influence factors have assumed that social network structure variables are time-invariant. However, the authors show that network structure variables are time-variant and coefficients of network structure variables are random over time. Thus, virtual goods purchase model with dynamic network structure variables performs better than that with static network structure model. Hence, if marketing practitioners intend to use social influences to sell virtual goods in social media, they had better consider time-varying social influences of network members. In addition, this study can be also differentiated from other related researches using survey data in that this study deals with actual field data.

Why Mobile Operators Introduced Data Plans: An Analysis of Voice and Data Usage Patterns

  • Lee, Hoon
    • Journal of information and communication convergence engineering
    • /
    • v.14 no.1
    • /
    • pp.9-13
    • /
    • 2016
  • With the introduction of the data-oriented plan for LTE service, one may concerned with the background of the ISP's policy in charging for LTE services. In this work we investigate the latest usage patterns of voice and data applications for customers over the current mobile network, via which we investigate why mobile operators introduced data-oriented plans. To be specific, we collected the real-field data for the volume of voice and data traffic from the LTE network before the data-oriented plans were introduced. From the collected data we compute the absolute volume as well as the proportion of voice and data applications. From these observations we infer mobile operators' reasoning behind the decision to introduce data-oriented plans with unlimited voice calls over the mobile network.

Using Structural Changes to support the Neural Networks based on Data Mining Classifiers: Application to the U.S. Treasury bill rates

  • Oh, Kyong-Joo
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.57-72
    • /
    • 2003
  • This article provides integrated neural network models for the interest rate forecasting using change-point detection. The model is composed of three phases. The first phase is to detect successive structural changes in interest rate dataset. The second phase is to forecast change-point group with data mining classifiers. The final phase is to forecast the interest rate with BPN. Based on this structure, we propose three integrated neural network models in terms of data mining classifier: (1) multivariate discriminant analysis (MDA)-supported neural network model, (2) case based reasoning (CBR)-supported neural network model and (3) backpropagation neural networks (BPN)-supported neural network model. Subsequently, we compare these models with a neural network model alone and, in addition, determine which of three classifiers (MDA, CBR and BPN) can perform better. For interest rate forecasting, this study then examines the predictability of integrated neural network models to represent the structural change.

  • PDF