Cantitate/Preț
Produs

Graph Data Mining: Algorithm, Security and Application: Big Data Management

Editat de Qi Xuan, Zhongyuan Ruan, Yong Min
en Limba Engleză Paperback – 17 iul 2022
Graph data is powerful, thanks to its ability to model arbitrary relationship between objects and is encountered in a range of real-world applications in fields such as bioinformatics, traffic network, scientific collaboration, world wide web and social networks. Graph data mining is used to discover useful information and knowledge from graph data. The complications of nodes, links and the semi-structure form present challenges in terms of the computation tasks, e.g., node classification, link prediction, and graph classification. In this context, various advanced techniques, including graph embedding and graph neural networks, have recently been proposed to improve the performance of graph data mining.
This book provides a state-of-the-art review of graph data mining methods. It addresses a current hot topic – the security of graph data mining – and proposes a series of detection methods to identify adversarial samples in graph data. In addition, it introduces readers to graph augmentation and subgraph networks to further enhance the models, i.e., improve their accuracy and robustness. Lastly, the book describes the applications of these advanced techniques in various scenarios, such as traffic networks, social and technical networks, and blockchains. 
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 113250 lei  6-8 săpt.
  Springer Nature Singapore – 17 iul 2022 113250 lei  6-8 săpt.
Hardback (1) 113866 lei  6-8 săpt.
  Springer Nature Singapore – 16 iul 2021 113866 lei  6-8 săpt.

Din seria Big Data Management

Preț: 113250 lei

Preț vechi: 141562 lei
-20% Nou

Puncte Express: 1699

Preț estimativ în valută:
21674 22513$ 18003£

Carte tipărită la comandă

Livrare economică 01-15 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9789811626111
ISBN-10: 9811626111
Ilustrații: XVI, 243 p. 92 illus., 67 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.37 kg
Ediția:1st ed. 2021
Editura: Springer Nature Singapore
Colecția Springer
Seria Big Data Management

Locul publicării:Singapore, Singapore

Cuprins

Chapter 1. Information Source Estimation with Multi-Channel Graph Neural Network.- Chapter 2. Link Prediction based on Hyper-Substructure Network.- Chapter 3. Broad Learning Based on Subgraph Networks for Graph Classification.- Chapter 4. Subgraph Augmentation with Application to Graph Mining.- 5. Adversarial Attacks on Graphs: How to Hide Your Structural Information.- Chapter 6. Adversarial Defenses on Graphs: Towards Increasing the Robustness of Algorithms.- Chapter 7. Understanding Ethereum Transactions via Network Approach.- Chapter 8. Find Your Meal Pal: A Case Study on Yelp Network.- Chapter 9. Graph convolutional recurrent neural networks: a deep learning framework for traffic prediction.- Chapter 10. Time Series Classification based on Complex Network.- Chapter 11. Exploring the Controlled Experiment by Social Bots.

Notă biografică

Qi Xuan is a Professor at the Institute of Cyberspace Security,  Zhejiang University of Technology, Hangzhou, China. His current research interests include network science, graph data mining, cyberspace security, and deep learning. He has published more than 50 papers in leading journals and conferences, including IEEE TKDE, IEEE TIE, IEEE TNSE, ICSE, and FSE. He is the reviewer of the journals such like IEEE TKDE, IEEE TIE, IEEE TII, and IEEE TNSE.
Zhongyuan Ruan is a lecturer at the Institute of Cyberspace Security, Zhejiang University of Technology, Hangzhou, China. His current research interests include network science, such as epidemic and information spreading in complex networks, and traffic networks. He has published more than 20 papers in journals such as Physical Review Letters, Physical Review E, Chaos, Scientific Reports, and Physica A.
Yong Min is an Associate Professor at the Institute of Cyberspace Security, Zhejiang University ofTechnology, Hangzhou, China. His research interests include social network analysis, computational communication, and artificial intelligence algorithms. He was named an Excellent Young Teacher of Zhejiang University of Technology. He has hosted and participated in more than ten projects, including those by national and provincial natural science foundations. He has also published over 30 papers, including two in the leading journal Nature and Science, and he holds more than three patents.

Textul de pe ultima copertă

Graph data is powerful, thanks to its ability to model arbitrary relationship between objects and is encountered in a range of real-world applications in fields such as bioinformatics, traffic network, scientific collaboration, world wide web and social networks. Graph data mining is used to discover useful information and knowledge from graph data. The complications of nodes, links and the semi-structure form present challenges in terms of the computation tasks, e.g., node classification, link prediction, and graph classification. In this context, various advanced techniques, including graph embedding and graph neural networks, have recently been proposed to improve the performance of graph data mining.
This book provides a state-of-the-art review of graph data mining methods. It addresses a current hot topic – the security of graph data mining – and proposes a series of detection methods to identify adversarial samples in graph data. In addition, it introduces readers to graph augmentation and subgraph networks to further enhance the models, i.e., improve their accuracy and robustness. Lastly, the book describes the applications of these advanced techniques in various scenarios, such as traffic networks, social and technical networks, and blockchains. 

Caracteristici

Provides a comprehensive overview of the state-of-the-art in graph data mining algorithms Introduces various key applications of the advanced graph data mining techniques Presents robust graph data mining based on subgraph networks and graph augmentation