This book focuses on the development of wellness protocols for smart home monitoring, aiming to forecast the wellness of individuals living in ambient assisted living (AAL) environments. It describes in detail the design and implementation of heterogeneous wireless sensors and networks as applied to data mining and machine learning, which the protocols are based on. Further, it shows how these sensor and actuator nodes are deployed in the home environment, generating real-time data on object usage and other movements inside the home, and therefore demonstrates that the protocols have proven to offer a reliable, efficient, flexible, and economical solution for smart home systems. Documenting the approach from sensor to decision making and information generation, the book addresses various issues concerning interference mitigation, errors, security and large data handling. As such, it offers a valuable resource for researchers, students and practitioners interested in interdisciplinary studies at the intersection of wireless sensing processing, radio communication, the Internet of Things and machine learning, and in how they can be applied to smart home monitoring and assisted living environments.

Web mining has become a popular area of research, integrating the different research areas of data mining and the World Wide Web. According to the taxonomy of Web mining, there are three sub-fields of Web-mining research: Web usage mining, Web content mining and Web structure mining. These three research fields cover most content and activities on the Web. With the rapid growth of the World Wide Web, Web mining has become a hot topic and is now part of the mainstream of Web - search, such as Web information systems and Web intelligence. Among all of the possible applications in Web research, e-commerce and e-services have been iden- fied as important domains for Web-mining techniques. Web-mining techniques also play an important role in e-commerce and e-services, proving to be useful tools for understanding how e-commerce and e-service Web sites and services are used, e- bling the provision of better services for customers and users. Thus, this book will focus upon Web-mining applications in e-commerce and e-services. Some chapters in this book are extended from the papers that presented in WMEE 2008 (the 2nd International Workshop for E-commerce and E-services). In addition, we also sent invitations to researchers that are famous in this research area to contr- ute for this book. The chapters of this book are introduced as follows: In chapter 1, Peter I.

Advances in social science research methodologies and data analytic methods are changing the way research in information systems is conducted. New developments in statistical software technologies for data mining (DM) such as regression splines or decision tree induction can be used to assist researchers in systematic post-positivist theory testing and development. Established management science techniques like data envelopment analysis (DEA), and value focused thinking (VFT) can be used in combination with traditional statistical analysis and data mining techniques to more effectively explore behavioral questions in information systems research. As adoption and use of these research methods expand, there is growing need for a resource book to assist doctoral students and advanced researchers in understanding their potential to contribute to a broad range of research problems.

"Advances in Research Methods for Information Systems Research: Data Mining, Data Envelopment Analysis, Value Focused Thinking" focuses on bridging and unifying these three different methodologies in order to bring them together in a unified volume for the information systems community. This book serves as a resource that provides overviews on each method, as well as applications on how they can be employed to address IS research problems. Its goal is to help researchers in their continuous efforts to set the pace for having an appropriate interplay between behavioral research and design science.

This book provides a general and comprehensible overview of supervised descriptive pattern mining, considering classic algorithms and those based on heuristics. It provides some formal definitions and a general idea about patterns, pattern mining, the usefulness of patterns in the knowledge discovery process, as well as a brief summary on the tasks related to supervised descriptive pattern mining. It also includes a detailed description on the tasks usually grouped under the term supervised descriptive pattern mining: subgroups discovery, contrast sets and emerging patterns. Additionally, this book includes two tasks, class association rules and exceptional models, that are also considered within this field. A major feature of this book is that it provides a general overview (formal definitions and algorithms) of all the tasks included under the term supervised descriptive pattern mining. It considers the analysis of different algorithms either based on heuristics or based on exhaustive search methodologies for any of these tasks. This book also illustrates how important these techniques are in different fields, a set of real-world applications are described. Last but not least, some related tasks are also considered and analyzed. The final aim of this book is to provide a general review of the supervised descriptive pattern mining field, describing its tasks, its algorithms, its applications, and related tasks (those that share some common features). This book targets developers, engineers and computer scientists aiming to apply classic and heuristic-based algorithms to solve different kinds of pattern mining problems and apply them to real issues. Students and researchers working in this field, can use this comprehensive book (which includes its methods and tools) as a secondary textbook.

Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration; (ii) perform a multi-stage optimization of objects relative to different criteria; (iii) count the number of optimal objects; (iv) find the set of Pareto optimal points for bi-criteria optimization problems; and (v) to study relationships between two criteria. It considers various applications, including optimization of decision trees and decision rule systems as algorithms for problem solving, as ways for knowledge representation, and as classifiers; optimization of element partition trees for rectangular meshes, which are used in finite element methods for solving PDEs; and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths. The results presented are useful for researchers in combinatorial optimization, data mining, knowledge discovery, machine learning, and finite element methods, especially those working in rough set theory, test theory, logical analysis of data, and PDE solvers. This book can be used as the basis for graduate courses.

