Recursive kernel trick for network segmentation

DOI10.1002/RNC.1723MaRDI QIDQ3098505zbMATH OpenOpenAlexFDO

Authors

Publication date 17 November 2011

Published in International Journal of Robust and Nonlinear Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rnc.1723

zbMATH Keywords

sparsitygraph partitioningkernel \(K\)-meanscomputational savingcluster discoverynetwork segmentationrecursive kernel trick

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A distributed framework for trimmed kernel \(k\)-means clustering
• Fast kernel \(k\)-means clustering using incomplete Cholesky factorization
• KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS
• A kernel based clustering algorithm using particle swarm optimization
• A survey of kernel and spectral methods for clustering

Cited in

(3)

• K-Net Recursion in Perlean Hierarchical Structure
• Fast kernel \(k\)-means clustering using incomplete Cholesky factorization
• A distributed framework for trimmed kernel \(k\)-means clustering

This page was built for publication: Recursive kernel trick for network segmentation

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