Mathematical programming formulations and algorithms for discrete κ-median clustering of time-series data

INFORMS Journal on Computing

Volumn 26, Issue 1, 2014, Pages 160-172

  Seref, Onur ^a   Fan, Ya Ju ^b   Chaovalitwongse, Wanpracha Art ^c,d  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

^d UNIVERSITY OF WASHINGTON SCHOOL OF MEDICINE   (United States)

Author keywords

Clustering; Discrete k median; Mixed integer programming; Optimization; Sequential optimization; Time series; Uncoupled bilinear program algorithm

Indexed keywords

CLASSIFICATION ACCURACY; CLUSTERING; HIERARCHICAL CLUSTER TREES; K-MEDIAN; MIXED-INTEGER PROGRAMMING; NORMALIZED MUTUAL INFORMATION; REAL-LIFE APPLICATIONS; SEQUENTIAL OPTIMIZATION;

APPROXIMATION ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMBINATORIAL OPTIMIZATION; HIERARCHICAL SYSTEMS; INTEGER PROGRAMMING; MATRIX ALGEBRA; OPTIMIZATION; TIME SERIES;

CLUSTERING ALGORITHMS;

EID: 84890504998     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.2013.0554     Document Type: Article

References (31)

1. Ackermann MR, Blömer J, Sohler C (2010) Clustering for metric and nonmetric distance measures. ACM Transactions on Algorithms 6(4):59:1-59:26.
2. Aloise D, Deshpande A, Hansen P, Popat P (2009) NP-hardness of Euclidean sum-of-squares clustering. Machine Learn. 75(2): 245-248.
3. Asuncion A, Newman DJ (2007) UCI machine learning repository. Accessed October 10, 2010, http://www.ics.uci.edu/-mlearn/MLRepository.html.
4. Banerjee A, Merugu S, Dhillon IS, Ghosh J (2005) Clustering with Bregman divergences. J. Machine Learn. Res. 6(12):1705-1749.
5. Bennett KP, Mangasarian OL (1993) Bilinear separation of two sets in n-space. Comput. Optim. Appl. 2(3):207-227.
6. Berndt DJ, Clifford J (1994) Using DTW to find patterns in time series. Fayyad UM, Uthurusamy R, eds. Proc. KDD-94: AAAI Workshop on Knowledge Discovery in Databases (AAAI Press, Palo Alto, CA), 359-370.
7. Bradley PS, Mangasarian OL, Street WN (1997) Clustering via concave minimization. Advances in Neural Information Processing Systems, Vol. 9 (MIT Press, Cambridge, MA), 368-374.
8. Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2):387-405.
9. Campbell JF (1996) Hub location and the p-hub median problem. Oper. Res. 44(6):923-935.
10. Chaovalitwongse WA, Fan YJ, Sachdeo RC (2007) On the time series k-nearest neighbor for abnormal brain activity classification. IEEE Trans. Systems, Man, Cybernetics, Part A: Systems and Humans 37(6):1005-1016.
11. Chaovalitwongse WA, Fan Y-J, Sachdeo RC (2008) Novel optimization models for abnormal brain activity classification. Oper. Res. 56(6):1450-1460.
12. Chaovalitwongse WA, Jeong YS, Jeong MK, Danish SF, Wong S (2011) Pattern recognition approaches for identifying subcortical targets during deep brain stimulation surgery. IEEE Intelligent Systems 26(5):54-63.
13. Fredman ML, Tarjan RR (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3):596-615.
14. Garey MR, Johnson DS (1979) Computers and Intractibility: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco).
15. Iasemidis LD, Shiau D-S, Chaovalitwongse W, Sackellares JC, Pardalos PM, Carney PR, Principe JC, Prasad A, Veeramani B, Tsakalis K (2003) Adaptive epileptic seizure prediction system. IEEE Trans. Bio-medical Engrg. 50(5):616-627.
16. Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48(2):274-296.
17. Kaufman L, Rousseeuw PJ (2005) Finding Groups in Data (John Wiley & Sons, Hoboken, NJ).
18. Keogh E, Ratanamahatana CA (2005) Exact indexing of dynamic time warping. Knowledge Inform. Systems 7(3):358-386.
19. Keogh E, Xi X, Wei L, Ratanamahatana CA (2006a) The UCR time series classification/clustering. http://www.cs.ucr.edu/-eamonn/time-series-data.
20. Keogh E, Wei L, Xi X, Lee S-H, Vlachos M (2006b) Lb-keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures. Dayal U, Whang K-Y, Lomet DB, Alonso G, Lohman GM, Kersten ML et al., eds. VLDB '06: Proc. 32nd Internat. Conf. Very Large Data Bases (VLDB Endowment) (ACM, New York), 882-893.
21. Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Management Sci. 9(4):643-666.
22. Lloyd SP (1982) Least squares quantization in PCM. IEEE Trans. Inform. Theory 28(2):129-137.
23. Manning CD, Raghavan P, Schütze H (2008) Introduction to Information Retrieval (Cambridge University Press, Cambridge, UK).
24. Megiddo N, Supowit KJ (1984) On the complexity of some common geometric location problems. SIAM J. Comput. 13(1):182-196.
25. ReVelle C, Swain R (1970) Central facilities location. Geographical Anal. 2(1):30-42.
26. Rodriguez A, Chaovalitwongse W, Liang Z, Singhal H, Pham H (2010) Master defect record retrieval using network-based feature association. IEEE Trans. Systems, Man, Cybernetics, Part C: Appl. Rev. 40(3):319-329.
27. Sneath PHA, Sokal RR (1973) Numerical Taxonomy: The Principles and Practice of Numerical Classification (W. H. Freeman, San Francisco).
28. Suo H, Nie K, Sun X, Wang Y (2008) One optimized choosing method of k-means document clustering center. Information Retrieval Technology, Lecture Notes in Computer Science, Vol. 4993 (Springer, Heidelberg), 490-495.
29. Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper. Res. 16(5):955-961.
30. Wang S, Chaovalitwongse W, Wong S (2013) A gradient-based adaptive learning framework for online seizure prediction. Internat. J. Data Mining Bioinformatics. Forthcoming.
31. Wang S, Lin CJ, Wu C, Chaovalitwongse W (2011) Early detection of numerical typing errors using data mining techniques. IEEE Trans. Systems, Man, Cybernetics, Part A: Systems and Humans 41(6):1199-1212.