A partitioning method for training data based on clusters in min-max modular networks

MaRDI QIDQ4901592zbMATH OpenFDO

Authors Xiaomin Xie, Yun Li

Publication date 24 January 2013

zbMATH Keywords

bisecting \(K\)-meansmin-max modular networkpartitioning methodsupport vector machine

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm
• A fast SVM training algorithm based on the set segmentation and k-means clustering
• An improved branch-and-bound clustering approach for data partitioning
• Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification
• Optimization strategies for two-mode partitioning

Cited in

(2)

• Molecular dynamic algorithms for data partition
• A matrix modular neural network based on task decomposition with subspace division by adaptive affinity propagation clustering

This page was built for publication: A partitioning method for training data based on clusters in min-max modular networks

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