{"id":256705,"date":"2026-07-13T15:00:40","date_gmt":"2026-07-13T12:00:40","guid":{"rendered":"https:\/\/1kitap1.com\/en\/concepts-and-techniques-of-graph-neural-networks-vinod-kumar\/"},"modified":"2026-07-13T15:00:40","modified_gmt":"2026-07-13T12:00:40","slug":"concepts-and-techniques-of-graph-neural-networks-vinod-kumar","status":"publish","type":"post","link":"https:\/\/1kitap1.com\/en\/concepts-and-techniques-of-graph-neural-networks-vinod-kumar\/","title":{"rendered":"Concepts And Techniques Of Graph Neural Networks – Vinod Kumar"},"content":{"rendered":"
\"<\/figure>\n

Common Neighbors – Simple and intuitive – Computationally efficient – May not work well for sparse networks – Ignores the strength of connections between nodes Liben-Nowell, D., & Kleinberg, J. (2007). The link prediction problem for social networks. Journal of the American Society for Information Science and Technology. Jaccard Coefficient – Simple and intuitive – Computationally efficient – May not work well for sparse networks – Ignores the strength of connections between nodes Liben-Nowell, D., & Kleinberg, J.<\/p>\n

(2007). The link prediction problem for social networks. Journal of the American Society for Information Science and Technology. Adamic-Adar Index – Considers the importance of common – May not work well for sparse networks Adamic, L. A., & Adar, E. (2003). Friends and neighbors – Computationally efficient – Ignores the strength of connections between nodes neighbors on the Web. Social Networks. Preferential Attachment – Considers the importance of node degree – Computationally efficient – May not work well for networks with strong community structure – Ignores the strength of connections between nodes Barab\u00e1si, A.<\/p>\n

L., & Albert, R. (1999). Emergence of scaling in random networks. Science. Random Walk with Restart – Can handle directed and weighted networks – Can consider multiple features of nodes and edges – Computationally expensive for large-scale networks – May require tuning of parameters Tong, Faloutsos, C., & Pan, J. Y. (2006). Fast random walk with restart and its applications.<\/p>\n

Transactions on Knowledge and Data Engineering. Deep Learning Models – Can handle large and complex networks – Require large amounts of data for training Hamilton, Ying, & Leskovec, (2017). – Can consider multiple types of features – Can capture non-linear relationships – Computationally expensive Representation learning on graphs: Methods and applications. Data Engineering Bulletin. APPLICATIONS OF GCNNs FOR LINK GCNNs have proven to be effective in predicting links in social networks due to their ability to model intricate node interactions and capture complex network structures.<\/p>\n

The following are some examples of GCNN applications for link prediction in social networks: 1. Recommender Systems: GCNNs have been used in recommender systems to predict links between users and items. For example, a study by Ying et al. (2018) used GCNNs to model user-item interactions in the MovieLens dataset, achieving state-of-the-art performance in recommendation accuracy.<\/p>\n

2. Social Media Analysis: The use of GCNNs has been implemented for predicting links within social media networks, including Facebook and Twitter. One instance is a research conducted by Kipf and Welling in 2017, which utilized GCNNs to forecast retweeting actions on Twitter.<\/p>\n

\n

Published in the United States of America by IGI Global (an imprint of IGI Global) 701 E. Chocolate Avenue Hershey PA 17033 Tel: 717-533-8845 Fax: 717-533-8661 E-mail: cust@igi-global.com Web site: http:\/\/www.igi- global.com\/reference Copyright \u00a9 2023 by IGI Global. All rights reserved. No part of this publication may be reproduced, stored or distributed in any form or by any means, electronic or mechanical, including photocopying, without written permission from the publisher.<\/p>\n

Product or company names used in this set are for identification purposes only. Inclusion of the names of the products or companies does not indicate a claim of ownership by IGI Global of the trademark or registered trademark. Library of Congress Cataloging-in-Publication Data Names: Kumar, Vinod, 1986- editor. | Rajput, Dharmendra Singh, 1985- editor.<\/p>\n

Title: Concepts and techniques of graph neural network \/ edited by Vinod Kumar, Dharmendra Singh Rajput. Description: Hershey, PA : Engineering Science Reference, [2023] | Includes bibliographical references and index. | Summary: “This book will aim to provide stepwise discussion; exhaustive literature review; detailed analysis and discussion; rigorous experimentation results, application-oriented approach that will be demonstrated with respect to applications of Graph Neural Network (GNN).<\/p>\n

It will be written to develop the understanding of concepts and techniques on GNN and to establish the familiarity of different real applications in various domains for GNN. Moreover, it will also cover the prevailing challenges and opportunities”– Provided by publisher. Identifiers: LCCN 2022052611 (print) | LCCN 2022052612 (ebook) | ISBN 9781668469033 (hardcover) | ISBN 9781668469040 (paperback) | ISBN 9781668469057 (ebook) Subjects: LCSH: Neural networks (Computer science) | Graph theory–Data processing.<\/p>\n

Classification: LCC QA76.87 .C66555 2023 (print) | LCC QA76.87 (ebook) | DDC 006.3\/2–dc23\/eng\/20221207 LC record available at https:\/\/lccn.loc.gov\/2022052611 LC ebook record available at https:\/\/lccn.loc.gov\/2022052612 This book is published under the IGI Global book series Advances in Systems Analysis, Software Engineering, and High Performance Computing (ASASEHPC) (ISSN: 2327-3453 eISSN: 2327-3461) British Cataloguing in Publication Data A Cataloguing in Publication record for this book is available from the British Library.<\/p>\n

All work contributed to this book is new, previously-unpublished material. The views expressed in this book are those of the authors, but not necessarily of the publisher.<\/p>\n<\/blockquote>\n

This is a short excerpt from the opening of “” by Unknown, quoted for review and introduction purposes. All rights belong to the copyright holders.<\/em><\/p>\n

\n
\n

Table of Contents<\/p>\nToggle<\/span><\/path><\/svg><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n