
Semi-Supervised Learning: Background, Applications and Future Directions
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
More details
Other editions
Additional editions

Content
- Intro
- SEMI-SUPERVISED LEARNINGBACKGROUND, APPLICATIONSAND FUTURE DIRECTIONS
- SEMI-SUPERVISED LEARNINGBACKGROUND, APPLICATIONSAND FUTURE DIRECTIONS
- CONTENTS
- PREFACE
- Introduction to This Book
- Target Audience
- Acknowledgments
- Chapter 1CONSTRAINED DATASELF-REPRESENTATIVE GRAPHCONSTRUCTION
- Abstract
- 1. Introduction
- 2. Constrained Data Self-Representative GraphConstruction
- 3. Kernelized Variants
- 3.1. Hilbert Space
- 3.2. Column Generation
- 4. Performance Evaluation
- 4.1. Label Propagation
- 4.1.1. Gaussian Random Fields
- 4.1.2. Local and Global Consistency
- 4.2. Experimental Results
- 4.2.1. Comparison among Several Graph Construction Methods
- 4.2.2. Stability of the Proposed Method
- 4.2.3. Sensitivity to Parameters
- 4.2.4. Computational Complexity and CPU Time
- Acknowledgments
- Conclusion
- References
- Chapter 2INJECTING RANDOMNESS INTO GRAPHS:AN ENSEMBLE SEMI-SUPERVISEDLEARNING FRAMEWORK
- Abstract
- 1. Introduction
- 2. Background
- 2.1. Graph-Based Semi-Supervised Learning
- 2.2. Ensemble Learning and Random Forests
- 2.3. Anchor Graph
- 3. Random Multi-Graphs
- 3.1. Problem Formulation
- 3.2. Algorithm
- 3.3. Graph Construction
- 3.4. Semi-Supervised Inference
- 3.5. Inductive Extension
- 3.6. Randomness as Regularization
- 4. Experiments
- 4.1. Data Sets
- 4.2. Experimental Results
- 4.3. Impact of Parameters
- 4.4. Hyperspectral Image Classification
- Acknowledgments
- Conclusion
- References
- Chapter 3LABEL PROPAGATION VIA KERNELFLEXIBLE MANIFOLD EMBEDDING
- Abstract
- 1. Introduction
- 2. RelatedWork
- 2.1. Semi-Supervised Discriminant Analysis
- 2.2. Semi-Supervised Discriminant Embedding
- 2.3. Laplacian Regularized Least Square
- 2.4. Review of the Flexible Manifold Embedding Framework
- 3. Kernel FlexibleManifold Embedding
- 3.1. The Objective Function
- 3.2. Optimal Solution
- 3.3. The Algorithm
- 3.4. Difference between KFME and Existing Methods
- 3.4.1. Difference between KFME and FME
- 3.4.2. Difference between KFME and Other Methods
- 4. Experimental Results
- 4.1. Datasets
- 4.2. Method Comparison
- 4.3. Results Analysis
- 4.4. Stability with Respect to Graph
- Acknowledgments
- Conclusion
- References
- Chapter 4FAST GRAPH-BASED SEMI-SUPERVISEDLEARNING AND ITS APPLICATIONS
- Abstract
- 1. Introduction
- 2. Related Work
- 2.1. Scalable Graph-Based SSL/TL Methods
- 2.2. Scalable Graph Construction Methods
- 2.3. Robust Graph-Based SSL/TL Methods
- 3. Minimum Tree Cut Method
- 3.1. Notations
- 3.2. The Proposed Method
- 3.3. The Tree Labeling Algorithm
- 3.4. Generate a Spanning Tree from a Graph
- 4. Insensitiveness to Graph Construction
- 5. Experiments
- 5.1. Data Set
- 5.1.1. UCI Data Set
- 5.1.2. Image
- 5.1.3. Text
- 5.2. Graph Construction
- 5.3. Accuracy
- 5.4. Speed
- 5.5. Robustness
- 5.6. Effect of Different Spanning Tree and Ensemble of MultipleSpanning Trees
- 6. Applications in Text Extraction
- 6.1. Interactive Text Extraction in Natural Scene Images
- 6.2. Document Image Binarization
- Conclusion and FutureWork
- References
- Chapter 5SEMI-SUPERVISED LEARNINGIN TWO-CLASS CLASSIFICATIONWITH A SCARCE POPULATION CLASS
- Abstract
- 1. Introduction
- 2. Semi-Supervised Learning
- 3. Signal Processing Framework
- 3.1. Receiver-Operating Characteristic Curves
- 3.2. Key Performance Indicators
- 4. Experiments and Results
- Conclusion and Future Research
- References
- Chapter 6SELF-TRAINING FIELD PATTERNPREDICTION BASED ON KERNEL METHODS
- Abstract
- 1. Introduction
- 1.1. Non-i.i.d. Prediction Scenarios
- 1.2. Research Literature
- 1.3. Field Support Vector Machine for Both Classificationand Regression
- 2. F-SVM Model
- 2.1. Basic Notations Involved
- 2.2. Model Definition
- 2.3. Alternative Optimization
- 2.3.1. Classifier Learning
- 2.3.2. SNT Learning
- 2.3.3. Convergence Property of the Optimization
- 2.4. Relationship with the MTL Model
- 3. Kernelization
- 3.1. Kernel Update for Classification Tasks
- 3.2. Kernel Update for Regression Tasks
- 4. Prediction Rules for Future Field Patterns
- 4.1. Singlet Prediction
- 4.1.1. Traditional Prediction Rule (TPR)
- 4.1.2. Voted Prediction Rule (VPR, for the Field ClassificationOnly)
- 4.1.3. Averaged Decision Rule (APR, for the Field Regression Only)
- 4.2. Field Prediction Rule (FPR)
- 4.3. Field Transfer Prediction Rule (FTPR)
- 4.3.1. Self-Training Based Transductive Learning
- 5. Statistical Performance Evaluation
- 5.1. Performance on the F-SVC Model
- 5.1.1. Face Classification across Head Poses
- 5.1.2. Speech Classification across Speakers
- 5.1.3. Chinese Handwriting Character Recognition acrossWriters
- 5.2. Performance on the F-SVR Model
- 5.2.1. Synthetic Data
- 5.2.2. School Effectiveness Data
- 5.3. Computer Survey Data
- 6. Visualized Performance Evaluation
- 6.1. Style Normalization with the Linear Kernel
- 6.1.1. Original Task of the Face Data
- 6.1.2. Reversed Task of the Face Data
- 6.1.3. Original Task of the Facial Expression Data
- 6.1.4. Reversed Task of the Facial Expression Data
- 6.2. Class Separability Improvement
- 7. Further Experimental Analysis
- 7.1. Experimental Analysis on the Convergence Property
- 7.2. Parameter Sensitivity
- Conclusion
- References
- Chapter 7SEMI-SUPERVISED LEARNING VIAMULTI-MODAL CURRICULUM GENERATION
- Abstract
- 1. Introduction
- 2. RelatedWork
- 2.1. Semi-Supervised Learning
- 2.2. Multi-Modal Learning
- 2.3. Curriculum Learning
- 2.4. Active Learning
- 3. The Proposed Approach
- 3.1. Single-Modal Curriculum Generation
- 3.2. Multi-Modal Curriculum Generation
- 3.3. Multi-Modal Classification with Feedback
- 4. Experimental Results
- 4.1. Algorithm Validation
- 4.2. Comparison with Other Methods
- 4.3. Parametric Sensitivity
- Conclusion
- References
- Chapter 8SEMI-SUPERVISED LEARNINGON BIG MULTIMEDIA DATAFOR SITUATION RECOGNITION
- Abstract
- 1. Examples of Evolving Situations
- 2. The Proposed Framework
- 2.1. Problem Formulation and Motivation
- 2.2. Semi-Supervised Learning Method for Unknown Labels
- 2.3. Noise Robust Semi-Supervised Learning Methods forUnknown Labels
- 2.4. Optimization Algorithm
- 3. Experiments
- 3.1. Data Preprocessing
- 3.2. Semi-Supervised Clustering with Unknown Labels
- 3.3. Evolving Situation Detection
- 4. Discussion
- References
- ABOUT THE EDITORS
- INDEX
- Blank Page
System requirements
File format: PDF
Copy-Protection: Adobe-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Install the free reader Adobe Digital Editions prior to download (see eBook Help).
- Tablet/smartphone (Android; iOS): Install the free app Adobe Digital Editions or the app PocketBook before downloading (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Adobe-DRM, a „hard” copy protection. If the necessary requirements are not met, unfortunately you will not be able to open the eBook. You will therefore need to prepare your reading hardware before downloading.
Please note: We strongly recommend that you authorise using your personal Adobe ID after installation of any reading software.
For more information, see our eBook Help page.