The development of Operations Research (OR) requires constant improvements, such as the integration of research results with business applications and innovative educational practice. The full deployment and commercial exploitation of goods and services generally need the construction of strong synergies between educational institutions and businesses. The IO2015 -XVII Congress of APDIO aims at strengthening the knowledge triangle in education, research and innovation, in order to maximize the contribution of OR for sustainable growth, the promoting of a knowledge-based economy, and the smart use of finite resources. The IO2015-XVII Congress of APDIO is a privileged meeting point for the promotion and dissemination of OR and related disciplines, through the exchange of ideas among teachers, researchers, students , and professionals with different background, but all sharing a common desire that is the development of OR.

This book includes extended versions of selected works presented at the 52nd Annual Convention of Computer Society of India (CSI 2017), held at Science City, Kolkata on 19-21 January 2018. It features a collection of chapters focusing on recent trends in computational intelligence, covering topics such as ANN, neuro-fuzzy based clustering, edge detection, data mining, mobile cloud computing, intelligent scheduling, processing and authentication. It also discusses societal applications of these methods. As such it is useful for students, researchers and industry professionals working in the area of computational intelligence.

Recently, there has been a rapid increase in interest regarding social network analysis in the data mining community. Cognitive radios are expected to play a major role in meeting this exploding traffic demand on social networks due to their ability to sense the environment, analyze outdoor parameters, and then make decisions for dynamic time, frequency, space, resource allocation, and management to improve the utilization of mining the social data. Cognitive Social Mining Applications in Data Analytics and Forensics is an essential reference source that reviews cognitive radio concepts and examines their applications to social mining using a machine learning approach so that an adaptive and intelligent mining is achieved. Featuring research on topics such as data mining, real-time ubiquitous social mining services, and cognitive computing, this book is ideally designed for social network analysts, researchers, academicians, and industry professionals.

This book features selected contributions in the areas of modeling, simulation, and optimization. The contributors discusses requirements in problem solving for modeling, simulation, and optimization. Modeling, simulation, and optimization have increased in demand in exponential ways and how potential solutions might be reached. They describe how new technologies in computing and engineering have reduced the dimension of data coverage worldwide, and how recent inventions in information and communication technology (ICT) have inched towards reducing the gaps and coverage of domains globally. The chapters cover how the digging of information in a large data and soft-computing techniques have contributed to a strength in prediction and analysis, for decision making in computer science, technology, management, social computing, green computing, and telecom. The book provides an insightful reference to the researchers in the fields of engineering and computer science. Researchers, academics, and professionals will benefit from this volume. Features selected expanded papers in modeling, simulation, and optimization from COMPSE 2016; Includes research into soft computing and its application in engineering and technology; Presents contributions from global experts in academia and industry in modeling, simulation, and optimization.

The technique of data fusion has been used extensively in information retrieval due to the complexity and diversity of tasks involved such as web and social networks, legal, enterprise, and many others. This book presents both a theoretical and empirical approach to data fusion. Several typical data fusion algorithms are discussed, analyzed and evaluated. A reader will find answers to the following questions, among others:

What are the key factors that affect the performance of data fusion algorithms significantly?

What conditions are favorable to data fusion algorithms?

CombSum and CombMNZ, which one is better? and why?

What is the rationale of using the linear combination method?

How can the best fusion option be found under any given circumstances?"

