No label defined (Q5214254)

From MaRDI portal

Revision as of 17:00, 21 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7164760

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7164760

Statements

scholarly article

0 references

James M. Murphy

0 references

0 references

publication date

7 February 2020

0 references

full work available at URL

https://arxiv.org/abs/1810.06702

0 references

http://jmlr.csail.mit.edu/papers/v20/18-873.html

0 references

zbMATH Keywords

unsupervised learning

0 references

clustering

0 references

spectral graph theory

0 references

manifold learning

0 references

diffusion geometry

0 references

MaRDI profile type

MaRDI publication profile

0 references

Finding sparse cuts locally using evolving sets

0 references

Local Partitioning for Directed Graphs Using PageRank

0 references

Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions

0 references

Spectral clustering based on local linear approximations

0 references

0 references

0 references

Statistical inference on random dot product graphs: a survey

0 references

Laplacian Eigenmaps for Dimensionality Reduction and Data Representation

0 references

Learning Theory

0 references

The exact constant for the ℓ_1-ℓ_2 norm inequality

0 references

Foundations of a multi-way spectral clustering framework for hybrid linear modeling

0 references

0 references

0 references

Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps

0 references

Diffusion Maps, Reduction Coordinates, and Low Dimensional Representation of Stochastic Systems

0 references

Two faces of active learning

0 references

0 references

Large deviations

0 references

Comparison theorems for reversible Markov chains

0 references

Geometric bounds for eigenvalues of Markov chains

0 references

The elements of statistical learning. Data mining, inference, and prediction

0 references

The estimation of the gradient of a density function, with applications in pattern recognition

0 references

Consistency of Cheeger and Ratio Graph Cuts

0 references

Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator

0 references

Stochastic methods. A handbook for the natural and social sciences

0 references

Normalized Cuts Are Approximately Inverse Exit Times

0 references

Non-Parametric Inference for Density Modes

0 references

Consistency of Single Linkage for High-Density Clusters

0 references

Approximating the Permanent

0 references

Manifold parametrizations by eigenfunctions of the Laplacian and heat kernels

0 references

Learning the geometry of common latent variables using alternating-diffusion

0 references

0 references

Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering

0 references

0 references

Good (K-means) clusterings are unique (up to small perturbations)

0 references

Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems

0 references

Clustering subgaussian mixtures by semidefinite programming

0 references

The geometry of kernelized spectral clustering

0 references

Data spectroscopy: eigenspaces of convolution operators and clustering

0 references

Aggregation of Variables in Dynamic Systems

0 references

Approximate counting, uniform generation and rapidly mixing Markov chains

0 references

Non-linear independent component analysis with diffusion maps

0 references

Vector diffusion maps and the connection Laplacian

0 references

Spectral convergence of the connection Laplacian from random samples

0 references

Robust subspace clustering

0 references

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

0 references

A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning

0 references

Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems

0 references

0 references

0 references

Latent common manifold learning with alternating diffusion: analysis and applications

0 references

0 references

Hybrid linear modeling via local best-fit flats

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5214254

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5214254&oldid=36559325"