Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yun Zhou 0004

dblp:69/5182-4 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2016
0000-0002-5360-2393ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 1 first-authorSystems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Web and social media mining · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 50% High-performance computing · 25% Performance modeling and evaluation · 25%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Web and social media mining
social network analysis
0.322016
The prediction of venture capital co-investment based on structural balance theory · ICDE 2016
The Prediction of Venture Capital Co-Investment Based on Structural Balance Theory · IEEE Trans. Knowl. Data Eng. 2016
Web and social media mining › social network analysis
structural balance theory
0.212016
The prediction of venture capital co-investment based on structural balance theory · ICDE 2016
Distributed systems › fault tolerance
checkpointing
0.112012
The Reliability Wall for Exascale Supercomputing · IEEE Trans. Computers 2012
High-performance computing › supercomputing
exascale computing
0.112012
The Reliability Wall for Exascale Supercomputing · IEEE Trans. Computers 2012
Distributed systems
fault tolerance
0.112012
The Reliability Wall for Exascale Supercomputing · IEEE Trans. Computers 2012
Performance modeling and evaluation › parallel system performance
scalability modeling
0.112012
The Reliability Wall for Exascale Supercomputing · IEEE Trans. Computers 2012

Methods — techniques the papers use, named apart from their topics

group lasso · 0.8structural balance theory · 0.5factor graph model · 0.5feature selection · 0.2factor graph · 0.2reliability speedup · 0.1existence theorem · 0.1
YearPublicationVenuePosition
2016 The prediction of venture capital co-investment based on structural balance theory
abstract
In this paper, we study the prediction of co-investment of VCs. We present a series of observation analysis, design a large number of features, and then select prominent features for co-investment by group Lasso. Then we propose a factor graph model SBFG based on structural balance theory to formalize the observation into a unified model. Experiment results show that the proposed method can accurately (around 90% in terms of accuracy) predict the co-investment in the near future with only 10 features selected by group Lasso, and obtains a significant improvement over the baselines.
Yun Zhou 0004, Jie Tang 0001, Jar-der Luo
ICDE1
2016 The Prediction of Venture Capital Co-Investment Based on Structural Balance Theory
abstract
Venture capital (VC) is of great importance to high-tech industry and network economy since many high-tech firms benefit from VC, especially when they are in their infancy, such as Google, PayPal, and Alibaba. Over 80 percent of the VC investments are related to at least two investors and so co-investment is an important phenomenon in the VC market. However, it is challenging to predict future co-investments due to the complexity and uncertainty of VC behavior. In this paper, we formulate the problem of co-investment prediction into a factor graph model incorporating structural balance theory. We design a large number of features from the perspective of both domain knowledge and social network, and select prominent features by group Lasso. In this paper, we introduce two new investment datasets for the study of VC. Experiment results demonstrate that the proposed model significantly (+9% in terms of accuracy) outperforms the baseline methods. It is shown that only the top 10 features selected by group Lasso (e.g., nationality, number of common neighbors, betweenness, shortest distance, investor type, number of invested fields, and Jaccard similarity of invested fields) can explain the formation of the VC network quite well (around 90 percent in terms of accuracy). In addition, we have some interesting findings. For instance, in the VC network, the co-investor of my co-investor tends to be my co-investor; VC pairs from the same country, of the same investor type, with short distance, with more common neighbors or with appropriate Jaccard similarity of invested fields are likely to co-invest; VCs of large betweenness or of a large number of invested fields have advantage in the VC network; investors of Asian countries, especially of China, are more likely to have social relations than other countries.
Yun Zhou 0004, Jie Tang 0001, Jar-der Luo
IEEE Trans. Knowl. Data Eng.2
2012 The Reliability Wall for Exascale Supercomputing
abstract
Reliability is a key challenge to be understood to turn the vision of exascale supercomputing into reality. Inevitably, large-scale supercomputing systems, especially those at the peta/exascale levels, must tolerate failures, by incorporating fault-tolerance mechanisms to improve their reliability and availability. As the benefits of fault-tolerance mechanisms rarely come without associated time and/or capital costs, reliability will limit the scalability of parallel applications. This paper introduces for the first time the concept of "Reliability Wall” to highlight the significance of achieving scalable performance in peta/exascale supercomputing with fault tolerance. We quantify the effects of reliability on scalability, by proposing a reliability speedup, defining quantitatively the reliability wall, giving an existence theorem for the reliability wall, and categorizing a given system according to the time overhead incurred by fault tolerance. We also generalize these results into a general reliability speedup/wall framework by considering not only speedup but also costup. We analyze and extrapolate the existence of the reliability wall using two representative supercomputers, Intrepid and ASCI White, both employing checkpointing for fault tolerance, and have also studied the general reliability wall using Intrepid. These case studies provide insights on how to mitigate reliability-wall effects in system design and through hardware/software optimizations in peta/exascale supercomputing.
Xuejun Yang, Jingling Xue, Yun Zhou 0004
IEEE Trans. Computers4