There are many invaluable books available on data mining theory and applications. However, in compiling a volume titled DATA MINING: Foundations and Intelligent Paradigms: Volume 1: Clustering, Association and Classification we wish to introduce some of the latest developments to a broad audience of both specialists and non-specialists in this field.

"

This volume introduces a series of different data-driven computational methods for analyzing group processes through didactic and tutorial-based examples. Group processes are of central importance to many sectors of society, including government, the military, health care, and corporations. Computational methods are better suited to handle (potentially huge) group process data than traditional methodologies because of their more flexible assumptions and capability to handle real-time trace data. Indeed, the use of methods under the name of computational social science have exploded over the years. However, attention has been focused on original research rather than pedagogy, leaving those interested in obtaining computational skills lacking a much needed resource. Although the methods here can be applied to wider areas of social science, they are specifically tailored to group process research. A number of data-driven methods adapted to group process research are demonstrated in this current volume. These include text mining, relational event modeling, social simulation, machine learning, social sequence analysis, and response surface analysis. In order to take advantage of these new opportunities, this book provides clear examples (e.g., providing code) of group processes in various contexts, setting guidelines and best practices for future work to build upon. This volume will be of great benefit to those willing to learn computational methods. These include academics like graduate students and faculty, multidisciplinary professionals and researchers working on organization and management science, and consultants for various types of organizations and groups.

This book reports on the latest advances on the theories, practices, standards and strategies that are related to the modern technology paradigms, the Mobile Cloud computing (MCC) and Big Data, as the pillars and their association with the emerging 5G mobile networks. The book includes 15 rigorously refereed chapters written by leading international researchers, providing the readers with technical and scientific information about various aspects of Big Data and Mobile Cloud Computing, from basic concepts to advanced findings, reporting the state-of-the-art on Big Data management. It demonstrates and discusses methods and practices to improve multi-source Big Data manipulation techniques, as well as the integration of resources availability through the 3As (Anywhere, Anything, Anytime) paradigm, using the 5G access technologies.

Privacy and security risks arising from the application of different data mining techniques to large institutional data repositories have been solely investigated by a new research domain, the so-called privacy preserving data mining. Association rule hiding is a new technique in data mining, which studies the problem of hiding sensitive association rules from within the data.

Association Rule Hiding for Data Mining addresses the problem of "hiding" sensitive association rules, and introduces a number of heuristic solutions. Exact solutions of increased time complexity that have been proposed recently are presented, as well as a number of computationally efficient (parallel) approaches that alleviate time complexity problems, along with a thorough discussion regarding closely related problems (inverse frequent item set mining, data reconstruction approaches, etc.). Unsolved problems, future directions and specific examples are provided throughout this book to help the reader study, assimilate and appreciate the important aspects of this challenging problem.

Association Rule Hiding for Data Mining is designed for researchers, professors and advanced-level students in computer science studying privacy preserving data mining, association rule mining, and data mining. This book is also suitable for practitioners working in this industry.

This is the first book treating the fields of supervised, semi-supervised and unsupervised machine learning collectively. The book presents both the theory and the algorithms for mining huge data sets using support vector machines (SVMs) in an iterative way. It demonstrates how kernel based SVMs can be used for dimensionality reduction and shows the similarities and differences between the two most popular unsupervised techniques.

This book discusses the development of a theory of info-statics as a sub-theory of the general theory of information. It describes the factors required to establish a definition of the concept of information that fixes the applicable boundaries of the phenomenon of information, its linguistic structure and scientific applications. The book establishes the definitional foundations of information and how the concepts of uncertainty, data, fact, evidence and evidential things are sequential derivatives of information as the primary category, which is a property of matter and energy. The sub-definitions are extended to include the concepts of possibility, probability, expectation, anticipation, surprise, discounting, forecasting, prediction and the nature of past-present-future information structures. It shows that the factors required to define the concept of information are those that allow differences and similarities to be established among universal objects over the ontological and epistemological spaces in terms of varieties and identities. These factors are characteristic and signal dispositions on the basis of which general definitional foundations are developed to construct the general information definition (GID). The book then demonstrates that this definition is applicable to all types of information over the ontological and epistemological spaces. It also defines the concepts of uncertainty, data, fact, evidence and knowledge based on the GID. Lastly, it uses set-theoretic analytics to enhance the definitional foundations, and shows the value of the theory of info-statics to establish varieties and categorial varieties at every point of time and thus initializes the construct of the theory of info-dynamics.

