Search

This is the first technical book that considers tests as public tools and examines how to engineer and process test data, extract the structure within the data to be visualized, and thereby make test results useful for students, teachers, and the society. The author does not differentiate test data analysis from data engineering and information visualization. This monograph introduces the following methods of engineering or processing test data, including the latest machine learning techniques: classical test theory (CTT), item response theory (IRT), latent class analysis (LCA), latent rank analysis (LRA), biclustering (co-clustering), and Bayesian network model (BNM). CTT and IRT are methods for analyzing test data and evaluating students'abilities on a continuous scale. LCA and LRA assess examinees by classifying them into nominal and ordinal clusters, respectively, where the adequate number of clusters is estimated from the data. Biclustering classifies examinees into groups (latent clusters) while classifying items into fields (factors). Particularly, the infinite relational model discussed in this book is a biclustering method feasible under the condition that neither the number of groups nor the number of fields is known beforehand. Additionally, the local dependence LRA, local dependence biclustering, and bicluster network model are methods that search and visualize inter-item (or inter-field) network structure using the mechanism of BNM. As this book offers a new perspective on test data analysis methods, it is certain to widen readers'perspective on test data analysis.

With the development of Big Data platforms for managing massive amount of data and wide availability of tools for processing these data, the biggest limitation is the lack of trained experts who are qualified to process and interpret the results. This textbook is intended for graduate students and experts using methods of cluster analysis and applications in various fields.Suitable for an introductory course on cluster analysis or data mining, with an in-depth mathematical treatment that includes discussions on different measures, primitives (points, lines, etc.) and optimization-based clustering methods, Cluster Analysis and Applications also includes coverage of deep learning based clustering methods.With clear explanations of ideas and precise definitions of concepts, accompanied by numerous examples and exercises together with Mathematica programs and modules, Cluster Analysis and Applications may be used by students and researchers in various disciplines, working in data analysis or data science.

This book introduces the basic concepts of fuzzy collaborative forecasting and clustering, including its methodology, system architecture, and applications. It demonstrates how dealing with disparate data sources is becoming more and more popular due to the increasing spread of internet applications. The book proposes the concepts of collaborative computing intelligence and collaborative fuzzy modeling, and establishes several so-called fuzzy collaborative systems. It shows how technical constraints, security issues, and privacy considerations often limit access to some sources. This book is a valuable source of information for postgraduates, researchers and fuzzy control system developers, as it presents a very effective fuzzy approach that can deal with disparate data sources, big data, and multiple expert decision making.

This book highlights the state of the art and recent advances in Big Data clustering methods and their innovative applications in contemporary AI-driven systems. The book chapters discuss Deep Learning for Clustering, Blockchain data clustering, Cybersecurity applications such as insider threat detection, scalable distributed clustering methods for massive volumes of data; clustering Big Data Streams such as streams generated by the confluence of Internet of Things, digital and mobile health, human-robot interaction, and social networks; Spark-based Big Data clustering using Particle Swarm Optimization; and Tensor-based clustering for Web graphs, sensor streams, and social networks. The chapters in the book include a balanced coverage of big data clustering theory, methods, tools, frameworks, applications, representation, visualization, and clustering validation.

This book provides the reader with a basic understanding of the formal concepts of the cluster, clustering, partition, cluster analysis etc. The book explains feature-based, graph-based and spectral clustering methods and discusses their formal similarities and differences. Understanding the related formal concepts is particularly vital in the epoch of Big Data; due to the volume and characteristics of the data, it is no longer feasible to predominantly rely on merely viewing the data when facing a clustering problem. Usually clustering involves choosing similar objects and grouping them together. To facilitate the choice of similarity measures for complex and big data, various measures of object similarity, based on quantitative (like numerical measurement results) and qualitative features (like text), as well as combinations of the two, are described, as well as graph-based similarity measures for (hyper) linked objects and measures for multilayered graphs. Numerous variants demonstrating how such similarity measures can be exploited when defining clustering cost functions are also presented. In addition, the book provides an overview of approaches to handling large collections of objects in a reasonable time. In particular, it addresses grid-based methods, sampling methods, parallelization via Map-Reduce, usage of tree-structures, random projections and various heuristic approaches, especially those used for community detection.

