Pages that link to "Item:Q2499151"
From MaRDI portal
The following pages link to Mining market data: a network approach (Q2499151):
Displaying 50 items.
- A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
- On some statistical procedures for stock selection problem (Q276526) (← links)
- On multivariate network analysis of statistical data sets with different measures of association (Q276528) (← links)
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Robust identification in random variable networks (Q337687) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Asset portfolio optimization using support vector machines and real-coded genetic algorithm (Q454264) (← links)
- Detecting large risk-averse 2-clubs in graphs with random edge failures (Q513610) (← links)
- Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases (Q526417) (← links)
- Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- A network-based data mining approach to portfolio selection via weighted clique relaxations (Q744697) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- Statistical analysis of financial networks (Q957122) (← links)
- Synergies of operations research and data mining (Q976388) (← links)
- Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
- Statistical procedures for the market graph construction (Q1615123) (← links)
- Optimal decision for the market graph identification problem in a sign similarity network (Q1621915) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) (← links)
- Dynamics of cluster structure in financial correlation matrix (Q1694154) (← links)
- A network-based dynamic analysis in an equity stock market (Q1694200) (← links)
- Analyzing the stock market based on the structure of \textit{kNN} network (Q1755331) (← links)
- Measures of uncertainty in market network analysis (Q1783053) (← links)
- Resource pricing games on graphs: existence of Nash equilibria (Q1940431) (← links)
- Potential energy principles in networked systems and their connections to optimization problems on graphs (Q2018871) (← links)
- Networks of causal relationships in the U.S. stock market (Q2148732) (← links)
- Network models to improve robot advisory portfolios (Q2151657) (← links)
- Reliability of maximum spanning tree identification in correlation-based market networks (Q2158099) (← links)
- A clustering-based portfolio strategy incorporating momentum effect and market trend prediction (Q2201385) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
- The triangle \(k\)-club problem (Q2359790) (← links)
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems (Q2393069) (← links)
- A graph clustering algorithm based on a clustering coefficient for weighted graphs (Q2430549) (← links)
- Computational study of the US stock market evolution: a rank correlation-based network model (Q2438061) (← links)
- Simple measure of similarity for the market graph construction (Q2438062) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Comparative Analysis of Two Similarity Measures for the Market Graph Construction (Q2820106) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- On CLIQUE Problem for Sparse Graphs of Large Dimension (Q3463541) (← links)
