Adaptive edge weighting for graph-based learning algorithms

DOI10.1007/S10994-016-5607-3MaRDI QIDQ2361579zbMATH OpenOpenAlexFDO

Authors Masayuki Karasuyama, Hiroshi Mamitsuka

Publication date 30 June 2017

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-016-5607-3

zbMATH Keywords

clusteringedge weightinggraph-based learningmanifold assumptionsemi-supervised learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A Weight-Adaptive Laplacian Embedding for Graph-Based Clustering
• Properly-weighted graph Laplacian for semi-supervised learning
• Efficient dynamic graph construction for inductive semi-supervised learning
• A multilevel approach for learning from labeled and unlabeled data on graphs
• Semi-supervised learning with local and global consistency

Cites work

• 10.1162/153244304322972667
• A BERRY-ESSEEN TYPE BOUND OF REGRESSION ESTIMATOR BASED ON LINEAR PROCESS ERRORS
• Consistency of spectral clustering
• How the result of graph clustering methods depends on the construction of the graph
• scientific article; zbMATH DE number 3942813 (Why is no real title available?)
• scientific article; zbMATH DE number 1829714 (Why is no real title available?)
• scientific article; zbMATH DE number 6253975 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Learning spectral clustering, with application to speech separation
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
• The elements of statistical learning. Data mining, inference, and prediction

Cited in

(7)

• Laplacian-optimized diffusion for semi-supervised learning
• Efficient dynamic graph construction for inductive semi-supervised learning
• Discriminative clustering on manifold for adaptive transductive classification
• Advantages of edge-centric collective dynamics in machine learning tasks
• On tuning a mean-field model for semi-supervised classification
• Refined spectral clustering via embedded label propagation
• Interplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithm

Describes a project that uses

Uses Software

• ElemStatLearn
• UCI
• SGTlight
• COIL-20

This page was built for publication: Adaptive edge weighting for graph-based learning algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361579)