Mathematical Programming Formulations and Algorithms for Discrete k-Median Clustering of Time-Series Data

DOI10.1287/ijoc.2013.0554zbMath1356.62082OpenAlexW2106777604MaRDI QIDQ2967621

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

Publication date: 1 March 2017

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2013.0554

zbMATH Keywords

optimizationtime seriesclusteringmixed-integer programmingsequential optimizationdiscrete \(k\)-medianuncoupled bilinear program algorithm

Mathematics Subject Classification ID

Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Mixed integer programming (90C11)

Related Items (2)

Information-theoretic feature selection with discrete \(k\)-median clustering ⋮ Identifying Fixations in Gaze Data via Inner Density and Optimization

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• NP-hardness of Euclidean sum-of-squares clustering
• Bilinear separation of two sets in \(n\)-space
• Integer programming formulations of discrete hub location problems
• Clustering for metric and nonmetric distance measures
• On the Complexity of Some Common Geometric Location Problems
• Novel Optimization Models for Abnormal Brain Activity Classification
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Hub Location and the p-Hub Median Problem
• Least squares quantization in PCM
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

This page was built for publication: Mathematical Programming Formulations and Algorithms for Discrete k-Median Clustering of Time-Series Data