Ronen Feldman / Bar-Ilan University, Israel
James Sanger / ABS Ventures, Boston, Massachusetts

The Text Mining Handbook
Advanced Approaches in Analyzing Unstructured Data

Hardback (ISBN-13: 9780521836579 | ISBN-10: 0521836573)

Text mining is a new and exciting area of computer science research that tries to solve the crisis of information overload by combining techniques from data mining, machine learning, natural language processing, information retrieval, and knowledge management. Similarly, link detection - a rapidly evolving approach to the analysis of text that shares and builds upon many of the key elements of text mining - also provides new tools for people to better leverage their burgeoning textual data resources. The Text Mining Handbook presents a comprehensive discussion of the state-of-the-art in text mining and link detection. In addition to providing an in-depth examination of core text mining and link detection algorithms and operations, the book examines advanced pre-processing techniques, knowledge representation considerations, and visualization approaches. Finally, the book explores current real-world, mission-critical applications of text mining and link detection in such varied fields as M&A business intelligence, genomics research and counter-terrorism activities.

* The first comprehensive compilation of algorithms, methodologies, practical approaches and applications
* Co-authored by one of the founding figures in the field of text mining
* Detailed description of core text mining algorithms for identifying patterns such as frequent sets, distributions and proportions and associations

Contents

1. Introduction to text mining; 2. Core text mining operations; 3. Text mining preprocessing techniques; 4. Categorization; 5. Clustering; 6. Information extraction; 7. Probabilistic models for Information extraction; 8. Preprocessing applications using probabilistic and hybrid approaches; 9. Presentation-layer considerations for browsing and query refinement; 10. Visualization approaches; 11. Link analysis; 12. Text mining applications; Appendix; Bibliography.

Jan Hesthaven / Brown University, Rhode Island
Sigal Gottlieb / University of Massachusetts, Dartmouth
David Gottlieb / Brown University, Rhode Island

Spectral Methods for Time-Dependent Problems

Series: Cambridge Monographs on Applied and Computational Mathematics (No. 21)
Hardback (ISBN-13: 9780521792110 | ISBN-10: 0521792118)

Spectral methods are well-suited to solve problems modeled by time-dependent partial differential equations: they are fast, efficient and accurate and widely used by mathematicians and practitioners. This class-tested introduction, the first on the subject, is ideal for graduate courses, or self-study. The authors describe the basic theory of spectral methods, allowing the reader to understand the techniques through numerous examples as well as more rigorous developments. They provide a detailed treatment of methods based on Fourier expansions and orthogonal polynomials (including discussions of stability, boundary conditions, filtering, and the extension from the linear to the nonlinear situation). Computational solution techniques for integration in time are dealt with by Runge-Kutta type methods. Several chapters are devoted to material not previously covered in book form, including stability theory for polynomial methods, techniques for problems with discontinuous solutions, round-off errors and the formulation of spectral methods on general grids. These will be especially helpful for practitioners.

* Ideal for both graduate students and practitioners, including both basic theory and more rigorous developments
* Written from material which has been thoroughly and successfully class-tested by experienced authors
* No other text in print deals with this topic at a fundamental level and it includes material never before covered in book form

Contents

Introduction; 1. From local to global approximation; 2. Trigonometric polynomial approximation; 3. Fourier spectral methods; 4. Orthogonal polynomials; 5. Polynomial expansions; 6. Polynomial approximations theory for smooth functions; 7. Polynomial spectral methods; 8. Stability of polynomial spectral methods; 9. Spectral methods for non-smooth problems; 10. Discrete stability and time integration; 11. Computational aspects; 12. Spectral methods on general grids; Bibliography.

Graham Hutton / University of Nottingham

Programming in Haskell

Hardback (ISBN-13: 9780521871723 | ISBN-10: 0521871727)
Paperback (ISBN-13: 9780521692694 | ISBN-10: 0521692695)

Haskell is one of the leading languages for teaching functional programming, enabling students to write simpler and cleaner code, and to learn how to structure and reason about programs. This introduction is ideal for beginners: it requires no previous programming experience and all concepts are explained from first principles via carefully chosen examples. Each chapter includes exercises that range from the straightforward to extended projects, plus suggestions for further reading on more advanced topics. The author is a leading Haskell researcher and instructor, well-known for his teaching skills. The presentation is clear and simple, and benefits from having been refined and class-tested over several years. The result is a text that can be used with courses, or for self-learning. Features include freely accessible Powerpoint slides for each chapter, solutions to exercises and examination questions (with solutions) available to instructors, and a downloadable code that's fully compliant with the latest Haskell release.

* Fully compliant with recently published definition of Haskell, and the first new textbook since this has been completed
* Powerpoint slides for each chapter freely available on the web
* Instructors can obtain solutions to each chapter's exercises, together with a large collection of exam questions (and their solutions) via www.cambridge.org/9780521692694

Contents

Preface; 1. Introduction; 2. First steps; 3. Types and classes; 4. Defining functions; 5. List comprehensions; 6. Recursive functions; 7. Higher-order functions; 8. Functional parsers; 9. Interactive programs; 10. Declaring types and classes; 11. The countdown problem; 12. Lazy evaluation; 13. Reasoning about programs; Appendix A: a standard prelude; Appendix B: symbol table; Bibliography; Index.

W. H. Schikhof

Ultrametric Calculus
An Introduction to p-Adic Analysis

Series: Cambridge Studies in Advanced Mathematics (No. 4)
Paperback (ISBN-13: 9780521032872 | ISBN-10: 0521032873)

This is an introduction to p-adic analysis which is elementary yet complete and which displays the variety of applications of the subject. Dr Schikhof is able to point out and explain how p-adic and 'real' analysis differ. This approach guarantees the reader quickly becomes acquainted with this equally 'real' analysis and appreciates its relevance. The reader's understanding is enhanced and deepened by the large number of exercises included throughout; these both test the reader's grasp and extend the text in interesting directions. As a consequence, this book will become a standard reference for professionals (especially in p-adic analysis, number theory and algebraic geometry) and will be welcomed as a textbook for advanced students of mathematics familiar with algebra and analysis.

Contents

Frontispiece; Preface; Part I. Valuations: 1. Valuations; 2. Ultrametrics; Part II. Calculus: 3. Elementary calculus; 4. Interpolation; 5. Analytic functions; Part III. Functions on Zp: 6. Mahler's base and p-adic integration; 7. The p-adic gamma and zeta functions; 8. van der Put's base and antiderivation; Part IV. More General Theory of Functions: 9. Continuity and differentiability; 10. Cn -theory; 11. Monotone functions; Appendixes; Further reading; Notation; Index.