Practical Graph Mining with R Chapman & Hall/CRC Data Mining and Knowledge Discovery Series
Coordonnateurs : Samatova Nagiza F., Hendrix William, Jenkins John, Padmanabhan Kanchana, Chakraborty Arpan
Discover Novel and Insightful Knowledge from Data Represented as a GraphPractical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs.
Hands-On Application of Graph Data Mining
Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks.
Develops Intuition through Easy-to-Follow Examples and Rigorous Mathematical Foundations
Every algorithm and example is accompanied with R code. This allows readers to see how the algorithmic techniques correspond to the process of graph data analysis and to use the graph mining techniques in practice. The text also gives a rigorous, formal explanation of the underlying mathematics of each technique.
Makes Graph Mining Accessible to Various Levels of Expertise
Assuming no prior knowledge of mathematics or data mining, this self-contained book is accessible to students, researchers, and practitioners of graph data mining. It is suitable as a primary textbook for graph mining or as a supplement to a standard data mining course. It can also be used as a reference for researchers in computer, information, and computational science as well as a handy guide for data analytics practitioners.
Introduction. An Introduction to Graph Theory. An Introduction to R. An Introduction to Kernel Functions. Link Analysis. Graph-Based Proximity Measures. Frequent Subgraph Mining. Cluster Analysis. Classification. Dimensionality Reduction. Graph-Based Anomaly Detection. Performance Metrics for Graph Mining Tasks. Introduction to Parallel Graph Mining. Index.
Nagiza F. Samatova is an associate professor of computer science at North Carolina State University and a senior research scientist at Oak Ridge National Laboratory.
Date de parution : 07-2013
Ouvrage de 480 p.
15.6x23.4 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 103,03 €
Ajouter au panierThèmes de Practical Graph Mining with R :
Mots-clés :
1e 1e 1e 1e 1e; Adjacency Matrix; extracting patterns from graph data; Co-citation Matrix; graph mining task; Kernel Matrix; Graph Data Mining; Support Vector Machines; link and cluster analysis; Class Labels; graph data analysis; Pseudocode Description; graph kernels; Weighted Graph; Kernel PCA; Frequent Subgraph; Graph Mining; North Carolina State University; Proximity Measures; MDL; Undirected Graph; 1e 1e 1e 1e; Roc Space; Maximal Clique; Mst; Bibliographic Coupling; Adjacency List; Link Prediction; HSS; Non-mutagenic Chemical Compounds; Hub Scores