Weiren Yu

Dr. Weiren Yu

Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
1 December 2016
Verified
Conference Paper
Open access
WYWeiren Yu
Weiren Yu
JMJulie Mccann
Julie Mccann
Random Walk with Restart (RWR) is an appealing measure of proximity between nodes based on graph structures. Since real graphs are often large and subject to minor changes, it is prohibitively expensive to recompute proximities from scratch. Previous methods use LU decomposition and degree reordering heuristics, entailing O(|ν| 3 ) time and O(|ν| 2 ) memory to compute all (|ν| 2 ) pairs of node proximities in a static graph. In this paper, a dynamic scheme to assess RWR proximities is proposed: (1) For unit update, we characterize the changes to all-pairs proximities as the outer product of two vectors. We notice that the multiplication of an RWR matrix and its transition matrix, unlike traditional matrix multiplications, is commutative. This can greatly reduce the computation of all-pairs proximities from O(|ν| 3 ) to O(|Δ|) time for each update without loss of accuracy, where |Δ| (≪|V| 2 ) is the number of affected proximities. (2) To avoid O(|V| 2 ) memory for all pairs of outputs, we also devise efficient partitioning techniques for our dynamic model, which can compute all pairs of proximities segment-wisely within O(I|V|) memory and O([|V|/l]) I/O costs, where 1 ≤ I ≤ |V| is a user-controlled trade-off between memory and I/O costs. (3) For bulk updates, we also devise aggregation and hashing methods, which can discard many unnecessary updates further and handle chunks of unit updates simultaneously. Our experimental results on various datasets demonstrate that our methods can be 1-2 orders of magnitude faster than other competitors while securing scalability and exactness.

6 June 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
XLXinglin Li
Xinglin Li
HDHanhui Deng
Hanhui Deng
JOJinhui Ouyang
Jinhui Ouyang
HWHuayan Wan
Huayan Wan
WYWeiren Yu
Weiren Yu
DWDi Wu
Di Wu
The “mind-controlling” capability has always been in mankind's fantasy. With the recent advancements in electroencephalograph (EEG) techniques, brain-computer interface (BCI) researchers have explored some solutions to allow individuals to perform various tasks using their minds. However, the commercial off-the-shelf devices to run accurate EEG signal collection are usually expensive and the comparably cheaper devices can only present coarse results, which prevents the practical application of these devices in domestic services. To tackle this challenge, we propose and develop an end-to-end solution that enables fine brain-robot interaction (BRI) through embedded learning of coarse EEG signals from low-cost devices, namely PerBCI, so that people having difficulty moving, such as the elderly, can mind command and control a robot to perform some basic household tasks. Our contributions are three folds: 1) We present a stacked long short-term memory (BiLSTM) structure, along with specific pre-processing techniques to handle the time-dependency of EEG signals and their classification. 2) We propose a personalized design to adaptively capture multiple features and achieve accurate recognition of individual EEG signals by enhancing the signal interpretation of BiLSTM with an attention mechanism. 3) We develop a low-cost, real-time and end-to-end BRI system that can run our PerBCI models and algorithms in the embedded robot platform to perform more than one type of domestic task based on the users' EEG signal inputs. Our real-world experiments with elderly participants of diverse backgrounds in a home setting and system comparison with other approaches show that the proposed end-to-end solution with low cost can achieve satisfactory run-time speed, accuracy and energy-efficiency.

11 April 2025 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
JJJianan Jiang
Jianan Jiang
HTHao Tang
Hao Tang
ZJZhilin Jiang
Zhilin Jiang
WYWeiren Yu
Weiren Yu
DWDi Wu
Di Wu
Fine-Grained Sketch-Based Image Retrieval (FG-SBIR) aims to minimize the distance between sketches and corresponding images in the embedding space. However, scalability is hindered by the growing complexity of solutions, mainly due to the abstract nature of fine-grained sketches. In this paper, we propose an effective approach to narrow the gap between the two domains. It mainly facilitates unified mutual information sharing both intra- and inter-samples, rather than treating them as a single feature alignment problem between modalities. Specifically, our approach includes: (i) Employing dual weight-sharing networks to optimize alignment within the sketch and image domain, which also effectively mitigates model learning saturation issues. (ii) Introducing an objective optimization function based on contrastive loss to enhance the model's ability to align features in both intra- and inter-samples. (iii) Presenting a self-supervised Multi-Scale Token Recycling (MSTR) Module featured by recycling discarded patch tokens in multi-scale features, further enhancing representation capability and retrieval performance. Our framework achieves excellent results on CNN- and ViT-based backbones. Extensive experiments demonstrate its superiority over existing methods. We also introduce Cloths-V1, the first professional fashion sketch-image dataset, utilized to validate our method and will be beneficial for other applications.

11 August 2021 in World Wide Web
Verified
Journal Article
Open access
PDF file
WYWeiren Yu
Weiren Yu
SISima Iranmanesh
Sima Iranmanesh
AHAparajita Haldar
Aparajita Haldar
MZMaoyin Zhang
Maoyin Zhang
HFHakan Ferhatosmanoglu
Hakan Ferhatosmanoglu
RoleSim and SimRank are among the popular graph-theoretic similarity measures with many applications in, e.g., web search, collaborative filtering, and sociometry. While RoleSim addresses the automorphic (role) equivalence of pairwise similarity which SimRank lacks, it ignores the neighboring similarity information out of the automorphically equivalent set. Consequently, two pairs of nodes, which are not automorphically equivalent by nature, cannot be well distinguished by RoleSim if the averages of their neighboring similarities over the automorphically equivalent set are the same. To alleviate this problem: 1) We propose a novel similarity model, namely RoleSim*, which accurately evaluates pairwise role similarities in a more comprehensive manner. RoleSim* not only guarantees the automorphic equivalence that SimRank lacks, but also takes into account the neighboring similarity information outside the automorphically equivalent sets that are overlooked by RoleSim. 2) We prove the existence and uniqueness of the RoleSim* solution, and show its three axiomatic properties (i.e., symmetry, boundedness, and non-increasing monotonicity). 3) We provide a concise bound for iteratively computing RoleSim* formula, and estimate the number of iterations required to attain a desired accuracy. 4) We induce a distance metric based on RoleSim* similarity, and show that the RoleSim* metric fulfills the triangular inequality, which implies the sum-transitivity of its similarity scores. 5) We present a threshold-based RoleSim* model that reduces the computational time further with provable accuracy guarantee. 6) We propose a single-source RoleSim* model, which scales well for sizable graphs. 7) We also devise methods to scale RoleSim* based search by incorporating its triangular inequality property with partitioning techniques. Our experimental results on real datasets demonstrate that RoleSim* achieves higher accuracy than its competitors while scaling well on sizable graphs with billions of edges.

16 April 2024 in Expert Systems with Applications
Verified
Journal Article
Open access
XLXinxin Liu
Xinxin Liu
WYWeiren Yu
Weiren Yu

3 June 2020 in Circuits, Systems, and Signal Processing
Verified
Journal Article
Closed access
PDF file
DHDingli Hua
Dingli Hua
WWWeiqun Wang
Weiqun Wang
WYWeiren Yu
Weiren Yu
JYJuan Yao
Juan Yao