A novel auto-pruned ensemble clustering via SOCP

被引:0
作者
Ucuncu, Duygu [1 ,2 ]
Akyuz, Sureyya [1 ]
Gul, Erdal [2 ]
机构
[1] Bahcesehir Univ, Fac Engn & Nat Sci, Dept Math, TR-34353 Istanbul, Turkiye
[2] Yildiz Tech Univ, Fac Arts & Sci, Dept Math, TR-34220 Istanbul, Turkiye
关键词
Strategic decision support; Ensemble clustering; Auto-pruning; Machine learning; Second order conic programming;
D O I
10.1007/s10100-023-00887-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Operations Research (OR) plays a crucial role in strategic decision-making in today's business world; it uses complex algorithms and data analytic to provide decision-makers with the necessary information. The proposed study presents a novel ensemble clustering for decision making in various disciplines including OR problems which introduce a second-order conic optimization model. This method provides a significant advantage over the traditional difference of convex programming by continuously and convexly solving integer programming. The model optimizes the balance between accuracy and diversity, resulting in the selection of the best candidates for prediction. The study's remarkable contribution lies in the automatic sub-ensemble selection while optimizing for accuracy and diversity. The model has been verified using real data and achieves competitive prediction performance. Furthermore, this approach illustrates how OR can be utilized to enhance ensemble clustering and decision-making.
引用
收藏
页码:819 / 841
页数:23
相关论文
共 54 条
  • [31] Lu Z., 2010, P 16 ACM SIGKDD INT, P871
  • [32] Martínez-Muñoz G, 2004, PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND APPLICATIONS, VOLS 1AND 2, P258
  • [33] An Analysis of Ensemble Pruning Techniques Based on Ordered Aggregation
    Martinez-Munoz, Gonzalo
    Hernandez-Lobato, Daniel
    Suarez, Alberto
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2009, 31 (02) : 245 - 259
  • [34] A new second-order cone programming relaxation for max-cut problems
    Muramatsu, M
    Suzuki, T
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2003, 46 (02) : 164 - 177
  • [35] Nesterov Y., 1994, Interior-Point Polynomial Algorithmsin Convex Programming
  • [36] Ng AY, 2002, ADV NEUR IN, V14, P849
  • [37] Ensemble cluster pruning via convex-concave programming
    Ozogur-Akyuz, Sureyya
    Otar, Buse Cisil
    Atas, Pinar Karadayi
    [J]. COMPUTATIONAL INTELLIGENCE, 2020, 36 (01) : 297 - 319
  • [38] An ensemble uncertainty aware measure for directed hill climbing ensemble pruning
    Partalas, Ioannis
    Tsoumakas, Grigorios
    Vlahavas, Ioannis
    [J]. MACHINE LEARNING, 2010, 81 (03) : 257 - 282
  • [39] Clustering mixed-type player behavior data for churn prediction in mobile games
    Perisic, Ana
    Pahor, Marko
    [J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2023, 31 (01) : 165 - 190
  • [40] Polikar R., 2006, IEEE Circuits and Systems Magazine, V6, P21, DOI 10.1109/MCAS.2006.1688199