z-logo
Premium
Clustering of trend data using joinpoint regression models
Author(s) -
Kim HyuneJu,
Luo Jun,
Kim Jeankyung,
Chen HuannSheng,
Feuer Eric J.
Publication year - 2014
Publication title -
statistics in medicine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.996
H-Index - 183
eISSN - 1097-0258
pISSN - 0277-6715
DOI - 10.1002/sim.6221
Subject(s) - cluster analysis , segmented regression , consistency (knowledge bases) , computer science , mathematics , data mining , regression analysis , permutation (music) , piecewise , statistics , algorithm , artificial intelligence , nonlinear regression , physics , acoustics , mathematical analysis
In this paper, we propose methods to cluster groups of two‐dimensional data whose mean functions are piecewise linear into several clusters with common characteristics such as the same slopes. To fit segmented line regression models with common features for each possible cluster, we use a restricted least squares method. In implementing the restricted least squares method, we estimate the maximum number of segments in each cluster by using both the permutation test method and the Bayes information criterion method and then propose to use the Bayes information criterion to determine the number of clusters. For a more effective implementation of the clustering algorithm, we propose a measure of the minimum distance worth detecting and illustrate its use in two examples. We summarize simulation results to study properties of the proposed methods and also prove the consistency of the cluster grouping estimated with a given number of clusters. The presentation and examples in this paper focus on the segmented line regression model with the ordered values of the independent variable, which has been the model of interest in cancer trend analysis, but the proposed method can be applied to a general model with design points either ordered or unordered. Copyright © 2014 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here