Information-theoretic feature selection with discrete \(k\)-median clustering

DOI10.1007/s10479-014-1589-3zbMath1478.62176OpenAlexW2032301335MaRDI QIDQ1639220

Elan Borenstein, Ya-Ju Fan, Onur Şeref, Wanpracha Art Chaovalitwongse

Publication date: 12 June 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1589-3

zbMATH Keywords

cluster analysisinformation theoryfeature selectiondiscrete clustering

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (4)

Automatic clustering algorithm for interval data based on overlap distance ⋮ Modeling the flow of information between financial time-series by an entropy-based approach ⋮ An automatic clustering for interval data using the genetic algorithm ⋮ Feature importance ranking for classification in mixed online environments

Uses Software

• Matlab
• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NP-hardness of Euclidean sum-of-squares clustering
• Bilinear separation of two sets in \(n\)-space
• A constant-factor approximation algorithm for the \(k\)-median problem
• Selective support vector machines
• Mathematical Programming Formulations and Algorithms for Discrete k-Median Clustering of Time-Series Data
• On the Complexity of Some Common Geometric Location Problems
• Novel Optimization Models for Abnormal Brain Activity Classification
• Introduction to Information Retrieval
• m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
• Least squares quantization in PCM
• Fibonacci heaps and their uses in improved network optimization algorithms
• On Information and Sufficiency

This page was built for publication: Information-theoretic feature selection with discrete \(k\)-median clustering