Böcker i Big Data Management-serien

The development of information technology has made it possible to collect large amounts of spatial data on a daily basis. It is of enormous significance when it comes to discovering implicit, non-trivial and potentially valuable information from this spatial data. Spatial co-location patterns reveal the distribution rules of spatial features, which can be valuable for application users. This book provides commercial software developers with proven and effective algorithms for detecting and filtering these implicit patterns, and includes easily implemented pseudocode for all the algorithms. Furthermore, it offers a basis for further research in this promising field.Preference-based co-location pattern mining refers to mining constrained or condensed co-location patterns instead of mining all prevalent co-location patterns. Based on the authors¿ recent research, the book highlights techniques for solving a range of problems in this context, including maximal co-location pattern mining, closed co-location pattern mining, top-k co-location pattern mining, non-redundant co-location pattern mining, dominant co-location pattern mining, high utility co-location pattern mining, user-preferred co-location pattern mining, and similarity measures between spatial co-location patterns.Presenting a systematic, mathematical study of preference-based spatial co-location pattern mining, this book can be used both as a textbook for those new to the topic and as a reference resource for experienced professionals.

This book describes theoretical elements, practical approaches, and specialized tools that systematically organize, characterize, and analyze big data gathered from educational affairs and settings. Moreover, the book shows several inference criteria to leverage and produce descriptive, explanatory, and predictive closures to study and understand education phenomena at in classroom and online environments.This is why diverse researchers and scholars contribute with valuable chapters to ground with well-¿sounded theoretical and methodological constructs in the novel field of Educational Data Science (EDS), which examines academic big data repositories, as well as to introduces systematic reviews, reveals valuable insights, and promotes its application to extend its practice. EDS as a transdisciplinary field relies on statistics, probability, machine learning, data mining, and analytics, in addition to biological, psychological, and neurological knowledge aboutlearning science. With this in mind, the book is devoted to those that are in charge of educational management, educators, pedagogues, academics, computer technologists, researchers, and postgraduate students, who pursue to acquire a conceptual, formal, and practical landscape of how to deploy EDS to build proactive, real- time, and reactive applications that personalize education, enhance teaching, and improve learning!

This book presents the state of the art in distributed machine learning algorithms that are based on gradient optimization methods. In the big data era, large-scale datasets pose enormous challenges for the existing machine learning systems. As such, implementing machine learning algorithms in a distributed environment has become a key technology, and recent research has shown gradient-based iterative optimization to be an effective solution. Focusing on methods that can speed up large-scale gradient optimization through both algorithm optimizations and careful system implementations, the book introduces three essential techniques in designing a gradient optimization algorithm to train a distributed machine learning model: parallel strategy, data compression and synchronization protocol.Written in a tutorial style, it covers a range of topics, from fundamental knowledge to a number of carefully designed algorithms and systems of distributed machine learning. It will appeal to a broad audience in the field of machine learning, artificial intelligence, big data and database management.