This volume comprises eight well-versed contributed chapters devoted to report the latest findings on the intelligent approaches to multimedia data analysis. Multimedia data is a combination of different discrete and continuous content forms like text, audio, images, videos, animations and interactional data. At least a single continuous media in the transmitted information generates multimedia information. Due to these different types of varieties, multimedia data present varied degrees of uncertainties and imprecision, which cannot be easy to deal by the conventional computing paradigm. Soft computing technologies are quite efficient to handle the imprecision and uncertainty of the multimedia data and they are flexible enough to process the real-world information. Proper analysis of multimedia data finds wide applications in medical diagnosis, video surveillance, text annotation etc. This volume is intended to be used as a reference by undergraduate and post graduate students of the disciplines of computer science, electronics and telecommunication, information science and electrical engineering. THE SERIES: FRONTIERS IN COMPUTATIONAL INTELLIGENCE The series Frontiers In Computational Intelligence is envisioned to provide comprehensive coverage and understanding of cutting edge research in computational intelligence. It intends to augment the scholarly discourse on all topics relating to the advances in artifi cial life and machine learning in the form of metaheuristics, approximate reasoning, and robotics. Latest research fi ndings are coupled with applications to varied domains of engineering and computer sciences. This field is steadily growing especially with the advent of novel machine learning algorithms being applied to different domains of engineering and technology. The series brings together leading researchers that intend to continue to advance the fi eld and create a broad knowledge about the most recent state of the art.

The objective of this monograph is to improve the performance of the sentiment analysis model by incorporating the semantic, syntactic and common-sense knowledge. This book proposes a novel semantic concept extraction approach that uses dependency relations between words to extract the features from the text. Proposed approach combines the semantic and common-sense knowledge for the better understanding of the text. In addition, the book aims to extract prominent features from the unstructured text by eliminating the noisy, irrelevant and redundant features. Readers will also discover a proposed method for efficient dimensionality reduction to alleviate the data sparseness problem being faced by machine learning model. Authors pay attention to the four main findings of the book : -Performance of the sentiment analysis can be improved by reducing the redundancy among the features. Experimental results show that minimum Redundancy Maximum Relevance (mRMR) feature selection technique improves the performance of the sentiment analysis by eliminating the redundant features. - Boolean Multinomial Naive Bayes (BMNB) machine learning algorithm with mRMR feature selection technique performs better than Support Vector Machine (SVM) classifier for sentiment analysis. - The problem of data sparseness is alleviated by semantic clustering of features, which in turn improves the performance of the sentiment analysis. - Semantic relations among the words in the text have useful cues for sentiment analysis. Common-sense knowledge in form of ConceptNet ontology acquires knowledge, which provides a better understanding of the text that improves the performance of the sentiment analysis.

Abstraction is a fundamental mechanism underlying both human and artificial perception, representation of knowledge, reasoning and learning. This mechanism plays a crucial role in many disciplines, notably Computer Programming, Natural and Artificial Vision, Complex Systems, Artificial Intelligence and Machine Learning, Art, and Cognitive Sciences. This book first provides the reader with an overview of the notions of abstraction proposed in various disciplines by comparing both commonalities and differences. After discussing the characterizing properties of abstraction, a formal model, the KRA model, is presented to capture them. This model makes the notion of abstraction easily applicable by means of the introduction of a set of abstraction operators and abstraction patterns, reusable across different domains and applications. It is the impact of abstraction in Artificial Intelligence, Complex Systems and Machine Learning which creates the core of the book. A general framework, based on the KRA model, is presented, and its pragmatic power is illustrated with three case studies: Model-based diagnosis, Cartographic Generalization, and learning Hierarchical Hidden Markov Models.

