Haoming Shen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Haoming Shen has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Ruiwei Jiang
Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, USA
2 shared publications - Aristotelis Leventidis
Northeastern University, Boston, MA, USA
1 shared publication - Danai Koutra
University of Michigan
1 shared publication - Di Jin
University of Michigan
1 shared publication - Junyue Wu
Department of Computer Science and Engineering, University of Michigan, Ann Arbor, MI 48109, USA
1 shared publication - Ruowang Zhang
Department of Computer Science and Engineering, University of Michigan, Ann Arbor, MI 48109, USA
1 shared publication
Latest Publications
- Open Access
Chance-Constrained Set Covering with Wasserstein Ambiguity
We study a generalized distributionally robust chance-constrained set covering problem (DRC) with a Wasserstein ambiguity set, where both decisions and uncertainty are binary-valued. We establish the NP-hardness of DRC and recast it as a two-stage stochastic program, which facilitates decomposition algorithms. Furthermore, we derive two families of valid inequalities. The first family targets the hypograph of a "shifted" submodular function, which is associated with each scenario of the two-stage reformulation. We show that the valid inequalities give a complete description of the convex hull of the hypograph. The second family mixes inequalities across multiple scenarios and gains further strength via lifting. Our numerical experiments demonstrate the reliability of the DRC model and the effectiveness of our proposed reformulation and valid inequalities.
Open AccessChance-Constrained Set Covering with Wasserstein Ambiguity
We study a generalized distributionally robust chance-constrained set covering problem (DRC) with a Wasserstein ambiguity set, where both decisions and uncertainty are binary-valued. We establish the NP-hardness of DRC and recast it as a two-stage stochastic program, which facilitates decomposition algorithms. Furthermore, we derive two families of valid inequalities. The first family targets the hypograph of a "shifted" submodular function, which is associated with each scenario of the two-stage reformulation. We show that the valid inequalities give a complete description of the convex hull of the hypograph. The second family mixes inequalities across multiple scenarios and gains further strength via lifting. Our numerical experiments demonstrate the reliability of the DRC model and the effectiveness of our proposed reformulation and valid inequalities.
- 21 March 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 198 (1) , 621-674
Chance-constrained set covering with Wasserstein ambiguity
- 21 March 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 198 (1) , 621-674
Chance-constrained set covering with Wasserstein ambiguity
- Open Access
- 18 July 2017
- Published by MDPI AG in Informatics
- Vol. 4 (3) , 22
PERSEUS-HUB: Interactive and Collective Exploration of Large-Scale Graphs
Graphs emerge naturally in many domains, such as social science, neuroscience, transportation engineering, and more. In many cases, such graphs have millions or billions of nodes and edges, and their sizes increase daily at a fast pace. How can researchers from various domains explore large graphs interactively and efficiently to find out what is ‘important’? How can multiple researchers explore a new graph dataset collectively and “help” each other with their findings? In this article, we present Perseus-Hub, a large-scale graph mining tool that computes a set of graph properties in a distributed manner, performs ensemble, multi-view anomaly detection to highlight regions that are worth investigating, and provides users with uncluttered visualization and easy interaction with complex graph statistics. Perseus-Hub uses a Spark cluster to calculate various statistics of large-scale graphs efficiently, and aggregates the results in a summary on the master node to support interactive user exploration. In Perseus-Hub, the visualized distributions of graph statistics provide preliminary analysis to understand a graph. To perform a deeper analysis, users with little prior knowledge can leverage patterns (e.g., spikes in the power-law degree distribution) marked by other users or experts. Moreover, Perseus-Hub guides users to regions of interest by highlighting anomalous nodes and helps users establish a more comprehensive understanding about the graph at hand. We demonstrate our system through the case study on real, large-scale networks.
- 18 July 2017
- Published by MDPI AG in Informatics
- Vol. 4 (3) , 22
Open AccessPERSEUS-HUB: Interactive and Collective Exploration of Large-Scale Graphs
Graphs emerge naturally in many domains, such as social science, neuroscience, transportation engineering, and more. In many cases, such graphs have millions or billions of nodes and edges, and their sizes increase daily at a fast pace. How can researchers from various domains explore large graphs interactively and efficiently to find out what is ‘important’? How can multiple researchers explore a new graph dataset collectively and “help” each other with their findings? In this article, we present Perseus-Hub, a large-scale graph mining tool that computes a set of graph properties in a distributed manner, performs ensemble, multi-view anomaly detection to highlight regions that are worth investigating, and provides users with uncluttered visualization and easy interaction with complex graph statistics. Perseus-Hub uses a Spark cluster to calculate various statistics of large-scale graphs efficiently, and aggregates the results in a summary on the master node to support interactive user exploration. In Perseus-Hub, the visualized distributions of graph statistics provide preliminary analysis to understand a graph. To perform a deeper analysis, users with little prior knowledge can leverage patterns (e.g., spikes in the power-law degree distribution) marked by other users or experts. Moreover, Perseus-Hub guides users to regions of interest by highlighting anomalous nodes and helps users establish a more comprehensive understanding about the graph at hand. We demonstrate our system through the case study on real, large-scale networks.