Adaptive Convex Clustering of Generalized Linear Models With Application in Purchase Likelihood Prediction

DOI10.1080/00401706.2020.1733094MaRDI QIDQ6631878zbMATH OpenFDO

Authors Huijing Jiang, Xinwei Deng

Publication date 1 November 2024

Published in Technometrics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00401706.2020.1733094

Mathematics Subject Classification ID

Applications of statistics (62Pxx)

Cites work

• Adaptive Lasso estimators for ultrahigh dimensional generalized linear models
• Algorithm AS 136: A K-Means Clustering Algorithm
• Convex clustering via l₁ fusion penalization
• CVXPY: a Python-embedded modeling language for convex optimization
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Hierarchical clustering schemes
• High-dimensional graphs and variable selection with the Lasso
• New developments and techniques in structural equation modeling
• Statistical properties of convex clustering
• The Adaptive Lasso and Its Oracle Properties
• The proximal distance algorithm

Cited in

(3)

• Self-supervised cross validation using data generation structure
• On convex clustering: convexity, bounding balls and characteristics
• Data-driven segmentation of observation-level logistic regression models

This page was built for publication: Adaptive Convex Clustering of Generalized Linear Models With Application in Purchase Likelihood Prediction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631878)