Kernel penalized K-means: a feature selection method based on kernel K-means

DOI10.1016/J.INS.2015.06.008zbMath1390.68545OpenAlexW579153682MaRDI QIDQ1750032

Sebastián Maldonado, Emilio Carrizosa, Richard R. Weber

Publication date: 17 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/107712

zbMATH Keywords

clusteringfeature selectionkernel K-means

Mathematics Subject Classification ID

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

Related Items (5)

Variable selection for Naïve Bayes classification ⋮ Image based techniques for crack detection, classification and quantification in asphalt pavement: a review ⋮ Tuning kernel parameters for SVM based on expected square distance ratio ⋮ Remote sensing image classification based on the optimal support vector machine and modified binary coded ant colony optimization algorithm ⋮ Maximum relevance minimum common redundancy feature selection for nonlinear data

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unsupervised clustering and feature weighting based on generalized Dirichlet mixture modeling
• Pattern classification in DNA microarray data of multiple tumor types
• Greedy Feature Selection for Subspace Clustering
• 10.1162/153244303322753706
• Nonlinear Dimensionality Reduction

This page was built for publication: Kernel penalized K-means: a feature selection method based on kernel K-means