Muutke küpsiste eelistusi

E-raamat: Practical Graph Mining with R

Edited by , Edited by (North Carolina State University, Raleigh, USA), Edited by , Edited by , Edited by (North Carolina State University and Oak Ridge National Laboratory, Raleigh, USA)
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 63,69 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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 MiningEach 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 FoundationsEvery 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 ExpertiseAssuming 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-- 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 MiningEach 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 FoundationsEvery 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 ExpertiseAssuming 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.

Arvustused

"The authors provide a tour de force introduction to the different data representations (vectors, matrices), and introduce graph structures and the questions that can be answered with them. ... The book has many strong points. There is a companion website that hosts slide presentations for almost all chapters, as well the R code needed to run the example code. The impatient reader can start going through the presentations and experimenting with the code right away. The more patient reader can read the book from cover to cover. For many reader categories, this summary of existing relevant work and approaches for data mining graph structures is a welcome addition, for which the authors deserves much praise." --Radu State, Computing Reviews

List of Figures
ix
List of Tables
xvii
Preface xix
1 Introduction
1(8)
Kanchana Padmanabhan
William Hendrix
Nagiza F. Samatova
2 An Introduction to Graph Theory
9(18)
Stephen Ware
3 An Introduction to R
27(26)
Neil Shah
4 An Introduction to Kernel Functions
53(22)
John Jenkins
5 Link Analysis
75(60)
Arpan Chakraborty
Kevin Wilson
Nathan Green
Shravan Kumar Alur
Fatih Ergin
Karthik Gurumurthy
Romulo Manzano
Deepti Chinta
6 Graph-based Proximity Measures
135(32)
Kevin A. Wilson
Nathan D. Green
Laxmikant Agrawal
Xibin Gao
Dinesh Madhusoodanan
Brian Riley
James P. Sigmon
7 Frequent Subgraph Mining
167(38)
Brent E. Harrison
Jason C. Smith
Stephen G. Ware
Hsiao-Wei Chen
Wenbin Chen
Anjali Khatri
8 Cluster Analysis
205(34)
Kanchana Padmanabhan
Brent Harrison
Kevin Wilson
Michael L. Warren
Katie Bright
Justin Mosiman
Jayaram Kancherla
Hieu Phung
Benjamin Miller
Sam Shamseldin
9 Classification
239(24)
Srinath Ravindran
John Jenkins
Huseyin Sencan
Jay Prakash Goel
Saee Nirgude
Kalindi K. Raichura
Suchetha M. Reddy
Jonathan S. Tatagiri
10 Dimensionality Reduction
263(48)
Madhuri R. Marri
Lakshmi Ramachandran
Pradeep Murukannaiah
Padmashree Ravindra
Amrita Paul
Da Young Lee
David Funk
Shanmugapriya Murugappan
William Hendrix
11 Graph-based Anomaly Detection
311(62)
Kanchana Padmanabhan
Zhengzhang Chen
Sriram Lakshminarasimhan
Siddarth Shankar Ramaswamy
Bryan Thomas Richardson
12 Performance Metrics for Graph Mining Tasks
373(46)
Kanchana Padmanabhan
John Jenkins
13 Introduction to Parallel Graph Mining
419(46)
William Hendrix
Mekha Susan Varghese
Nithya Natesan
Kaushik Tirukarugavur Srinivasan
Vinu Balajee
Yu Ren
Index 465
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.