I am very happy to have this opportunity to present the work of Boris Mirkin, a distinguished Russian scholar in the areas of data analysis and decision making methodologies. The monograph is devoted entirely to clustering, a discipline dispersed through many theoretical and application areas, from mathematical statistics and combina­ torial optimization to biology, sociology and organizational structures. It compiles an immense amount of research done to date, including many original Russian de­ velopments never presented to the international community before (for instance, cluster-by-cluster versions of the K-Means method in Chapter 4 or uniform par­ titioning in Chapter 5). The author's approach, approximation clustering, allows him both to systematize a great part of the discipline and to develop many in­ novative methods in the framework of optimization problems. The optimization methods considered are proved to be meaningful in the contexts of data analysis and clustering. The material presented in this book is quite interesting and stimulating in paradigms, clustering and optimization. On the other hand, it has a substantial application appeal. The book will be useful both to specialists and students in the fields of data analysis and clustering as well as in biology, psychology, economics, marketing research, artificial intelligence, and other scientific disciplines. Panos Pardalos, Series Editor.

The analysis of experimental data is at heart of science from its beginnings. But it was the advent of digital computers that allowed the execution of highly non-linear and increasingly complex data analysis procedures - methods that were completely unfeasible before. Non-linear curve fitting, clustering and machine learning belong to these modern techniques which are a further step towards computational intelligence.The goal of this book is to provide an interactive and illustrative guide to these topics. It concentrates on the road from two dimensional curve fitting to multidimensional clustering and machine learning with neural networks or support vector machines. Along the way topics like mathematical optimization or evolutionary algorithms are touched. All concepts and ideas are outlined in a clear cut manner with graphically depicted plausibility arguments and a little elementary mathematics. The major topics are extensively outlined with exploratory examples and applications. The primary goal is to be as illustrative as possible without hiding problems and pitfalls but to address them. The character of an illustrative cookbook is complemented with specific sections that address more fundamental questions like the relation between machine learning and human intelligence. These sections may be skipped without affecting the main road but they will open up possibly interesting insights beyond the mere data massage.All topics are completely demonstrated with the aid of the commercial computing platform Mathematica and the Computational Intelligence Packages (CIP), a high-level function library developed with Mathematica's programming language on top of Mathematica's algorithms. CIP is open-source so the detailed code of every method is freely accessible. All examples and applications shown throughout the book may be used and customized by the reader without any restrictions. The target readerships are students of(computer) science and engineering as well as scientific practitioners in industry and academia who deserve an illustrative introduction to these topics. Readers with programming skills may easily port and customize the provided code.

