Convex Optimization for Group Feature Selection in Networked Data
From MaRDI portal
Publication:5139860
DOI10.1287/ijoc.2018.0868zbMath1451.90034OpenAlexW2958632116WikidataQ127455225 ScholiaQ127455225MaRDI QIDQ5139860
Hasan Manzour, Dae Han Won, Wanpracha Art Chaovalitwongse
Publication date: 11 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0868
classificationconvex optimizationsemi-infinite programmingsupport vector machinesmultiple kernel learning
Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Deterministic network models in operations research (90B10) Semi-infinite programming (90C34)
Related Items
L0-Regularized Learning for High-Dimensional Additive Hazards Regression ⋮ Evaluating and selecting features via information theoretic lower bounds of feature inner correlations for high-dimensional data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- Best subset selection via a modern optimization lens
- Integer programming models for feature selection: new extensions and a randomized solution algorithm
- Feature selection for support vector machines via mixed integer linear programming
- On solving large-scale finite minimax problems using exponential smoothing
- Tree-guided group lasso for multi-response regression with structured sparsity, with an application to eQTL mapping
- On general minimax theorems
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- A note on adaptive group Lasso
- Clustering and domination in perfect graphs
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- \(l_{0}\)-norm based structural sparse least square regression for feature selection
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
- Detecting high log-densities
- A New Exchange Method for Convex Semi-Infinite Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
- Sparsity and Smoothness Via the Fused Lasso
- 10.1162/153244303322753616
- 10.1162/153244303322753706
- 10.1162/153244303322753751
- Sparse Approximate Solutions to Linear Systems
- OnL1-Norm Multiclass Support Vector Machines
- Group Variable Selection Methods and Their Applications in Analysis of Genomic Data
- Model Selection and Estimation in Regression with Grouped Variables
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
