{"title":"Nature-Inspired Algorithms in Wireless Sensor Networks","authors":"A. Kaushik, S. Indu, D. Gupta","doi":"10.4018/978-1-5225-5852-1.CH010","DOIUrl":"https://doi.org/10.4018/978-1-5225-5852-1.CH010","url":null,"abstract":"Wireless sensor networks (WSNs) are becoming increasingly popular due to their applications in a wide variety of areas. Sensor nodes in a WSN are battery operated which outlines the need of some novel protocols that allows the limited sensor node battery to be used in an efficient way. The authors propose the use of nature-inspired algorithms to achieve energy efficient and long-lasting WSN. Multiple nature-inspired techniques like BBO, EBBO, and PSO are proposed in this chapter to minimize the energy consumption in a WSN. A large amount of data is generated from WSNs in the form of sensed information which encourage the use of big data tools in WSN domain. WSN and big data are closely connected since the large amount of data emerging from sensors can only be handled using big data tools. The authors describe how the big data can be framed as an optimization problem and the optimization problem can be effectively solved using nature-inspired algorithms.","PeriodicalId":163150,"journal":{"name":"Nature-Inspired Algorithms for Big Data Frameworks","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133976183","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}
{"title":"Graph and Neural Network-Based Intelligent Conversation System","authors":"Anuja Arora, Aman Srivastava, Shivam Bansal","doi":"10.4018/978-1-5225-5852-1.CH014","DOIUrl":"https://doi.org/10.4018/978-1-5225-5852-1.CH014","url":null,"abstract":"The conventional approach to build a chatbot system uses the sequence of complex algorithms and productivity of these systems depends on order and coherence of algorithms. This research work introduces and showcases a deep learning-based conversation system approach. The proposed approach is an intelligent conversation model approach which conceptually uses graph model and neural conversational model. The proposed deep learning-based conversation system uses neural conversational model over knowledge graph model in a hybrid manner. Graph-based model answers questions written in natural language using its intent in the knowledge graph and neural conversational model converses answer based on conversation content and conversation sequence order. NLP is used in graph model and neural conversational model uses natural language understanding and machine intelligence. The neural conversational model uses seq2seq framework as it requires less feature engineering and lacks domain knowledge. The results achieved through the authors' approach are competitive with solely used graph model results.","PeriodicalId":163150,"journal":{"name":"Nature-Inspired Algorithms for Big Data Frameworks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127965535","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}
{"title":"Nature Inspired Feature Selector for Effective Data Classification in Big Data Frameworks","authors":"A. Subramanian","doi":"10.4018/978-1-5225-5852-1.CH004","DOIUrl":"https://doi.org/10.4018/978-1-5225-5852-1.CH004","url":null,"abstract":"In high dimensional space finding clusters of data objects is challenging due to the curse of dimensionality. When the dimensionality increases, data in the irrelevant dimensions may produce much noise. And also, time complexity is the major issues in existing approach. In order to rectify these issues our proposed method made use of efficient feature subset selection in high dimensional data. We are considering the input dataset is the high dimensional micro array dataset. Initially, we have to select the optimal features so that our proposed technique employed Social Spider Optimization (SSO) algorithm. Here the traditional Social Spider Optimization is modified with the help of fruit fly optimization algorithm. Next the selected features are the input for the classifier. The classification is performed using optimized radial basis function based neural network (ORBFNN) technique to classify the micro array data as normal or abnormal data. The effectiveness of RBFNN is optimized by means of artificial bee colony algorithm (ABC).","PeriodicalId":163150,"journal":{"name":"Nature-Inspired Algorithms for Big Data Frameworks","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122287362","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}
{"title":"PSO-Based Antenna Pattern Synthesis","authors":"R. Biswas, Anurup Saha, S. Mitra, M. K. Naskar","doi":"10.4018/978-1-5225-5852-1.CH009","DOIUrl":"https://doi.org/10.4018/978-1-5225-5852-1.CH009","url":null,"abstract":"An antenna pattern synthesis scheme based on particle swarm optimization (PSO) technique is proposed. Synthesized patterns always contain narrower beamwidth and minimum side-lobes level reducing coverage areas towards the attackers in wireless networks. On such patterns, deep nulls are also steered at various interfering directions as to provide a second layer of protection. Using selective patterns at each point-to-point link, data privacy is ensured throughout entire route from source to sink. This approach is simple enough to be commensurate with flexible design methods on a real-time platform. Thus, an FSM (finite state machine) rule-based digital system model is further developed and tested on Xilinx Virtex4 FPGA (field programmable gate array) board. Its performance under harsh radio environmental conditions is also verified with several fixed-point simulations in terms of pattern synthesis accuracy and computational overheads. These results corroborate such system integration onto wireless infrastructures for the secured data communication services.","PeriodicalId":163150,"journal":{"name":"Nature-Inspired Algorithms for Big Data Frameworks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115811087","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}
{"title":"Subspace Clustering of High Dimensional Data Using Differential Evolution","authors":"Parul Agarwal, S. Mehta","doi":"10.4018/978-1-5225-5852-1.CH003","DOIUrl":"https://doi.org/10.4018/978-1-5225-5852-1.CH003","url":null,"abstract":"Subspace clustering approaches cluster high dimensional data in different subspaces. It means grouping the data with different relevant subsets of dimensions. This technique has become very effective as a distance measure becomes ineffective in a high dimensional space. This chapter presents a novel evolutionary approach to a bottom up subspace clustering SUBSPACE_DE which is scalable to high dimensional data. SUBSPACE_DE uses a self-adaptive DBSCAN algorithm to perform clustering in data instances of each attribute and maximal subspaces. Self-adaptive DBSCAN clustering algorithms accept input from differential evolution algorithms. The proposed SUBSPACE_DE algorithm is tested on 14 datasets, both real and synthetic. It is compared with 11 existing subspace clustering algorithms. Evaluation metrics such as F1_Measure and accuracy are used. Performance analysis of the proposed algorithms is considerably better on a success rate ratio ranking in both accuracy and F1_Measure. SUBSPACE_DE also has potential scalability on high dimensional datasets.","PeriodicalId":163150,"journal":{"name":"Nature-Inspired Algorithms for Big Data Frameworks","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129348142","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}
{"title":"Analysis of Multiplex Social Networks Using Nature-Inspired Algorithms","authors":"R. Mittal, M. Bhatia","doi":"10.4018/978-1-5225-5852-1.CH012","DOIUrl":"https://doi.org/10.4018/978-1-5225-5852-1.CH012","url":null,"abstract":"Many real-life social networks are having multiple types of interaction among entities; thus, this organization in networks builds a new scenario called multiplex networks. Community detection, centrality measurements are the trendy area of research in multiplex networks. Community detection means identifying the highly connected groups of nodes in the network. Centrality measures indicate evaluating the importance of a node in a given network. Here, the authors propose their methodologies to compute the eigenvector centrality of nodes to find out the most influential nodes in the network and present their study on finding communities from multiplex networks. They combine a few popular nature-inspired algorithms with multiplex social networks to do the above tasks. The authors' experiments provide a deep insight into the various properties of the multiplex network. They compare the proposed methodologies with several alternative methods and get encouraging and comparable results.","PeriodicalId":163150,"journal":{"name":"Nature-Inspired Algorithms for Big Data Frameworks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126428168","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}
{"title":"Aircraft Aerodynamic Parameter Estimation Using Intelligent Estimation Algorithms","authors":"A. Roy, N. Peyada","doi":"10.4018/978-1-5225-5852-1.CH011","DOIUrl":"https://doi.org/10.4018/978-1-5225-5852-1.CH011","url":null,"abstract":"Application of adaptive neuro fuzzy inference system (ANFIS)-based particle swarm optimization (PSO) algorithm to the problem of aerodynamic modeling and optimal parameter estimation for aircraft has been addressed in this chapter. The ANFIS-based PSO optimizer constitutes the aircraft model in restricted sense capable of predicting generalized force and moment coefficients employing measured motion and control variables only, without formal requirement of conventional variables or their time derivatives. It has been shown that such an approximate model can be used to extract equivalent stability and control derivatives of a rigid aircraft.","PeriodicalId":163150,"journal":{"name":"Nature-Inspired Algorithms for Big Data Frameworks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124539821","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}
{"title":"Big Data Analytics Using Apache Hive to Analyze Health Data","authors":"Pavani Konagala","doi":"10.4018/978-1-5225-5852-1.CH015","DOIUrl":"https://doi.org/10.4018/978-1-5225-5852-1.CH015","url":null,"abstract":"A large volume of data is stored electronically. It is very difficult to measure the total volume of that data. This large amount of data is coming from various sources such as stock exchange, which may generate terabytes of data every day, Facebook, which may take about one petabyte of storage, and internet archives, which may store up to two petabytes of data, etc. So, it is very difficult to manage that data using relational database management systems. With the massive data, reading and writing from and into the drive takes more time. So, the storage and analysis of this massive data has become a big problem. Big data gives the solution for these problems. It specifies the methods to store and analyze the large data sets. This chapter specifies a brief study of big data techniques to analyze these types of data. It includes a wide study of Hadoop characteristics, Hadoop architecture, advantages of big data and big data eco system. Further, this chapter includes a comprehensive study of Apache Hive for executing health-related data and deaths data of U.S. government.","PeriodicalId":163150,"journal":{"name":"Nature-Inspired Algorithms for Big Data Frameworks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122738345","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}
{"title":"Scheduling Data Intensive Scientific Workflows in Cloud Environment Using Nature Inspired Algorithms","authors":"S. Mehta, Parmeet Kaur","doi":"10.4018/978-1-5225-5852-1.CH008","DOIUrl":"https://doi.org/10.4018/978-1-5225-5852-1.CH008","url":null,"abstract":"Workflows are a commonly used model to describe applications consisting of computational tasks with data or control flow dependencies. They are used in domains of bioinformatics, astronomy, physics, etc., for data-driven scientific applications. Execution of data-intensive workflow applications in a reasonable amount of time demands a high-performance computing environment. Cloud computing is a way of purchasing computing resources on demand through virtualization technologies. It provides the infrastructure to build and run workflow applications, which is called ‘Infrastructure as a Service.' However, it is necessary to schedule workflows on cloud in a way that reduces the cost of leasing resources. Scheduling tasks on resources is a NP hard problem and using meta-heuristic algorithms is an obvious choice for the same. This chapter presents application of nature-inspired algorithms: particle swarm optimization, shuffled frog leaping algorithm and grey wolf optimization algorithm to the workflow scheduling problem on the cloud. Simulation results prove the efficacy of the suggested algorithms.","PeriodicalId":163150,"journal":{"name":"Nature-Inspired Algorithms for Big Data Frameworks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133537834","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}
{"title":"Genetic Algorithm Based Pre-Processing Strategy for High Dimensional Micro-Array Gene Classification","authors":"Deepak Singh, Dilip Singh Sisodia, Pradeep Singh","doi":"10.4018/978-1-5225-5852-1.CH002","DOIUrl":"https://doi.org/10.4018/978-1-5225-5852-1.CH002","url":null,"abstract":"Discretization is one of the popular pre-processing techniques that helps a learner overcome the difficulty in handling the wide range of continuous-valued attributes. The objective of this chapter is to explore the possibilities of performance improvement in large dimensional biomedical data with the alliance of machine learning and evolutionary algorithms to design effective healthcare systems. To accomplish the goal, the model targets the preprocessing phase and developed framework based on a Fisher Markov feature selection and evolutionary based binary discretization (EBD) for a microarray gene expression classification. Several experiments were conducted on publicly available microarray gene expression datasets, including colon tumors, and lung and prostate cancer. The performance is evaluated for accuracy and standard deviations, and is also compared with the other state-of-the-art techniques. The experimental results show that the EBD algorithm performs better when compared to other contemporary discretization techniques.","PeriodicalId":163150,"journal":{"name":"Nature-Inspired Algorithms for Big Data Frameworks","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125410328","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}