This book contains the extended papers presented at the 2nd Workshop on Supervised and Unsupervised Ensemble Methods and their Applications (SUEMA) held on 21-22 July, 2008 in Patras, Greece, in conjunction with the 18th European Conference on Artificial Intelligence (ECAI'2008). This workshop was a successor of the smaller event held in 2007 in conjunction with 3rd Iberian Conference on Pattern Recognition and Image Analysis, Girona, Spain. The success of that event as well as the publication of workshop papers in the edited book “Supervised and Unsupervised Ensemble Methods and their Applications”, published by Springer-Verlag in Studies in Computational Intelligence Series in volume 126, encouraged us to continue a good tradition. The purpose of this book is to support practitioners in various branches of science and technology to adopt the ensemble approach for their daily research work. We hope that fourteen chapters composing the book will be a good guide in the sea of numerous opportunities for ensemble methods.

Cluster analysis means the organization of an unlabeled collection of objects or patterns into separate groups based on their similarity. The task of computerized data clustering has been approached from diverse domains of knowledge like graph theory, multivariate analysis, neural networks, fuzzy set theory, and so on. Clustering is often described as an unsupervised learning method but most of the traditional algorithms require a prior specification of the number of clusters in the data for guiding the partitioning process, thus making it not completely unsupervised. Modern data mining tools that predict future trends and behaviors for allowing businesses to make proactive and knowledge-driven decisions, demand fast and fully automatic clustering of very large datasets with minimal or no user intervention. In this volume, we formulate clustering as an optimization problem, where the best partitioning of a given dataset is achieved by minimizing/maximizing one (single-objective clustering) or more (multi-objective clustering) objective functions. Using several real world applications, we illustrate the performance of several metaheuristics, particularly the Differential Evolution algorithm when applied to both single and multi-objective clustering problems, where the number of clusters is not known beforehand and must be determined on the run. This volume comprises of 7 chapters including an introductory chapter giving the fundamental definitions and the last Chapter provides some important research challenges. Academics, scientists as well as engineers engaged in research, development and application of optimization techniques and data mining will find the comprehensive coverage of this book invaluable.

In the modern world of gigantic datasets, which scientists and practioners of all fields of learning are confronted with, the availability of robust, scalable and easy-to-use methods for pattern recognition and data mining are of paramount importance, so as to be able to cope with the avalanche of data in a meaningful way. This concise and pedagogical research monograph introduces the reader to two specific aspects - clustering techniques and dimensionality reduction - in the context of complex network analysis. The first chapter provides a short introduction into relevant graph theoretical notation; chapter 2 then reviews and compares a number of cluster definitions from different fields of science. In the subsequent chapters, a first-principles approach to graph clustering in complex networks is developed using methods from statistical physics and the reader will learn, that even today, this field significantly contributes to the understanding and resolution of the related statistical inference issues. Finally, an application chapter examines real-world networks from the economic realm to show how the network clustering process can be used to deal with large, sparse datasets where conventional analyses fail.

Fuzzy Models and Algorithms for Pattern Recognition and Image Processing presents a comprehensive introduction of the use of fuzzy models in pattern recognition and selected topics in image processing and computer vision. Unique to this volume in the Kluwer Handbooks of Fuzzy Sets Series is the fact that this book was written in its entirety by its four authors. A single notation, presentation style, and purpose are used throughout. The result is an extensive unified treatment of many fuzzy models for pattern recognition. The main topics are clustering and classifier design, with extensive material on feature analysis relational clustering, image processing and computer vision. Also included are numerous figures, images and numerical examples that illustrate the use of various models involving applications in medicine, character and word recognition, remote sensing, military image analysis, and industrial engineering.

It is a great privilege and pleasure to write a foreword for a book honor­ ing Wolfgang Gaul on the occasion of his sixtieth birthday. Wolfgang Gaul is currently Professor of Business Administration and Management Science and the Head of the Institute of Decision Theory and Management Science, Faculty of Economics, University of Karlsruhe (TH), Germany. He is, by any measure, one of the most distinguished and eminent scholars in the world today. Wolfgang Gaul has been instrumental in numerous leading research initia­ tives and has achieved an unprecedented level of success in facilitating com­ munication among researchers in diverse disciplines from around the world. A particularly remarkable and unique aspect of his work is that he has been a leading scholar in such diverse areas of research as graph theory and net­ work models, reliability theory, stochastic optimization, operations research, probability theory, sampling theory, cluster analysis, scaling and multivariate data analysis. His activities have been directed not only at these and other theoretical topics, but also at applications of statistical and mathematical tools to a multitude of important problems in computer science (e.g., w- mining), business research (e.g., market segmentation), management science (e.g., decision support systems) and behavioral sciences (e.g., preference mea­ surement and data mining). All of his endeavors have been accomplished at the highest level of professional excellence.