Adaptive edge weighting for graph-based learning algorithms

DOI10.1007/s10994-016-5607-3zbMath1453.68152OpenAlexW2552833909MaRDI QIDQ2361579

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

clusteringsemi-supervised learninggraph-based learningedge weightingmanifold assumption

Mathematics Subject Classification ID

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

Related Items (3)

Laplacian-optimized diffusion for semi-supervised learning ⋮ On tuning a mean-field model for semi-supervised classification ⋮ Refined Spectral Clustering via Embedded Label Propagation

Uses Software

• UCI-ml
• ElemStatLearn
• SGTlight
• COIL-20

Cites Work

• Consistency of spectral clustering
• 10.1162/153244304322972667
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• A BERRY-ESSEEN TYPE BOUND OF REGRESSION ESTIMATOR BASED ON LINEAR PROCESS ERRORS
• Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
• How the result of graph clustering methods depends on the construction of the graph
• The elements of statistical learning. Data mining, inference, and prediction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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