The Fifth SIAM International Conference on Data Mining continues the tradition of providing an open forum for the presentation and discussion of innovative algorithms as well as novel applications of data mining. Advances in information technology and data collection methods have led to the availability of large data sets in commercial enterprises and in a wide variety of scientific and engineering disciplines. The field of data mining draws upon extensive work in areas such as statistics, machine learning, pattern recognition, databases, and high performance computing to discover interesting and previously unknown information in data. This conference results in data mining, including applications, algorithms, software, and systems.
This book constitutes the refereed proceedings of the 5th Annual International European Symposium on Algorithms, ESA'97, held in Graz, Austria, September 1997. The 38 revised full papers presented were selected from 112 submitted papers. The papers address a broad spectrum of theoretical and applicational aspects in algorithms theory and design. Among the topics covered are approximation algorithms, graph and network algorithms, combinatorial optimization, computational biology, computational mathematics, data compression, distributed computing, evolutionary algorithms, neural computing, online algorithms, parallel computing, pattern matching, and others.
The Handbook of Data Structures and Applications was first published over a decade ago. This second edition aims to update the first by focusing on areas of research in data structures that have seen significant progress. While the discipline of data structures has not matured as rapidly as other areas of computer science, the book aims to update those areas that have seen advances. Retaining the seven-part structure of the first edition, the handbook begins with a review of introductory material, followed by a discussion of well-known classes of data structures, Priority Queues, Dictionary Structures, and Multidimensional structures. The editors next analyze miscellaneous data structures, which are well-known structures that elude easy classification. The book then addresses mechanisms and tools that were developed to facilitate the use of data structures in real programs. It concludes with an examination of the applications of data structures. Four new chapters have been added on Bloom Filters, Binary Decision Diagrams, Data Structures for Cheminformatics, and Data Structures for Big Data Stores, and updates have been made to other chapters that appeared in the first edition. The Handbook is invaluable for suggesting new ideas for research in data structures, and for revealing application contexts in which they can be deployed. Practitioners devising algorithms will gain insight into organizing data, allowing them to solve algorithmic problems more efficiently.
Algorithms that have to process large data sets have to take into account that the cost of memory access depends on where the data is stored. Traditional algorithm design is based on the von Neumann model where accesses to memory have uniform cost. Actual machines increasingly deviate from this model: while waiting for memory access, nowadays, microprocessors can in principle execute 1000 additions of registers; for hard disk access this factor can reach six orders of magnitude. The 16 coherent chapters in this monograph-like tutorial book introduce and survey algorithmic techniques used to achieve high performance on memory hierarchies; emphasis is placed on methods interesting from a theoretical as well as important from a practical point of view.
Current access paradigms for the Web, i.e., direct access via search engines or database queries and navigational access via static taxonomies, have recently been criticized because they are too rigid or simplistic to effectively cope with a large number of practical search applications. A third paradigm, dynamic taxonomies and faceted search, focuses on user-centered conceptual exploration, which is far more frequent in search tasks than retrieval using exact specification, and has rapidly become pervasive in modern Web data retrieval, especially in critical applications such as product selection for e-commerce. It is a heavily interdisciplinary area, where data modeling, human factors, logic, inference, and efficient implementations must be dealt with holistically. Sacco, Tzitzikas, and their contributors provide a coherent roadmap to dynamic taxonomies and faceted search. The individual chapters, written by experts in each relevant field and carefully integrated by the editors, detail aspects like modeling, schema design, system implementation, search performance, and user interaction. The basic concepts of each area are introduced, and advanced topics and recent research are highlighted. An additional chapter is completely devoted to current and emerging application areas, including e-commerce, multimedia, multidimensional file systems, and geographical information systems. The presentation targets advanced undergraduates, graduate students and researchers from different areas – from computer science to library and information science – as well as advanced practitioners. Given that research results are currently scattered among very different publications, this volume will allow researchers to get a coherent and comprehensive picture of the state of the art.