Clusterwise Regression Using Dirichlet Mixtures

被引:0
|
作者
Kang, Changku [1 ]
Ghosal, Subhashis [2 ]
机构
[1] Bank Korea, Econ Stat Dept, 110,3 Ga, Seoul, South Korea
[2] North Carolina State Univ, Dept Stat, Raleigh, NC 27695 USA
关键词
D O I
暂无
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The article describes a method of estimating nonparametric regression function through Bayesian clustering. The basic working assumption in the underlying method is that the population is a union of several hidden subpopulations in each of which a different linear regression is in force and the overall nonlinear regression function arises as a result of superposition of these linear regression functions. A Bayesian clustering technique based on Dirichlet mixture process is used to identify clusters which correspond to samples from these hidden subpopulations. The clusters are formed automatically within a Markov chain Monte-Carlo scheme arising from a Dirichlet mixture process prior for the density of the regressor variable. The number of components in the mixing distribution is thus treated as unknown allowing considerable flexibility in modeling. Within each cluster, we estimate model parameters by the standard least square method or some of its variations. Automatic model averaging takes care of the uncertainty in classifying a new observation to the obtained clusters. As opposed to most commonly used nonparametric regression estimates which break up the sample locally, our method splits the sample into a number of subgroups not depending on the dimension of the regressor variable. Thus our method avoids the curse of dimensionality problem. Through extensive simulations, we compare the performance of our proposed method with that of commonly used nonparametric regression techniques. We conclude that when the model assumption holds and the subpopulation are not highly overlapping, our method has smaller estimation error particularly if the dimension is relatively large.
引用
收藏
页码:305 / +
页数:3
相关论文
共 50 条
  • [41] Comprehensive Clusterwise Linear Regression for Pavement Management Systems
    Khadka, Mukesh
    Paz, Alexander
    JOURNAL OF TRANSPORTATION ENGINEERING PART B-PAVEMENTS, 2017, 143 (04)
  • [42] An algorithm for clusterwise linear regression based on smoothing techniques
    Adil M. Bagirov
    Julien Ugon
    Hijran G. Mirzayeva
    Optimization Letters, 2015, 9 : 375 - 390
  • [43] Methods and Applications of Clusterwise Linear Regression: A Survey and Comparison
    Long, Qiang
    Bagirov, Adil
    Taheri, Sona
    Sultanova, Nargiz
    Wu, Xue
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2022, 17 (03)
  • [44] An ECG Segmentation Method Based on GMM and Clusterwise Regression
    Li, Min
    Chan, Raymond
    Huang, Yumei
    Zeng, Tieyong
    COMMUNICATIONS ON APPLIED MATHEMATICS AND COMPUTATION, 2025,
  • [45] A SIMULATED ANNEALING METHODOLOGY FOR CLUSTERWISE LINEAR-REGRESSION
    DESARBO, WS
    OLIVER, RL
    RANGASWAMY, A
    PSYCHOMETRIKA, 1989, 54 (04) : 707 - 736
  • [46] A weighted least-squares approach to clusterwise regression
    Schlittgen, Rainer
    ASTA-ADVANCES IN STATISTICAL ANALYSIS, 2011, 95 (02) : 205 - 217
  • [47] Explaining Heterogeneity in Pavement Deterioration: Clusterwise Linear Regression Model
    Zhang, Weizeng
    Durango-Cohen, Pablo L.
    JOURNAL OF INFRASTRUCTURE SYSTEMS, 2014, 20 (02)
  • [48] Improving the Interpretability of Data-Driven Models for Additive Manufacturing Processes Using Clusterwise Regression
    Mattera, Giulio
    Piscopo, Gianfranco
    Longobardi, Maria
    Giacalone, Massimiliano
    Nele, Luigi
    MATHEMATICS, 2024, 12 (16)
  • [49] Mathematical programming approach to clusterwise regression model and its extensions
    Department of Marketing, Faculty of Business Administration, Chinese University of Hong Kong, Hong Kong, Hong Kong
    不详
    不详
    Eur J Oper Res, 3 (640-652):
  • [50] Nonsmooth Optimization Algorithm for Solving Clusterwise Linear Regression Problems
    Adil M. Bagirov
    Julien Ugon
    Hijran G. Mirzayeva
    Journal of Optimization Theory and Applications, 2015, 164 : 755 - 780