Advances in graph-based natural language processing (NLP) and information retrieval tasks have shown the importance of processing using the Graph of Words method. This book covers recent concrete information, from the basics to advanced level, about graph-based learning, such as neural network-based approaches, computational intelligence for learning parameters and feature reduction, and network science for graph-based NPL. It also contains information about language generation based on graphical theories and language models.
Features:
This book is aimed at researchers and graduate students in computer science, natural language processing, and deep and machine learning.
| ISBN: | 9781032224572 |
| Publication date: | 7th October 2024 |
| Author: | Muskan Garg, Amit Kumar Gupta, Rajesh Prasad |
| Publisher: | CRC Press |
| Format: | Paperback |
| Pagination: | 256 pages |
| Series: | Computational Intelligence Techniques |
| Genres: |
Natural language and machine translation Machine learning Applied computing |
Advances in graph-based natural language processing (NLP) and information retrieval tasks have shown the importance of processing using the Graph of Words method. This book covers recent concrete information, from the basics to advanced level, about graph-based learning, such as neural network-based approaches, computational intelligence for learning parameters and feature reduction, and network science for graph-based NPL.
Graph Learning and Network Science for Natural Language Processing features in the following genres: Natural language and machine translation, Machine learning, Applied computing
Paperback, Hardback. £45.89, down from the £50.99 cover price. Not Available.
Graph Learning and Network Science for Natural Language Processing was written by Muskan Garg, Amit Kumar Gupta, Rajesh Prasad and published by CRC Press
Graph Learning and Network Science for Natural Language Processing has 256 pages
Yes it is part of Computational Intelligence Techniques series
£45.89, reduced from £50.99. Not Available.