Jingjing Li – författare
1 326 kr
Skickas inom 10-15 vardagar
423 kr
Skickas inom 10-15 vardagar
450 kr
Skickas inom 10-15 vardagar
571 kr
Läs direkt efter köp
648 kr
Skickas inom 5-8 vardagar
450 kr
Skickas inom 10-15 vardagar
450 kr
Skickas inom 10-15 vardagar
571 kr
Läs direkt efter köp
This book illustrates how to achieve effective dimension reduction and data clustering. The authors explain how to accomplish this by utilizing the advanced dynamic graph learning technique in the era of big data. The book begins by providing background on dynamic graph learning. The authors discuss why it has attracted considerable research attention in recent years and has become well recognized as an advanced technique. After covering the key topics related to dynamic graph learning, the book discusses the recent advancements in the area. The authors then explain how these techniques can be practically applied for several purposes, including feature selection, feature projection, and data clustering.
450 kr
Skickas inom 10-15 vardagar
1 835 kr
Skickas inom 10-15 vardagar
2 373 kr
Läs direkt efter köp
Unsupervised domain adaptation (UDA) is a challenging problem in machine learning where the model is trained on a source domain with labeled data and tested on a target domain with unlabeled data. In recent years, UDA has received significant attention from the research community due to its applicability in various real-world scenarios. This book provides a comprehensive review of state-of-the-art UDA methods and explores new variants of UDA that have the potential to advance the field.
The book begins with a clear introduction to the UDA problem and is mainly organized into four technical sections, each focused on a specific piece of UDA research. The first section covers criterion optimization-based UDA, which aims to learn domain-invariant representations by minimizing the discrepancy between source and target domains. The second section discusses bi-classifier adversarial learning-based UDA, which creatively leverages adversarial learning by conducting a minimax game between the feature extractor and two task classifiers. The third section introduces source-free UDA, a novel UDA setting that does not require any raw data from the source domain. The fourth section presents active learning for UDA, which combines domain adaptation and active learning to reduce the amount of labeled data needed for adaptation.
This book is suitable for researchers, graduate students, and practitioners who are interested in UDA and its applications in various fields, primarily in computer vision. The chapters are authored by leading experts in the field and provide a comprehensive and in-depth analysis of the current UDA methods and new directions for future research. With its broad coverage and cutting-edge research, this book is a valuable resource for anyone looking to advance their knowledge of UDA.1 890 kr
Skickas inom 10-15 vardagar