In this monograph, we study the problem of high-dimensional indexing and systematically introduce two efficient index structures: one for range queries and the other for similarity queries. Extensive experiments and comparison studies are conducted to demonstrate the superiority of the proposed indexing methods. Many new database applications, such as multimedia databases or stock price information systems, transform important features or properties of data objects into high-dimensional points. Searching for objects based on these features is thus a search of points in this feature space. To support efficient retrieval in such high-dimensional databases, indexes are required to prune the search space. Indexes for low-dimensional databases are well studied, whereas most of these application specific indexes are not scaleable with the number of dimensions, and they are not designed to support similarity searches and high-dimensional joins.

An integrated package of powerful probabilistic tools and key applications in modern mathematical data science.

Connecting theory with practice, this systematic and rigorous introduction covers the fundamental principles, algorithms and applications of key mathematical models for high-dimensional data analysis. Comprehensive in its approach, it provides unified coverage of many different low-dimensional models and analytical techniques, including sparse and low-rank models, and both convex and non-convex formulations. Readers will learn how to develop efficient and scalable algorithms for solving real-world problems, supported by numerous examples and exercises throughout, and how to use the computational tools learnt in several application contexts. Applications presented include scientific imaging, communication, face recognition, 3D vision, and deep networks for classification. With code available online, this is an ideal textbook for senior and graduate students in computer science, data science, and electrical engineering, as well as for those taking courses on sparsity, low-dimensional structures, and high-dimensional data. Foreword by Emmanuel Candès.

A coherent introductory text from a groundbreaking researcher, focusing on clarity and motivation to build intuition and understanding.

This book provides a unique insight into the latest breakthroughs in a consistent manner, at a level accessible to undergraduates, yet with enough attention to the theory and computation to satisfy the professional researcher Statistical physics addresses the study and understanding of systems with many degrees of freedom. As such it has a rich and varied history, with applications to thermodynamics, magnetic phase transitions, and order/disorder transformations, to name just a few. However, the tools of statistical physics can be profitably used to investigate any system with a large number of components. Thus, recent years have seen these methods applied in many unexpected directions, three of which are the main focus of this volume. These applications have been remarkably successful and have enriched the financial, biological, and engineering literature. Although reported in the physics literature, the results tend to be scattered and the underlying unity of the field overlooked.

This book constitutes the refereed proceedings of the 8th International Conference on Database Theory, ICDT 2001, held in London, UK, in January 2001. The 26 revised full papers presented together with two invited papers were carefully reviewed and selected from 75 submissions. All current issues on database theory and the foundations of database systems are addressed. Among the topics covered are database queries, SQL, information retrieval, database logic, database mining, constraint databases, transactions, algorithmic aspects, semi-structured data, data engineering, XML, term rewriting, clustering, etc.