Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ohishi, M., Oda, R.
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2509.11103
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912585690906624
author Ohishi, M.
Oda, R.
author_facet Ohishi, M.
Oda, R.
contents The kick-one-out (KOO) method is a variable selection method based on a model selection criterion. The method is very simple, and yet it has consistency in variable selection under a high-dimensional asymptotic framework with a specific model selection criterion. This paper proposes the join-twotogether (JTT) method, which is a clustering method based on the KOO method for group-wise linear regression with graph structure. The JTT method formulates the clustering problem as an edge selection problem for a graph and determines whether to select each edge based on the KOO method. We can employ network Lasso to perform such a clustering. However, network Lasso is somewhat cumbersome because there is no good algorithm for solving the associated optimization problem and the tuning is complicated. Therefore, by deriving a model selection criterion such that the JTT method has consistency in clustering under a high-dimensional asymptotic framework, we propose a simple yet powerful method that outperforms network Lasso.
format Preprint
id arxiv_https___arxiv_org_abs_2509_11103
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle KOO Method-based Consistent Clustering for Group-wise Linear Regression with Graph Structure
Ohishi, M.
Oda, R.
Methodology
62J05
G.3
The kick-one-out (KOO) method is a variable selection method based on a model selection criterion. The method is very simple, and yet it has consistency in variable selection under a high-dimensional asymptotic framework with a specific model selection criterion. This paper proposes the join-twotogether (JTT) method, which is a clustering method based on the KOO method for group-wise linear regression with graph structure. The JTT method formulates the clustering problem as an edge selection problem for a graph and determines whether to select each edge based on the KOO method. We can employ network Lasso to perform such a clustering. However, network Lasso is somewhat cumbersome because there is no good algorithm for solving the associated optimization problem and the tuning is complicated. Therefore, by deriving a model selection criterion such that the JTT method has consistency in clustering under a high-dimensional asymptotic framework, we propose a simple yet powerful method that outperforms network Lasso.
title KOO Method-based Consistent Clustering for Group-wise Linear Regression with Graph Structure
topic Methodology
62J05
G.3
url https://arxiv.org/abs/2509.11103