China Communications

Archive

  • Select all
    |
    FEATURE TOPIC: CLOUD MOBILE MEDIA
  • FEATURE TOPIC: CLOUD MOBILE MEDIA
    Joint Content Placement and Traffic Management for Cloud Mobile Video Distribution over Software-Defined Networks
    Zhenghuan Zhang, Xiaofeng Jiang, Hongsheng Xi
    2016, 13(8): 1-12.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To cope with the rapid growth of mobile video, video providers have leveraged cloud technologies to deploy their mobile video service system for more cost-effective and scalable performance. The emergence of Software-Defined Networking (SDN) provides a promising solution to manage the underlying network. In this paper, we introduce an SDN-enabled cloud mobile video distribution architecture and propose a joint video placement, request dispatching and traffic management mechanism to improve user experience and reduce the system operational cost. We use a utility function to capture the two aspects of user experience: the level of satisfaction and average latency, and formulate the joint optimization problem as a mixed integer programming problem. We develop an optimal algorithm based on dual decomposition and prove its optimality. We conduct simulations to evaluate the performance of our algorithm and the results show that our strategy can effectively cut down the total cost and guarantee user experience.
  • FEATURE TOPIC: CLOUD MOBILE MEDIA
    Users’ Media Cloud Assisted D2D Communications for Distributed Caching Underlaying Cellular Network
    Mingkai Chen, Lei Wang, Jianxin Chen
    2016, 13(8): 13-23.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In cellular networks, the proximity devices may share files directly without going through the eNBs, which is called Device-to-Device communications (D2D). It has been considered as a potential technological component for the next generation of communication. In this paper, we investigate a novel framework to distribute video files from some other proximity devices through users’ media cloud assisted D2D communication. The main contributions of this work lie in: 1) Providing an efficient algorithm Media Cloud Cluster Selecting Scheme (MCCSS) to achieve the reasonable cluster; 2) Distributing the optimum updating files to the cluster heads, in order to minimize the expected D2D communication transmission hop for files; 3) Proposing a minimum the hop method, which can ensure the user obtain required file as soon as possible. Extensive simulation results have demonstrated the efficiency of the proposed scheme.
  • FEATURE TOPIC: CLOUD MOBILE MEDIA
    Joint Optimization of Admission Control and Rate Adaptation for Video Sharing over Multirate Wireless Community Cloud
    Peng Zhao, Xinyu Yang*
    2016, 13(8): 24-40.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Emerging wireless community cloud enables usergenerated video content to be shared and consumed in a social context. However, the nature of shared wireless medium and timevarying channels seriously limits the quality of service (QoS), partially owing to the lack of mechanisms for effectively utilizing multi-rate channel resources. In this paper, the joint optimization of admission control and rate adaptation is proposed, resulting in a bandwidth-aware rate-adaptive admission control (BRAC) scheme to provide bandwidth guarantee for sharing social multimedia contents. The analytical approach leads to the following major contributions: (1) a bandwidth-aware rate selection (BRS) algorithm to optimally meet the bandwidth requirement of the data session and channel conditions at the physical layer; (2) a routing-coupled rate adaption and admission control algorithm to admit data sessions with bandwidth guarantee. Moreover, extensive numerical simulations suggest that BRAC is efficient and effective in meeting the bandwidth requirements for sharing social multimedia contents. These insights will shed light on communication system implementation for multimedia content sharing over multirate wireless community cloud.
  • FEATURE TOPIC: CLOUD MOBILE MEDIA
    D2D multicast retransmission algorithm in mobile cloud based on SINR constraint
    Zufan Zhang, Lisha Luo, Lisha Wang
    2016, 13(8): 41-52.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In cellular network, users with same demand and in proximity to each other form the mobile cloud, in which the short-range D2D technology is employed by users to improve the data dissemination efficiency. In view of the fact that the D2D links with the poor channel conditions are likely to be the bottleneck of resource utilization improvement, aiming at the differentiation of link quality, this paper proposes a intra-cloud D2D multicast retransmission algorithm based on SINR constraint to meet the minimum requirement of D2D retransmission for QoS. In the proposed algorithm, the model of system link cost is built, the number of multicast retransmission times is restricted and each link quality matrix is traversed to reasonably select the multicast transmitter as well as its routing, which further reduces the link cost consumption, and in turn improves the bandwidth efficiency. Simulation results show that the proposed algorithm is more efficient to improve the bandwidth utilization when the ratio between normal user and non-normal user is small in mobile cloud.
  • FEATURE TOPIC: CLOUD MOBILE MEDIA
    Influence Analysis for Celebrities via Public Cloud and Social Platform
    Lu Liu, Haoting Liang
    2016, 13(8): 53-62.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Recently, the online social networks have emerged as one of the important platforms for social users. Among millions of users, famous person from entertainment circle arouse our interest. They promote social relationship and establish their reputation via these platforms. To analyze the social influence of entertainment stars,we propose and implement a public cloud based framework to crawl celebrities’ social messages from Sina Weibo, store the gathered messages, and conduct various analysis to assess the social influence. It consist of three key components: task generation, resource management and task scheduling, and influence analysis. The task generation is responsible of acquiring celebrities’ social accounts and issue crawling tasks. We propose a cross-media method to extract social accounts from webpages. The resource management and task scheduling will dynamic adjust the rented resource to minimize the total computing cost while keeping QoS. We propose a dynamic instance provisioning strategy based on the large deviation principle. The influence analysis will undertake various types of analysis, such as fan count, posting frequency, textual analysis, and so on. More than 10,000 celebrities’ microblogs have been gathered so far, and some related gainers, such as celebrities and ad agencies can gain the illumination brought by our analysis.
  • FEATURE TOPIC: CLOUD MOBILE MEDIA
    Enabling QoE-aware Mobile Cloud Video Recording over Roadside Vehicular Networks
    Tongtong Jiang, Zhaobin Deng, Weiwei Huang, Guoqing Zhang
    2016, 13(8): 63-73.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Most of previous video recording devices in mobile vehicles commonly store captured video contents locally. With the rapid development of 4G/WiFi networks, there emerges a new trend to equip video recording devices with wireless interfaces to enable video uploading to the cloud for video playback in a later time point. In this paper, we propose a QoE-aware mobile cloud video recording scheme in the roadside vehicular networks, which can adaptively select the proper wireless interface and video bitrate for video uploading to the cloud. To maximize the total utility, we need to design a control strategy to carefully balance the transmission cost and the achieved QoE for users. To this purpose, we investigate the tradeoff between cost incurred by uploading through cellular networks and the achieved QoE of users. We apply the optimization framework to solve the formulated problem and design an online scheduling algorithm. We also conduct extensive trace-driven simulations and our results show that our algorithm achieves a good balance between the transmission cost and user QoE.
  • FEATURE TOPIC: CLOUD MOBILE MEDIA
    Efficient Video Transmission in D2D Assisted Mobile Cloud Networks
    Cheng Zhan, Zhe Wen
    2016, 13(8): 74-83.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The increasing popularity of smart mobile devices and the rise of online services has increased the requirements for efficient dissemination of social video contents. In this paper, we study the problem of distributing video from cloud server to users in partially connected cooperative D2D network using network coding. In such a scenario, the transmission conflicts occur from simultaneous transmissions of multiple devices, and the scheduling decision should be made not only on the encoded packets but also on the set of transmitting devices. We analyze the lower bound and give an integer linear formulation of the joint optimization problem over the set of transmitting devices and the packet combinations. We also propose a heuristic solution for this setup using a conflict graph and local graph at every device. Simulation results show that our coding scheme significantly reduces the number of transmission slots, which will increase the efficiency of video delivery.
  • FEATURE TOPIC: CLOUD MOBILE MEDIA
    Mobile Content Distribution with Vehicular Cloud in Urban VANETs
    Haigang Gong, Lingfei Yu, Nianbo Liu, Xue Zhang
    2016, 13(8): 84-96.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Plenty of multimedia contents such as traffic images, surveillance video, music and movie will flood into vehicular ad hoc networks. However, content distribution over VANETs is not a easy task, due to the high mobility of vehicles and intermittent connectivity. Infrastructure-based scheme can relieve the problem, but with a large amount of investment. In this paper, we propose a mobile content distribution scheme based on roadside parking cloud (RPC), which is formed by the parked car on the roadside, and mobile cloud (MC), which is formed by moving cars on the road. According to a trip history model, a mobile car can estimate its following trajectory. When it wants to download the content, gateway node of the RPC will work out a downloading schedule, which tells it how much chunks it can download from which RPCs. Moreover, the helper of the mobile car in mobile cloud would deliver specified chunks to it when there is lack of RPC in the following trip. Simulation results show that cloud-based scheme performs better than inter-vehicle communication approach and cluster-based scheme.
  • FEATURE TOPIC: CLOUD MOBILE MEDIA
    Construction of Regular Rate-Compatible LDPC Convolutional Codes
    Liwei Mu, Chulong Liang, Zhiyong Liu, Daru Pan
    2016, 13(8): 97-102.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In this paper, we propose a new method to derive a family of regular rate-compatible low-density parity-check (RC-LDPC) convolutional codes from RC-LDPC block codes. In the RC-LDPC convolutional family, each extended sub-matrix of each extended code is obtained by choosing specified elements from two fixed matrices HE1k and HE2k, which are derived by modifying the extended matrices HE1 and HE2 of a systematic RC-LDPC block code. The proposed method which is based on graph extension simplifies the design, and prevent the defects caused by the puncturing method. It can be used to generate both regular and irregular RC-LDPC convolutional codes. All resulted codes in the family are systematic which simplify the encoder structure and have maximum encoding memories which ensure the property. Simulation results show the family collectively offer a steady improvement in performance with code compatibility over binary-input additive white Gaussian noise channel (BI-AWGNC).
    • WIRELESS COMMUNICATIONS
  • WIRELESS COMMUNICATIONS
    Partial Parallel Encoding and Algorithmic Construction of Non-Binary Structured IRA Codes
    Wojciech Sulek, Marcin Kucharczyk
    2016, 13(8): 103-116.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The non-binary (NB) Irregular Repeat Accumulate (IRA) codes, as a subclass of NB LDPC codes, potentially have an excellent error-correcting performance. They are also known to provide linear complexity of encoding, but the basic encoding method with the serial rate-1 accumulator significantly limits the encoder throughput. Then the objective of the research presented in this paper is to develop an encoding method pro- viding significantly increased throughput of an NB-IRA encoder altogether with a flexible code construction methods for the structured (S-NB-IRA) codes eligible for the proposed encoding method. For this purpose, we reformulate the classic encoding algorithm to fit into the partial parallel encoder architecture. We propose the S-NB-IRA encoder block diagram and show that its estimated throughput is proportional to the submatrix size of the parity check matrix, which guarantees a wide complexity- throughput tradeoff. Then, in order to facilitate the S-NB-IRA coding systems design, we present a computer search algorithm for the construction of good S-NB-IRA codes. The algorithm aims at optimizing the code graph topology along with selecting an appropriate non-binary elements in the parity check matrix. Numerical results show that the constructed S-NB-IRA codes significantly outperform the binary IRA and S-IRA codes, while their performance is similar to the best unstructured NB-LDPC codes.
  • WIRELESS COMMUNICATIONS
    High Capacity Spectrum Sensing Framework Based on Relay Cooperation
    Wu Xuanli, Han Xingling, Fabrice Labeau
    2016, 13(8): 117-126.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to reduce interference to primary users and provide better performance of detection probability and channel capacity in multi-user cooperative spectrum sensing networks, a high capacity spectrum sensing framework is proposed based on the analysis of amplification factors on the performance of detection probability and channel capacity. Thanks to the energy concentration property of chirp signals in the Fractional Fourier Transform (FrFT) domain, sinusoidal signal and different chirp signals are utilized for primary user and cognitive users, respectively. Hence, spectrum sensing and signal transmission can be performed simultaneously in our proposed framework. Simulation results show that compared with the previous relay-based framework, the modified cooperative spectrum sensing framework can improve the detection probability significantly, and the channel capacity can also be improved. Moreover, the amplification factor can be used to realize the tradeoff between detection probability and channel capacity in our proposed framework.
  • WIRELESS COMMUNICATIONS
    Lowering the Error Floor of ADMM Penalized Decoder for LDPC Codes
    Jiao Xiaopeng, Mu Jianjun
    2016, 13(8): 127-135.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Decoding by alternating direction method of multipliers (ADMM) is a promising linear programming decoder for low-density parity-check (LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of LDPC codes with ADMM penalized decoder. For the undetected errors that cannot be avoided at the decoder side, we modify the code structure slightly to eliminate low-weight code words. For the detected errors induced by small error-prone structures, we propose a post-processing method for the ADMM penalized decoder. Simulation results show that the error floor can be reduced significantly over three illustrated LDPC codes by the proposed two-step scheme.
  • WIRELESS COMMUNICATIONS
    A Novel Handoff Algorithm for Hierarchical Cellular Networks
    Xiaorong Zhu, Mengrong Li, Wenchao Xia, Hongbo Zhu
    2016, 13(8): 136-147.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In this paper, we propose a novel speed and service-sensitive handoff algorithm and analytical model for hierarchical cellular networks. First, we use the Gauss-Markov mobility model to predict the speeds of mobile stations, and divide mobile stations into three classes based on the predicted speeds: fast, medium-speed, and slow. Then, according to the mobility classification, network conditions, and service types, mobile stations will be handoff to the proper target networks prior to the deterioration of the currently operating channel. We further develop an analytical model to evaluate the performance of such a hierarchical system with different speed classes and service types. Simulations and analytical results show that the proposed handoff algorithm can significantly improve the network performance in terms of the handoff failure probability, unnecessary handoff probability, and network throughput, comparing with the traditional algorithms.
    • COMMUNICATION NETWORKS
  • COMMUNICATION NETWORKS
    Load-Aware Offloading Strategy in Two-Tier Heterogeneous Network
    Jianyuan Feng, Zhiyong Feng, Zhiqing Wei
    2016, 13(8): 148-158.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Although small cell offloading technology can alleviate the congestion in macrocell, aggressively offloading data traffic from macrocell to small cell can also degrade the performance of small cell due to the heavy load. Because of collision and backoff, the degradation is significant especially in network with contention-based channel access, and finally decreases throughput of the whole network. To find an optimal fraction of traffic to be offloaded in heterogeneous network, we combine Markov chain with the Poisson point process model to analyze contention-based throughput in irregularly deployment networks. Then we derive the close-form solution of the throughput and find that it is a function of the transmit power and density of base stations. Based on this, we propose the load-aware offloading strategies via power control and base station density adjustment. The numerical results verify our analysis and show a great performance gain compared with non-load-aware offloading.
  • COMMUNICATION NETWORKS
    Research on Link Duration for Mobile Multihop Communication Networks
    Danyang Qin*, Shuang Jia, Songxiang Yang, Erfu Wang, Qun Ding
    2016, 13(8): 159-168.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Mobile multihop communication network is an important branch of modern mobile communication system, and is an important technical support for ubiquitous communication. The random movement of the nodes makes the networking be more flexible, but the frequently changing topology will decrease the link duration between nodes significantly, which will increase the packets loss probability and affect the network communication performance. Aiming at the problem of declining link duration caused by nomadic characteristics in mobile multihop communication network, four link duration models for possible moving states are established based on different features in real networking process in this paper, which will provide reliable criterion for the optimal routing selection. Model analysis and simulation results show that the reliable route established by the proposed model will effectively extend the link duration, and can enhance the global stability of the mobile multihop information transmission, so as to provide new option to transmission reliability improvement for the mobile communication network.
  • COMMUNICATION NETWORKS
    Load Balancing-Based Routing Optimization Mechanism for Power Communication Networks
    Ningzhe Xing, Siya Xu, Sidong Zhang, Shaoyong Guo
    2016, 13(8): 169-176.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In power communication networks, it is a challenge to decrease the risk of different services efficiently to improve operation reliability. One of the important factor in reflecting communication risk is service route distribution. However, existing routing algorithms do not take into account the degree of importance of services, thereby leading to load unbalancing and increasing the risks of services and networks. A routing optimization mechanism based on load balancing for power communication networks is proposed to address the abovementioned problems. First, the mechanism constructs an evaluation model to evaluate the service and network risk degree using combination of devices, service load, and service characteristics. Second, service weights are determined with modified relative entropy TOPSIS method, and a balanced service routing determination algorithm is proposed. Results of simulations on practical network topology show that the mechanism can optimize the network risk degree and load balancing degree efficiently.
  • COMMUNICATION NETWORKS
    An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint
    Zeheng Yang, Yongan Guo
    2016, 13(8): 177-183.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature. VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth. Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources. The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.
    • OPTICAL COMMUNICATIONS
  • OPTICAL COMMUNICATIONS
    Modeling of Few-Mode Multi-Core Optical Fiber Channel Based on Non-Uniform Mode Field Distribution
    Hang Zhou, Bo Liu, Fu Wang, Dandan Song, Li Li, Xiangjun Xin, Qinghua Tian, Qi Zhang, Feng Tian
    2016, 13(8): 184-191.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In this paper, the influencing factors that affect few-mode and multi core optical fiber channel are analyzed in a comprehensive way. The theoretical modeling and computer simulation of the information channel are carried out and then the modeling scheme of few-mode multi-core optical fiber channel based on non-uniform mode field distribution is put forward. The proposed modeling scheme can not only exponentially increases the system capacity through few-mode multi-core optical fiber channel, but has better transmission performance compared to the channel of the same type to the uniform channel revealing from the simulation results.
  • OPTICAL COMMUNICATIONS
    Theoretical Analysis on Inter-Core Crosstalk Suppression Model for Multi-Core Fiber
    Jiajing Tu, Xueqin Xie, Keping Long
    2016, 13(8): 192-197.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Decreasing mode coupling coefficient (κ) is an effective approach to suppress the inter-core crosstalk. Therefore, we deploy a low index rod and rectangle trench in the middle of two neighboring cores to reduce κ so that the overlap of electric field distribution can be suppressed. We also propose approximate analytical solution (AAS) for κ of two crosstalk suppression models, which are two cores with one low index rod deployed in the middle and two cores with one low index rectangle trench deployed in the middle. We then do some modification for the results obtained by AAS and the modified results are proved to agree well with that obtained by finite element method (FEM). Therefore, we can use the modified AAS to get inter-core crosstalk for abovementioned two models quickly.
    • SERVICES AND APPLICATIONS
  • SERVICES AND APPLICATIONS
    A Human Body Posture Recognition Algorithm Based on BP Neural Network for Wireless Body Area Networks
    Fengye Hu, Lu Wang, Shanshan Wang, Xiaolan Liu, Gengxin He
    2016, 13(8): 198-208.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Human body posture recognition has attracted considerable attention in recent years in wireless body area networks (WBAN). In order to precisely recognize human body posture, many recognition algorithms have been proposed. However, the recognition rate is relatively low. In this paper, we apply back propagation (BP) neural network as a classifier to recognizing human body posture, where signals are collected from VG350 acceleration sensor and a posture signal collection system based on WBAN is designed. Human body signal vector magnitude (SVM) and tri-axial acceleration sensor data are used to describe the human body postures. We are able to recognize 4 postures: Walk, Run, Squat and Sit. Our posture recognition rate is up to 91.67%. Furthermore, we find an implied relationship between hidden layer neurons and the posture recognition rate. The proposed human body posture recognition algorithm lays the foundation for the subsequent applications.
  • SERVICES AND APPLICATIONS
    Analysis of Malware Application Based on Massive Network Traffic
    Xiaolin Gui, Jun Liu, Mucong Chi, Chenyu Li, Zhenming Lei
    2016, 13(8): 209-221.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Security and privacy issues are magnified by velocity, volume, and variety of big data. User’s privacy is an even more sensitive topic attracting most people’s attention. While XcodeGhost, a malware of iOS emerging in late 2015, leads to the privacy-leakage of a large number of users, only a few studies have examined XcodeGhost based on its source code. In this paper we describe observations by monitoring the network activities for more than 2.59 million iPhone users in a provincial area across 232 days. Our analysis reveals a number of interesting points. For example, we propose a decay model for the prevalence rate of XcodeGhost and we find that the ratio of the infected devices is more than 60%; that a lot of popular applications, such as Wechat, railway 12306, didi taxi, Youku video are also infected; and that the duration as well as the traffic volume of most XcodeGhost-related HTTP-requests is similar with usual HTTP-request which makes it difficult to be found. Besides, we propose a heuristic model based on fingerprint and its web-knowledge to identify the infected applications. The identifying result shows the efficiency of this model.
  • SERVICES AND APPLICATIONS
    An Angle Structure Descriptor for Image Retrieval
    Meng Zhao, Huaxiang Zhang, Lili Meng
    2016, 13(8): 222-230.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents an efficient image feature representation method, namely angle structure descriptor (ASD), which is built based on the angle structures of images. According to the diversity in directions, angle structures are defined in local blocks. Combining color information in HSV color space, we use angle structures to detect images. The internal correlations between neighboring pixels in angle structures are explored to form a feature vector. With angle structures as bridges, ASD extracts image features by integrating multiple information as a whole, such as color, texture, shape and spatial layout information. In addition, the proposed algorithm is efficient for image retrieval without any clustering implementation or model training. Experimental results demonstrate that ASD outperforms the other related algorithms.
  • SERVICES AND APPLICATIONS
    SSEM: Secure, Scalable and Efficient Multi-Owner Data Sharing in Clouds
    Shungan Zhou, Ruiying Du, Jing Chen, Hua Deng, Jian Shen, Huanguo Zhang
    2016, 13(8): 231-243.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Data sharing is a main application of cloud computing. Some existing solutions are proposed to provide flexible access control for outsourced data in the cloud. However, few attentions have been paid to group-oriented data sharing when multiple data owners want to share their private data for cooperative purposes. In this paper, we put forward a new paradigm, referred to as secure, scalable and efficient multi-owner (SSEM) data sharing in clouds. The SSEM integrates identity-based encryption and asymmetric group key agreement to enable group-oriented access control for data owners in a many-to-many sharing pattern. Moreover, with SSEM, users can join in or leave from the group conveniently with the privacy of both group data and user data. We proposed the key-ciphertext homomorphism technique to construct an SSEM scheme with short ciphertexts. The security analysis shows that our SSEM scheme achieves data security against unauthorized accesses and collusion attacks. Both theoretical and experimental results confirm that our proposed scheme takes users little costs to share and access outsourced data in a group manner.
  • SERVICES AND APPLICATIONS
    Predicting Stock Using Microblog Moods
    Danfeng Yan, Guang Zhou, Xuan Zhao, Yuan Tian, Fangchun Yang
    2016, 13(8): 244-257.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Some research work has showed that public mood and stock market price have some relations in some degree. Although it is difficult to clear the relation, the research about the relation between stock market price and public mood is interested by some scientists. This paper tries to find the relationship between Chinese stock market and Chinese local Microblog. First, C-POMS (Chinese Profile of Mood States) was proposed to analyze sentiment of Microblog feeds. Then Granger causality test confirmed the relation between C-POMS analysis and price series. SVM and Probabilistic Neural Network were used to make prediction, and experiments show that SVM is better to predict stock market movements than Probabilistic Neural Network. Experiments also indicate that adding certain dimension of C-POMS as the input data will improve the prediction accuracy to 66.667%. Two dimensions to input data leads to the highest accuracy of 71.429%, which is about 20% higher than using only history stock data as the input data. This paper also compared the proposed method with the ROSTEA scores, and concluded that only the proposed method brings more accurate predicts.