Fr. 220.00

Mining Graph Data

English · Hardback

Shipping usually within 1 to 3 weeks (not available at short notice)

Description

Read more

Informationen zum Autor DIANE J. COOK , PhD, is the Huie-Rogers Chair Professor in the School of Electrical Engineering and Computer Science at Washington State University. Her extensive research in artificial intelligence and data mining has been supported by grants from the National Science Foundation, NASA, DARPA, and Texas Instruments. Dr. Cook is the coauthor of Smart Environments: Technology, Protocols, and Applications (Wiley). LAWRENCE B. HOLDER , PhD, is Professor in the School of Electrical Engineering and Computer Science at Washington State University, where he teaches and conducts research in artificial intelligence, machine learning, data mining, graph theory, parallel and distributed processing, and cognitive architectures. Klappentext Discover the latest data mining techniques for analyzing graph dataThis text takes a focused and comprehensive look at an area of data mining that is quickly rising to the forefront of the field: mining data that is represented as a graph. Each chapter is written by a leading researcher in the field; collectively, the chapters represent the latest findings and applications in both theory and practice, including solutions to many of the algorithmic challenges that arise in mining graph data. Following the authors' step-by-step guidance, even readers with minimal background in analyzing graph data will be able to represent data as graphs, extract patterns and concepts from the data, and apply the methodologies presented in the text to real datasets.Mining Graph Data is divided into three parts:* Part I, Graphs, offers an introduction to basic graph terminology and techniques.* Part II, Mining Techniques, features a detailed examination of computational techniques for extracting patterns from graph data. These techniques are the state of the art in frequent substructure mining, link analysis, graph kernels, and graph grammars.* Part III, Applications, describes the application of data mining techniques to four graph-based application domains: chemical graphs, bioinformatics data, Web graphs, and social networks.Practical case studies are included in many of the chapters. An accompanying Web site features source code and datasets, offering readers the opportunity to experiment with the techniques presented in the book as well as test their own ideas on graph data. The Web site also includes the results of many of the techniques presented in the text.This landmark work is intended for students and researchers in computer science, information systems, and data mining who want to learn how to analyze and extract useful patterns and concepts from graph data. Zusammenfassung This books illustrates how data mining techniques, through the application of algorithms and graphs, have been responding to the need for the collection and storage of larger and more complex volumes of data. Inhaltsverzeichnis Preface. Acknowledgments. Contributors. 1 INTRODUCTION ( Lawrence B. Holder and Diane J. Cook ). 1.1 Terminology. 1.2 Graph Databases. 1.3 Book Overview. References. Part I GRAPHS. 2 GRAPH MATCHING-EXACT AND ERROR-TOLERANT METHODS AND THE AUTOMATIC LEARNING OF EDIT COSTS ( Horst Bunke and Michel Neuhaus ). 2.1 Introduction. 2.2 Definitions and Graph Matching Methods. 2.3 Learning Edit Costs. 2.4 Experimental Evaluation. 2.5 Discussion and Conclusions. References. 3 GRAPH VISUALIZATION AND DATA MINING ( Walter Didimo and Giuseppe Liotta ). 3.1 Introduction. 3.2 Graph Drawing Techniques. 3.3 Examples of Visualization Systems. 3.4 Conclusions. References. 4 GRAPH PATTERNS AND THE R-MAT GENERATOR ( Deepayan Chakrabarti and Christos Faloutsos ). 4.1 Introductio...

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.