Yingqian Zhang

Yingqian Zhang

Auto-generated profile, based on publicly available information

Yingqian Zhang

Eindhoven University of Technology

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2020 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
PCPaulo Roberto de Oliveira da Costa
Paulo Roberto de Oliveira da Costa
AAAlp Akçay
Alp Akçay
YZYingqian Zhang
Yingqian Zhang
UKUzay Kaymak
Uzay Kaymak

17 July 2019 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Closed access
PDF file
SVSicco Verwer
Sicco Verwer
YZYingqian Zhang
Yingqian Zhang
We provide a new formulation for the problem of learning the optimal classification tree of a given depth as a binary linear program. A limitation of previously proposed Mathematical Optimization formulations is that they create constraints and variables for every row in the training data. As a result, the running time of the existing Integer Linear programming (ILP) formulations increases dramatically with the size of data. In our new binary formulation, we aim to circumvent this problem by making the formulation size largely independent from the training data size. We show experimentally that our formulation achieves better performance than existing formulations on both small and large problem instances within shorter running time.

1 March 2017 in Artificial Intelligence
Verified
Journal Article
Closed access
SVSicco Verwer
Sicco Verwer
YZYingqian Zhang
Yingqian Zhang
QYQing Chuan Ye
Qing Chuan Ye

26 February 2011 in Autonomous Agents and Multi-Agent Systems
Verified
Journal Article
Open access
PDF file
Mathijs de WeerdtMathijs de Weerdt
Mathijs de Weerdt
YZYingqian Zhang
Yingqian Zhang
TKTomas Klos
Tomas Klos
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NP-complete. Moreover, it is not approximable within some factor. In contrast to this, we develop an efficient greedy algorithm for this problem. Our algorithm is completely distributed, and it assumes that agents have only local knowledge about tasks and resources. We conduct a broad set of experiments to evaluate the performance and scalability of the proposed algorithm in terms of solution quality and computation time. Three different types of networks, namely small-world, random and scale-free networks, are used to represent various social relationships among agents in realistic applications. The results demonstrate that our algorithm works well and also that it scales well to large-scale applications. In addition we consider the same problem in a setting where the agents holding the resources are self-interested. For this, we show how the optimal algorithm can be used to incentivize these agents to be truthful. However, the efficient greedy algorithm cannot be used in a truthful mechanism, therefore an alternative, cluster-based algorithm is proposed and evaluated.

1 April 2017 in European Journal of Operational Research
Verified
Journal Article
Closed access
Jun-Qiang WANGJun-Qiang WANG
Jun-Qiang WANG
GFGuo-Qiang Fan
Guo-Qiang Fan
YZYingqian Zhang
Yingqian Zhang
CZCheng-Wu Zhang
Cheng-Wu Zhang
JLJoseph Y.-T. Leung
Joseph Y.-T. Leung

1 April 2020 in Computers & Operations Research
Verified
Journal Article
Closed access
MFMurat Firat
Murat Firat
GCGuillaume Crognier
Guillaume Crognier
AGAdriana F. Gabor
Adriana F. Gabor
CHC.A.J. Hurkens
C.A.J. Hurkens
YZYingqian Zhang
Yingqian Zhang