Yusu Wang

Yusu Wang

Auto-generated profile, based on publicly available information

Yusu Wang

University of California San Diego

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
24 June 2022 in SIAM Journal on Mathematics of Data Science
Verified
Journal Article
Closed access
FMFacundo Mémoli
Facundo Mémoli
ZWZhengchao Wan
Zhengchao Wan
YWYusu Wang
Yusu Wang
We present a thorough study of the theoretical properties and devise efficient algorithms for the persistent Laplacian, an extension of the standard combinatorial Laplacian to the setting of pairs ...

28 April 2022 in npj Computational Materials
Verified
Journal Article
Open access
PDF file
JZJie Zhang
Jie Zhang
CCChen Cai
Chen Cai
GKGeorge Kim
George Kim
YWYusu Wang
Yusu Wang
WCWei Chen
Wei Chen
High entropy alloys (HEAs) are an important material class in the development of next-generation structural materials, but the astronomically large composition space cannot be efficiently explored by experiments or first-principles calculations. Machine learning (ML) methods might address this challenge, but ML of HEAs has been hindered by the scarcity of HEA property data. In this work, the EMTO-CPA method was used to generate a large HEA dataset (spanning a composition space of 14 elements) containing 7086 cubic HEA structures with structural properties, 1911 of which have the complete elastic tensor calculated. The elastic property dataset was used to train a ML model with the Deep Sets architecture. The Deep Sets model has better predictive performance and generalizability compared to other ML models. Association rule mining was applied to the model predictions to describe the compositional dependence of HEA elastic properties and to demonstrate the potential for data-driven alloy design.

15 August 2017 in PLOS ONE
Verified
Journal Article
Open access
PDF file
YLYanjie Li
Yanjie Li
DWDingkang Wang
Dingkang Wang
GAGiorgio A Ascoli
Giorgio A Ascoli
PMPartha Mitra
Partha Mitra
YWYusu Wang
Yusu Wang
As more and more neuroanatomical data are made available through efforts such as NeuroMorpho.Org and FlyCircuit.org, the need to develop computational tools to facilitate automatic knowledge discovery from such large datasets becomes more urgent. One fundamental question is how best to compare neuron structures, for instance to organize and classify large collection of neurons. We aim to develop a flexible yet powerful framework to support comparison and classification of large collection of neuron structures efficiently. Specifically we propose to use a topological persistence-based feature vectorization framework. Existing methods to vectorize a neuron (i.e, convert a neuron to a feature vector so as to support efficient comparison and/or searching) typically rely on statistics or summaries of morphometric information, such as the average or maximum local torque angle or partition asymmetry. These simple summaries have limited power in encoding global tree structures. Based on the concept of topological persistence recently developed in the field of computational topology, we vectorize each neuron structure into a simple yet informative summary. In particular, each type of information of interest can be represented as a descriptor function defined on the neuron tree, which is then mapped to a simple persistence-signature. Our framework can encode both local and global tree structure, as well as other information of interest (electrophysiological or dynamical measures), by considering multiple descriptor functions on the neuron. The resulting persistence-based signature is potentially more informative than simple statistical summaries (such as average/mean/max) of morphometric quantities—Indeed, we show that using a certain descriptor function will give a persistence-based signature containing strictly more information than the classical Sholl analysis. At the same time, our framework retains the efficiency associated with treating neurons as points in a simple Euclidean feature space, which would be important for constructing efficient searching or indexing structures over them. We present preliminary experimental results to demonstrate the effectiveness of our persistence-based neuronal feature vectorization framework.

25 September 2006 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
PAPankaj K. Agarwal
Pankaj K. Agarwal
HEHerbert Edelsbrunner
Herbert Edelsbrunner
JHJohn Harer
John Harer
YWYusu Wang
Yusu Wang

16 April 2018 in ACM Transactions on Algorithms
Verified
Journal Article
Open access
PDF file
PAPankaj K. Agarwal
Pankaj K. Agarwal
KFKyle Fox
Kyle Fox
ANAbhinandan Nath
Abhinandan Nath
ASAnastasios Sidiropoulos
Anastasios Sidiropoulos
YWYusu Wang
Yusu Wang
The Gromov-Hausdorff (GH) distance is a natural way to measure distance between two metric spaces. We prove that it is NP-hard to approximate the GH distance better than a factor of 3 for geodesic metrics on a pair of trees. We complement this result by providing a polynomial time O (min n , √ rn )-approximation algorithm for computing the GH distance between a pair of metric trees, where r is the ratio of the longest edge length in both trees to the shortest edge length. For metric trees with unit length edges, this yields an O (√ n )-approximation algorithm 1 .

28 September 2020 in Nature Machine Intelligence
Verified
Journal Article
Closed access
PDF file
SBSamik Banerjee
Samik Banerjee
LMLucas Magee
Lucas Magee
DWDingkang Wang
Dingkang Wang
XLXu Li
Xu Li
BHBing-Xing Huo
Bing-Xing Huo
PMPartha P. Mitra
Partha P. Mitra