Graph Data Mining: Algorithm, Security and Application (Big Data Management)
Sold by Best Price, Torrance, CA, U.S.A.
AbeBooks Seller since August 30, 2024
New - Soft cover
Condition: New
Quantity: 2 available
Add to basketSold by Best Price, Torrance, CA, U.S.A.
AbeBooks Seller since August 30, 2024
Condition: New
Quantity: 2 available
Add to basketSUPER FAST SHIPPING.
Seller Inventory # 9789811626111
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.
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."About this title" may belong to another edition of this title.
When you see an item on our listing, it means we have it available in one of our warehouses right here right now, ready for same day or next day processing of your order. Over 50+ Million books in stock & ready to ship same day. Customer Service is a top priority for us, we want every customer to be 100% satisfied. We offer the world's largest selection of books, music and video. Maintaining an accurate inventory of more than 50+ Million items, we are able to ship your order the same day it is r...
SUPER FAST SHIPPING!
Order quantity | 1 to 3 business days | 1 to 3 business days |
---|---|---|
First item | US$ 7.98 | US$ 19.98 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.