A network-based data mining approach to portfolio selection via weighted clique relaxations
Publication:744697
DOI10.1007/s10479-013-1395-3zbMath1296.90015OpenAlexW2033244732MaRDI QIDQ744697
Oleg Shirokikh, Svyatoslav Trukhanov, Jaime Gil Lafuente, Vladimir L. Boginski, Sergiy I. Butenko
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1395-3
cliqueclique relaxationscohesive network clustersdiversified portfoliosmarket graphmaximum-weight s-plexnetwork-based data mining
Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Portfolio theory (91G10)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Statistical analysis of financial networks
- Products of trees for investment analysis
- On clique relaxation models in network analysis
- Computational study of the US stock market evolution: a rank correlation-based network model
- Wavelet-based detection of outliers in financial time series
- Mining market data: a network approach
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- A graph‐theoretic generalization of the clique concept
- The Structure and Function of Complex Networks
- Introduction to Econophysics
This page was built for publication: A network-based data mining approach to portfolio selection via weighted clique relaxations