Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538353
B. Ravi, Jaisingh Thangaraj, Shrinivas Petale
Route selection and management are one of the key issues in Vehicular Ad-hoc Networks (VANETs). The vehicular networks are envisioned of intelligent transport systems (ITS) by providing safety and services on the highway. The medium access control is based on IEEE 802.11p standard and has been created for Vehicle to Infrastructure (V2I) and Vehicle to Vehicle (V2V) communications. But in VANET, issues like route request, route reply, route discovery, and maintenance are not addressed properly. In this paper, we have proposed the routing protocol to deal with routing issues. We investigated the impact of multi-hop routing in the queuing system (M/G/c/c) along with the focus of the performance of VANETs on the basis of the probability of waiting for the queue, system utilization, mean throughput and blocking probability between V2V communications.
{"title":"Stochastic Network Optimization of Data Dissemination for Multi-hop Routing in VANETs","authors":"B. Ravi, Jaisingh Thangaraj, Shrinivas Petale","doi":"10.1109/WISPNET.2018.8538353","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538353","url":null,"abstract":"Route selection and management are one of the key issues in Vehicular Ad-hoc Networks (VANETs). The vehicular networks are envisioned of intelligent transport systems (ITS) by providing safety and services on the highway. The medium access control is based on IEEE 802.11p standard and has been created for Vehicle to Infrastructure (V2I) and Vehicle to Vehicle (V2V) communications. But in VANET, issues like route request, route reply, route discovery, and maintenance are not addressed properly. In this paper, we have proposed the routing protocol to deal with routing issues. We investigated the impact of multi-hop routing in the queuing system (M/G/c/c) along with the focus of the performance of VANETs on the basis of the probability of waiting for the queue, system utilization, mean throughput and blocking probability between V2V communications.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"66 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85822175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538527
M. Karthik, Mirishkar Sai Ganesh, B. Patnaik
This contribution presents an efficient method of speaker diarization that employs bayesian information criterion for speaker embeddings. In contrast to the traditional approaches the speaker segmentation is done using manually spectral features. The proposed method is capable enough to segment audio recording of a broadcast news by $i$-vectors as well as GMM speaker model and the conventional GMM based agglomerative for clustering the data. An unsupervised Voice Active Detector (VAD) has been developed, so that it could distinguish between speech frame and non-speech frame such that the non-speech frames can be discarded. The results of our proposed method showed significantly outperformed with the benchmark methods and reduced the diarization error margin by 14%.
{"title":"Robust Speaker Diarization for News Broadcast","authors":"M. Karthik, Mirishkar Sai Ganesh, B. Patnaik","doi":"10.1109/WISPNET.2018.8538527","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538527","url":null,"abstract":"This contribution presents an efficient method of speaker diarization that employs bayesian information criterion for speaker embeddings. In contrast to the traditional approaches the speaker segmentation is done using manually spectral features. The proposed method is capable enough to segment audio recording of a broadcast news by $i$-vectors as well as GMM speaker model and the conventional GMM based agglomerative for clustering the data. An unsupervised Voice Active Detector (VAD) has been developed, so that it could distinguish between speech frame and non-speech frame such that the non-speech frames can be discarded. The results of our proposed method showed significantly outperformed with the benchmark methods and reduced the diarization error margin by 14%.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"11 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86283107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538754
Soumit Chowdhury, Arkadip Ray, R. Mukherjee, N. Ghoshal
The work promotes reliable dynamical validations for transmitted e-documents using session wise randomly hidden secret multi-signatures. Client triggers this protocol by deriving the random circular sequencing of such invisible signatures onto the cover image e-document. Additional security and authenticity criteria met with dynamical orientations of hidden signature bits on concern sub block pixel bytes of the cover image. Vitally both these dynamical fabrications are fully governed by the respective mathematical operations executed on client-server based mutual secret key and session random challenge. Hence, same dynamical authentications for those valid copyright signatures can also be complied at the server end. Apart from that multi-copy signature dispersing with hosting of each individual signature copy on each separate regions of the cover image serves better authenticity and robustness under attacks. Further region wise varied transforms on sub image blocks with variable threshold range driven sign bit encoding on separate transformed pixel bytes of such sub blocks ensures excellent robustness and recovery of signatures. Finally, exhaustive experimental results also confirmed strong superiority of this scheme over existing works with significant enhancements on standard evaluation parameters. Overall, this protocol reflects better trusted authentication, confidentiality and non-repudiation for wireless digital transmissions in contrast to the current ideas.
{"title":"Dynamical Digital Authentication for Wireless Domain With Randomized Dispersing of Multiple Secret Signatures","authors":"Soumit Chowdhury, Arkadip Ray, R. Mukherjee, N. Ghoshal","doi":"10.1109/WISPNET.2018.8538754","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538754","url":null,"abstract":"The work promotes reliable dynamical validations for transmitted e-documents using session wise randomly hidden secret multi-signatures. Client triggers this protocol by deriving the random circular sequencing of such invisible signatures onto the cover image e-document. Additional security and authenticity criteria met with dynamical orientations of hidden signature bits on concern sub block pixel bytes of the cover image. Vitally both these dynamical fabrications are fully governed by the respective mathematical operations executed on client-server based mutual secret key and session random challenge. Hence, same dynamical authentications for those valid copyright signatures can also be complied at the server end. Apart from that multi-copy signature dispersing with hosting of each individual signature copy on each separate regions of the cover image serves better authenticity and robustness under attacks. Further region wise varied transforms on sub image blocks with variable threshold range driven sign bit encoding on separate transformed pixel bytes of such sub blocks ensures excellent robustness and recovery of signatures. Finally, exhaustive experimental results also confirmed strong superiority of this scheme over existing works with significant enhancements on standard evaluation parameters. Overall, this protocol reflects better trusted authentication, confidentiality and non-repudiation for wireless digital transmissions in contrast to the current ideas.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"150 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79848899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538507
Suyalatu Dong, Yong-chang Huang
Based on the characteristics of rumor spreading in online social networks, this paper proposes a new rumor spreading model. This is a SIS rumor spreading model in online social networks that combines the transmission dynamics and population dynamics so that the impact of changing number of online social network users and user activity is considered. We numerically simulate the rumor spreading process. The results of numerical simulation show that the improved SIS model can successfully characterize the rumor spreading behavior in online social networks. We also give the effective strategies of curbing the rumor spreading in online social networks.
{"title":"SIS Rumor Spreading Model With Population Dynamics in Online Social Networks","authors":"Suyalatu Dong, Yong-chang Huang","doi":"10.1109/WISPNET.2018.8538507","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538507","url":null,"abstract":"Based on the characteristics of rumor spreading in online social networks, this paper proposes a new rumor spreading model. This is a SIS rumor spreading model in online social networks that combines the transmission dynamics and population dynamics so that the impact of changing number of online social network users and user activity is considered. We numerically simulate the rumor spreading process. The results of numerical simulation show that the improved SIS model can successfully characterize the rumor spreading behavior in online social networks. We also give the effective strategies of curbing the rumor spreading in online social networks.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79947974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538728
Arti Kumari, R. K. Badhai, P. Suraj
A compact ultra-wideband antenna with tapered feeding technique is presented in this paper. The antenna design has a dimension of 25 × 30 × 1.6 mm3. This antenna covers a bandwidth of 1.2 to 12 GHz. The proposed antenna can be used for the multiband application and it covers the UWB frequency ranges. A single parasitic microstrip resonator is introduced on the back of the resonator which increases the bandwidth of the proposed antenna. The partial ground with inverted L shaped sleeve is used for better impedance matching and wide bandwidth.
{"title":"A Compact Polygon Shape Ultra Wideband Antenna For Portable Devices","authors":"Arti Kumari, R. K. Badhai, P. Suraj","doi":"10.1109/WISPNET.2018.8538728","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538728","url":null,"abstract":"A compact ultra-wideband antenna with tapered feeding technique is presented in this paper. The antenna design has a dimension of 25 × 30 × 1.6 mm3. This antenna covers a bandwidth of 1.2 to 12 GHz. The proposed antenna can be used for the multiband application and it covers the UWB frequency ranges. A single parasitic microstrip resonator is introduced on the back of the resonator which increases the bandwidth of the proposed antenna. The partial ground with inverted L shaped sleeve is used for better impedance matching and wide bandwidth.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"7 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79069689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538678
D. K. Sandou, N. Jothy, K. Jayanthi
Vehicular Ad hoc Network (VANETs) allows the vehicles on the roads to form a self-organized network and is blooming up in a exotic way to support intelligent transportation services. In VANETs, the vehicles are the nodes and hence move at very high speed leading to frequent changes in topology resulting in loss of data that causes failure in data reliability. Consequently ensuring security and routing in VANET remains to be a highly challenging and complex task to design. The existing protocol using SHA, suffers from exorbitant delay because of the large key size. To overcome this limitation, a lightweight authentication protocol using key agreement protocol for VANETs, which uses public key encryption scheme and Opportunistic Adaptive neighbour Selection–Vehicle Localisation (OANS- VL) protocol is proposed in this paper. It provides high security, less network delay and better packet delivery ratio compared to the existing protocol. The test bed scenario is implemented using NS2 tool for simulation analysis and the same has been analyzed to obtain the performance metrics.
车辆自组织网络(Vehicular Ad hoc Network, VANETs)允许道路上的车辆形成一个自组织网络，并以一种奇特的方式支持智能交通服务。在VANETs中，车辆是节点，因此以非常高的速度移动，导致拓扑结构频繁变化，导致数据丢失，从而导致数据可靠性失效。因此，确保VANET的安全性和路由仍然是一项极具挑战性和复杂的设计任务。使用SHA的现有协议由于密钥大小过大而存在过高的延迟。为了克服这一限制，本文提出了一种基于密钥协议的VANETs轻量级认证协议，该协议采用公钥加密方案和机会自适应邻居选择-车辆定位(OANS- VL)协议。与现有协议相比，它具有更高的安全性，更小的网络延迟和更好的数据包传输率。利用NS2工具实现了试验台场景的仿真分析，并对其进行了分析，得到了性能指标。
{"title":"Secured Routing in VANETs Using Lightweight Authentication and Key Agreement Protocol","authors":"D. K. Sandou, N. Jothy, K. Jayanthi","doi":"10.1109/WISPNET.2018.8538678","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538678","url":null,"abstract":"Vehicular Ad hoc Network (VANETs) allows the vehicles on the roads to form a self-organized network and is blooming up in a exotic way to support intelligent transportation services. In VANETs, the vehicles are the nodes and hence move at very high speed leading to frequent changes in topology resulting in loss of data that causes failure in data reliability. Consequently ensuring security and routing in VANET remains to be a highly challenging and complex task to design. The existing protocol using SHA, suffers from exorbitant delay because of the large key size. To overcome this limitation, a lightweight authentication protocol using key agreement protocol for VANETs, which uses public key encryption scheme and Opportunistic Adaptive neighbour Selection–Vehicle Localisation (OANS- VL) protocol is proposed in this paper. It provides high security, less network delay and better packet delivery ratio compared to the existing protocol. The test bed scenario is implemented using NS2 tool for simulation analysis and the same has been analyzed to obtain the performance metrics.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"63 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79682253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538596
Xue Lin, Xiuyang Zhao, Dongmei Niu
Graph matching is a fundamental NP-problem in computer vision and pattern recognition. The computing of compatibility is a key problem in graph matching. In order to overcome the limitation of Euclidean distance when computing the compatibility, we introduce the weighted local and global topology structure information as a second order compatibility term. We have tested our method on a group of synthetic graphs, the CMU house sequence and the real images. Experimental results demonstrate the superior performance of our weighted compatibility based on the local and global topology structure information as compared with the traditional method based on the Euclidean distance.
{"title":"An Improved Compatibility Based on Weighted Local and Global Information for Graph Matching","authors":"Xue Lin, Xiuyang Zhao, Dongmei Niu","doi":"10.1109/WISPNET.2018.8538596","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538596","url":null,"abstract":"Graph matching is a fundamental NP-problem in computer vision and pattern recognition. The computing of compatibility is a key problem in graph matching. In order to overcome the limitation of Euclidean distance when computing the compatibility, we introduce the weighted local and global topology structure information as a second order compatibility term. We have tested our method on a group of synthetic graphs, the CMU house sequence and the real images. Experimental results demonstrate the superior performance of our weighted compatibility based on the local and global topology structure information as compared with the traditional method based on the Euclidean distance.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"53 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80065995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538709
L. Sane, I. Dioum, K. Tall, M. M. Khouma, K. Diallo, S. M. Farssi
This paper presents a full duplex and reconfigurable pattern system antenna design for 5G wireless communications systems. The proposed system is a MIMO 2 $times$ 2 antenna operating at the central frequency 2.622 GHz of the LTE2500 band. A quadrature 3 dB coupler is used to achieve configurability. The proposed coupler allows also to have a high isolation of 58 dB needed for Full Duplex communication. Four patterns configurations are obtained with four combinations. The proposed antenna has 65 MHz bandwidth, 80% efficiency and achieve 4.18 dB of gain.
{"title":"Full Duplex and Pattern Reconfigurable System Antenna Design for 5G Wireless Communications Systems Using a Quadrature 3 dB Coupler","authors":"L. Sane, I. Dioum, K. Tall, M. M. Khouma, K. Diallo, S. M. Farssi","doi":"10.1109/WISPNET.2018.8538709","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538709","url":null,"abstract":"This paper presents a full duplex and reconfigurable pattern system antenna design for 5G wireless communications systems. The proposed system is a MIMO 2 $times$ 2 antenna operating at the central frequency 2.622 GHz of the LTE2500 band. A quadrature 3 dB coupler is used to achieve configurability. The proposed coupler allows also to have a high isolation of 58 dB needed for Full Duplex communication. Four patterns configurations are obtained with four combinations. The proposed antenna has 65 MHz bandwidth, 80% efficiency and achieve 4.18 dB of gain.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"22 1","pages":"1-3"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81605523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538588
D. Sudarsan, Parvathy Vijayakumar, Sharon Biju, Soniya Sanu, Sreelakshmi K. Shivadas
The palm leaf manuscripts are an abundant source of knowledge, tradition and ancient culture. These scriptures are an unavoidable part of our rich culture and have to be preserved in the best possible way. But the information extraction from palm leaf is a tedious task due to various challenges such as noise enormous character set and the difficulty in reading and understanding the ancient Malayalam script. Handwriting recognition in Malayalam is a challenging and emerging area of pattern recognition. Our proposed system aims at extracting information from old palm leaves (thaaliyola) and translating the ancient Malayalam scripts to their current version based on contrast-based adaptive binarization and convolutional neural networks which simplifies the entire process by avoiding feature extraction. The proposed method is different from the conventional methods which require handcrafted features that are used for classification. Initially, the system is trained with a set of characters. This can be expanded to work with the remaining characters as well. The input will be images of Malayalam palmleaf manuscript and the expected output is their translated script. Our system aims to transform these scripts so as to make it accessible and useful to the current generation. The system will be trained using a number of samples to build a convolutional neural network using which the characters will be recognized.
{"title":"Digitalization of Malayalam Palmleaf Manuscripts Based on Contrast-Based Adaptive Binarization and Convolutional Neural Networks","authors":"D. Sudarsan, Parvathy Vijayakumar, Sharon Biju, Soniya Sanu, Sreelakshmi K. Shivadas","doi":"10.1109/WISPNET.2018.8538588","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538588","url":null,"abstract":"The palm leaf manuscripts are an abundant source of knowledge, tradition and ancient culture. These scriptures are an unavoidable part of our rich culture and have to be preserved in the best possible way. But the information extraction from palm leaf is a tedious task due to various challenges such as noise enormous character set and the difficulty in reading and understanding the ancient Malayalam script. Handwriting recognition in Malayalam is a challenging and emerging area of pattern recognition. Our proposed system aims at extracting information from old palm leaves (thaaliyola) and translating the ancient Malayalam scripts to their current version based on contrast-based adaptive binarization and convolutional neural networks which simplifies the entire process by avoiding feature extraction. The proposed method is different from the conventional methods which require handcrafted features that are used for classification. Initially, the system is trained with a set of characters. This can be expanded to work with the remaining characters as well. The input will be images of Malayalam palmleaf manuscript and the expected output is their translated script. Our system aims to transform these scripts so as to make it accessible and useful to the current generation. The system will be trained using a number of samples to build a convolutional neural network using which the characters will be recognized.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"46 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85323756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538586
Yun-peng Wu, Jia-min Mao, Weifeng Li
AdaBoost is a machine learning algorithm based on boosting ideas. AdaBoost is the abbreviation of adaptive boosting, which is an algorithm for weak classifier to assemble as a strong classifier algorithm. There is a lot of data noise in finance market. In order to identify underlying trends in futures market, we propose to use standardized technical indicators to forecast rise or fall and assemble these indicators by AdaBoost algorithm innovatively. We use AdaBoost algorithm to optimize the weight of technical indicators and a good predication result is received. This research shows that these weak classifier can filter data noise in futures market effectively and exhibits that machine learning can get a better analysis result based on the conventional finance engineering analysis methods. This research is meaningful for individual investors.
{"title":"Predication of Futures Market by Using Boosting Algorithm","authors":"Yun-peng Wu, Jia-min Mao, Weifeng Li","doi":"10.1109/WISPNET.2018.8538586","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538586","url":null,"abstract":"AdaBoost is a machine learning algorithm based on boosting ideas. AdaBoost is the abbreviation of adaptive boosting, which is an algorithm for weak classifier to assemble as a strong classifier algorithm. There is a lot of data noise in finance market. In order to identify underlying trends in futures market, we propose to use standardized technical indicators to forecast rise or fall and assemble these indicators by AdaBoost algorithm innovatively. We use AdaBoost algorithm to optimize the weight of technical indicators and a good predication result is received. This research shows that these weak classifier can filter data noise in futures market effectively and exhibits that machine learning can get a better analysis result based on the conventional finance engineering analysis methods. This research is meaningful for individual investors.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"103 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88415947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：