Social media sites are constantly evolving with huge amounts of scattered data or big data, which makes it difficult for researchers to trace the information flow. It is a daunting task to extract a useful piece of information from the vast unstructured big data; the disorganized structure of social media contains data in various forms such as text and videos as well as huge real-time data on which traditional analytical methods like statistical approaches fail miserably. Due to this, there is a need for efficient data mining techniques that can overcome the shortcomings of the traditional approaches. Data Mining Approaches for Big Data and Sentiment Analysis in Social Media encourages researchers to explore the key concepts of data mining, such as how they can be utilized on online social media platforms, and provides advances on data mining for big data and sentiment analysis in online social media, as well as future research directions. Covering a range of concepts from machine learning methods to data mining for big data analytics, this book is ideal for graduate students, academicians, faculty members, scientists, researchers, data analysts, social media analysts, managers, and software developers who are seeking to learn and carry out research in the area of data mining for big data and sentiment.

This book reports on the development and validation of a generic defeasible logic programming framework for carrying out argumentative reasoning in Semantic Web applications (GF@SWA). The proposed methodology is unique in providing a solution for representing incomplete and/or contradictory information coming from different sources, and reasoning with it. GF@SWA is able to represent this type of information, perform argumentation-driven hybrid reasoning to resolve conflicts, and generate graphical representations of the integrated information, thus assisting decision makers in decision making processes. GF@SWA represents the first argumentative reasoning engine for carrying out automated reasoning in the Semantic Web context and is expected to have a significant impact on future business applications. The book provides the readers with a detailed and clear exposition of different argumentation-based reasoning techniques, and of their importance and use in Semantic Web applications. It addresses both academics and professionals, and will be of primary interest to researchers, students and practitioners in the area of Web-based intelligent decision support systems and their application in various domains.

The book covers tools in the study of online social networks such as machine learning techniques, clustering, and deep learning. A variety of theoretical aspects, application domains, and case studies for analyzing social network data are covered. The aim is to provide new perspectives on utilizing machine learning and related scientific methods and techniques for social network analysis. Machine Learning Techniques for Online Social Networks will appeal to researchers and students in these fields.

Mining of Data with Complex Structures:

- Clarifies the type and nature of data with complex structure including sequences, trees and graphs

- Provides a detailed background of the state-of-the-art of sequence mining, tree mining and graph mining.

-Defines the essential aspects of the tree mining problem: subtree types, support definitions, constraints.

- Outlines the implementation issues one needs to consider when developing tree mining algorithms (enumeration strategies, data structures, etc.)

- Details the Tree Model Guided (TMG) approach for tree mining and provides the mathematical model for the worst case estimate of complexity of mining ordered induced and embedded subtrees.

- Explains the mechanism of the TMG framework for mining ordered/unordered induced/embedded and distance-constrained embedded subtrees.

- Provides a detailed comparison of the different tree mining approaches highlighting the characteristics and benefits of each approach.

- Overviews the implications and potential applications of tree mining in general knowledge management related tasks, and uses Web, health and bioinformatics related applications as case studies.

- Details the extension of the TMG framework for sequence mining

- Provides an overview of the future research direction with respect to technical extensions and application areas

The primary audience is 3rd year, 4th year undergraduate students, Masters and PhD students and academics. The book can be used for both teaching and research. The secondary audiences are practitioners in industry, business, commerce, government and consortiums, alliances and partnerships to learn how to introduce and efficiently make use of the techniques for mining of data with complex structures into their applications. The scope of the book is both theoretical and practical and as such it will reach a broad market both within academia and industry. In addition, its subject matter is a rapidly emerging field that is critical for efficient analysis of knowledge stored in various domains."

This book presents new approaches that advance research in all aspects of agent-based models, technologies, simulations and implementations for data intensive applications. The nine chapters contain a review of recent cross-disciplinary approaches in cloud environments and multi-agent systems, and important formulations of data intensive problems in distributed computational environments together with the presentation of new agent-based tools to handle those problems and Big Data in general. This volume can serve as a reference for students, researchers and industry practitioners working in or interested in joining interdisciplinary work in the areas of data intensive computing and Big Data systems using emergent large-scale distributed computing paradigms. It will also allow newcomers to grasp key concepts and potential solutions on advanced topics of theory, models, technologies, system architectures and implementation of applications in Multi-Agent systems and data intensive computing.