Effect of Qizhitongluo capsule on lower limb rehabilitation after stroke: A randomized clinical trial.

BACKGROUND: An individual's level of lower limb motor function is associated with his or her disability level after stroke, and motor improvement may lead to a better prognosis and quality of life. Data from animal models show that Qizhitongluo (QZTL) capsule facilitates recovery after focal brain injury. We aimed to validate the efficacy and safety of the QZTL capsule for promoting lower limb motor recovery in poststroke patients. METHODS: In this randomized, multicenter, double-blind, placebo- and active-controlled trial from 13 sites in China, participants with ischemic stroke and Fugl-Meyer motor scale (FMMS) scores of <95 were eligible for inclusion. Patients were randomly assigned in a 2:1:1 ratio to the QZTL group, Naoxintong (NXT) group or placebo group for 12 weeks at 15-28 days after the onset of stroke. The primary outcome was the change in the Lower Limb FMMS (FMMS-LL) score from baseline over the 12-week intervention period. RESULTS: 622 participants were randomly assigned to the QZTL group (309), NXT group (159), or placebo group (154). The FMMS-LL score increased by 4.81 points (95 % CI, 4.27-5.35) in the QZTL group, by 3.77 points (95 % CI, 3.03-4.51) in the NXT group and by 3.00 points (95 % CI, 3.03-4.51) in the placebo group at week 12. The QZTL group showed significantly larger improvements compared with the placebo group at each interview from weeks 4-12 (difference, 0.89 [0.30,1.49] at week 4, P = 0.0032; difference, 1.83[1.01,2.66] at 90 days poststroke, P < 0.0001; difference, 1.81[0.88,2.74] at week 12, P = 0.0001). CONCLUSION: The QZTL capsule is an effective treatment for lower limb motor impairment. The finding indicates that the QZTL capsule may be used as a potential new strategy for stroke rehabilitation.

Flexible Sensor Array Based on Transient Earth Voltage for Online Partial Discharge Monitoring of Cable Termination.

Cable termination is a weak point in an underground cable system. The transient earth voltage (TEV) method is an effective and nonintrusive method for estimating the insulation condition of cable termination. However, the practical application of TEV detection is mainly focused on switchgears, generators, and transformers with a flat and conductive shell. A flexible sensor array based on the TEV method is presented for online partial discharge (OLPD) monitoring of the cable termination. Each sensing element is designed with a dual-capacitor structure made of flexible polymer material to obtain better and more stable sensitivity. Based on the electromagnetic (EM) wave propagation theory, the partial discharge (PD) propagation model in the cable termination is built to analyze and verify the rationality and validity of the sensor unit. Some influencing factors are discussed regarding the response characteristics of sensors. Finally, the performance of the sensor array is verified by simulations and experiments. Besides, an OLPD monitoring system is introduced. The monitoring system is composed of the on-site monitoring device and the remote monitoring host. The two parts of the system exchange the data through wireless networks using a wireless communication module. The experiment results show that the monitoring device could supply the PD condition monitoring demand for cable termination.

Anchor Link Prediction across Attributed Networks via Network Embedding.

Presently, many users are involved in multiple social networks. Identifying the same user in different networks, also known as anchor link prediction, becomes an important problem, which can serve numerous applications, e.g., cross-network recommendation, user profiling, etc. Previous studies mainly use hand-crafted structure features, which, if not carefully designed, may fail to reflect the intrinsic structure regularities. Moreover, most of the methods neglect the attribute information of social networks. In this paper, we propose a novel semi-supervised network-embedding model to address the problem. In the model, each node of the multiple networks is represented by a vector for anchor link prediction, which is learnt with awareness of observed anchor links as semi-supervised information, and topology structure and attributes as input. Experimental results on the real-world data sets demonstrate the superiority of the proposed model compared to state-of-the-art techniques.

Facilitating interaction between partial differential equation-based dynamics and unknown dynamics for regional wind speed prediction.

Regional wind speed prediction is an important spatiotemporal prediction problem which is crucial for optimizing wind power utilization. Nevertheless, the complex dynamics of wind speed pose a formidable challenge to prediction tasks. The evolving dynamics of wind could be governed by underlying physical principles that can be described by partial differential equations (PDE). This study proposes a novel approach called PDE-assisted network (PaNet) for regional wind speed prediction. In PaNet, a new architecture is devised, incorporating both PDE-based dynamics (PDE dynamics) and unknown dynamics. Specifically, this architecture establishes interactions between the two dynamics, regulated by an inter-dynamics communication unit that controls interactions through attention gates. Additionally, recognizing the significance of the initial state for PDE dynamics, an adaptive frequency-gated unit is introduced to generate a suitable initial state for the PDE dynamics by selecting essential frequency components. To evaluate the predictive performance of PaNet, this study conducts comprehensive experiments on two real-world wind speed datasets. The experimental results indicated that the proposed method is superior to other baseline methods.

MultiFacTV: module detection from higher-order time series biological data.

BACKGROUND: Identifying modules from time series biological data helps us understand biological functionalities of a group of proteins/genes interacting together and how responses of these proteins/genes dynamically change with respect to time. With rapid acquisition of time series biological data from different laboratories or databases, new challenges are posed for the identification task and powerful methods which are able to detect modules with integrative analysis are urgently called for. To accomplish such integrative analysis, we assemble multiple time series biological data into a higher-order form, e.g., a gene × condition × time tensor. It is interesting and useful to develop methods to identify modules from this tensor. RESULTS: In this paper, we present MultiFacTV, a new method to find modules from higher-order time series biological data. This method employs a tensor factorization objective function where a time-related total variation regularization term is incorporated. According to factorization results, MultiFacTV extracts modules that are composed of some genes, conditions and time-points. We have performed MultiFacTV on synthetic datasets and the results have shown that MultiFacTV outperforms existing methods EDISA and Metafac. Moreover, we have applied MultiFacTV to Arabidopsis thaliana root(shoot) tissue dataset represented as a gene × condition × time tensor of size 2395 × 9 × 6(3454 × 8 × 6), to Yeast dataset and Homo sapiens dataset represented as tensors of sizes 4425 × 6 × 6 and 2920 × 14 × 9 respectively. The results have shown that MultiFacTV indeed identifies some interesting modules in these datasets, which have been validated and explained by Gene Ontology analysis with DAVID or other analysis. CONCLUSION: Experimental results on both synthetic datasets and real datasets show that the proposed MultiFacTV is effective in identifying modules for higher-order time series biological data. It provides, compared to traditional non-integrative analysis methods, a more comprehensive and better view on biological process since modules composed of more than two types of biological variables could be identified and analyzed.

Multisource Heterogeneous Domain Adaptation With Conditional Weighting Adversarial Network.

Heterogeneous domain adaptation (HDA) tackles the learning of cross-domain samples with both different probability distributions and feature representations. Most of the existing HDA studies focus on the single-source scenario. In reality, however, it is not uncommon to obtain samples from multiple heterogeneous domains. In this article, we study the multisource HDA problem and propose a conditional weighting adversarial network (CWAN) to address it. The proposed CWAN adversarially learns a feature transformer, a label classifier, and a domain discriminator. To quantify the importance of different source domains, CWAN introduces a sophisticated conditional weighting scheme to calculate the weights of the source domains according to the conditional distribution divergence between the source and target domains. Different from existing weighting schemes, the proposed conditional weighting scheme not only weights the source domains but also implicitly aligns the conditional distributions during the optimization process. Experimental results clearly demonstrate that the proposed CWAN performs much better than several state-of-the-art methods on four real-world datasets.

PEPNet: A barotropic primitive equations-based network for wind speed prediction.

In wind speed prediction technologies, deep learning-based methods have achieved promising advantages. However, most existing methods focus on learning implicit knowledge in a data-driven manner but neglect some explicit knowledge from the physical theory of meteorological dynamics, failing to make stable and long-term predictions. In this paper, we explore introducing explicit physical knowledge into neural networks and propose Physical Equations Predictive Network (PEPNet) for multi-step wind speed predictions. In PEPNet, a new neural block called the Augmented Neural Barotropic Equations (ANBE) block is designed as its key component, which aims to capture the wind dynamics by combining barotropic primitive equations and deep neural networks. Specifically, the ANBE block adopts a two-branch structure to model wind dynamics, where one branch is physic-based and the other is data-driven-based. The physic-based branch constructs temporal partial derivatives of meteorological elements (including u-component wind, v-component wind, and geopotential height) in a new Neural Barotropic Equations Unit (NBEU). The NBEU is developed based on the barotropic primitive equations mode in numerical weather prediction (NWP). Besides, considering that the barotropic primitive mode is a crude assumption of atmospheric motion, another data-driven-based branch is developed in the ANBE block, which aims at capturing meteorological dynamics beyond barotropic primitive equations. Finally, the PEPNet follows a time-variant structure to enhance the model's capability to capture wind dynamics over time. To evaluate the predictive performance of PEPNet, we have conducted several experiments on two real-world datasets. Experimental results show that the proposed method outperforms the state-of-the-art techniques and achieve optimal performance.

Multi-relational graph convolutional networks: Generalization guarantees and experiments.

The class of multi-relational graph convolutional networks (MRGCNs) is a recent extension of standard graph convolutional networks (GCNs) to handle heterogenous graphs with multiple types of relationships. MRGCNs have been shown to yield results superior than traditional GCNs in various machine learning tasks. The key idea is to introduce a new kind of convolution operated on tensors that can effectively exploit correlations exhibited in multiple relationships. The main objective of this paper is to analyze the algorithmic stability and generalization guarantees of MRGCNs to confirm the usefulness of MRGCNs. Our contributions are of three folds. First, we develop a matrix representation of various tensor operations underneath MRGCNs to simplify the analysis significantly. Next, we prove the uniform stability of MRGCNs and deduce the convergence of the generalization gap to support the usefulness of MRGCNs. The analysis sheds lights on the design of MRGCNs, for instance, how the data should be scaled to achieve the uniform stability of the learning process. Finally, we provide experimental results to demonstrate the stability results.

Prototype Completion for Few-Shot Learning.

Few-shot learning (FSL) aims to recognize novel classes with few examples. Pre-training based methods effectively tackle the problem by pre-training a feature extractor and then fine-tuning it through the nearest centroid based meta-learning. However, results show that the fine-tuning step makes marginal improvements. In this paper, 1) we figure out the reason, i.e., in the pre-trained feature space, the base classes already form compact clusters while novel classes spread as groups with large variances, which implies that fine-tuning feature extractor is less meaningful; 2) instead of fine-tuning feature extractor, we focus on estimating more representative prototypes. Consequently, we propose a novel prototype completion based meta-learning framework. This framework first introduces primitive knowledge (i.e., class-level part or attribute annotations) and extracts representative features for seen attributes as priors. Second, a part/attribute transfer network is designed to learn to infer the representative features for unseen attributes as supplementary priors. Finally, a prototype completion network is devised to learn to complete prototypes with these priors. Moreover, to avoid the prototype completion error, we further develop a Gaussian based prototype fusion strategy that fuses the mean-based and completed prototypes by exploiting the unlabeled samples. At last, we also develop an economic prototype completion version for FSL, which does not need to collect primitive knowledge, for a fair comparison with existing FSL methods without external knowledge. Extensive experiments show that our method: i) obtains more accurate prototypes; ii) achieves superior performance on both inductive and transductive FSL settings.

Interpretable local flow attention for multi-step traffic flow prediction.

Traffic flow prediction (TFP) has attracted increasing attention with the development of smart city. In the past few years, neural network-based methods have shown impressive performance for TFP. However, most of previous studies fail to explicitly and effectively model the relationship between inflows and outflows. Consequently, these methods are usually uninterpretable and inaccurate. In this paper, we propose an interpretable local flow attention (LFA) mechanism for TFP, which yields three advantages. (1) LFA is flow-aware. Different from existing works, which blend inflows and outflows in the channel dimension, we explicitly exploit the correlations between flows with a novel attention mechanism. (2) LFA is interpretable. It is formulated by the truisms of traffic flow, and the learned attention weights can well explain the flow correlations. (3) LFA is efficient. Instead of using global spatial attention as in previous studies, LFA leverages the local mode. The attention query is only performed on the local related regions. This not only reduces computational cost but also avoids false attention. Based on LFA, we further develop a novel spatiotemporal cell, named LFA-ConvLSTM (LFA-based convolutional long short-term memory), to capture the complex dynamics in traffic data. Specifically, LFA-ConvLSTM consists of three parts. (1) A ConvLSTM module is utilized to learn flow-specific features. (2) An LFA module accounts for modeling the correlations between flows. (3) A feature aggregation module fuses the above two to obtain a comprehensive feature. Extensive experiments on two real-world datasets show that our method achieves a better prediction performance. We improve the RMSE metric by 3.2%-4.6%, and the MAPE metric by 6.2%-6.7%. Our LFA-ConvLSTM is also almost 32% faster than global self-attention ConvLSTM in terms of prediction time. Furthermore, we also present some visual results to analyze the learned flow correlations.

UNIMEMnet: Learning long-term motion and appearance dynamics for video prediction with a unified memory network.

As a pixel-wise dense forecast task, video prediction is challenging due to its high computation complexity, dramatic future uncertainty, and extremely complicated spatial-temporal patterns. Many deep learning methods are proposed for the task, which bring up significant improvements. However, they focus on modeling short-term spatial-temporal dynamics and fail to sufficiently exploit long-term ones. As a result, the methods tend to deliver unsatisfactory performance for a long-term forecast requirement. In this article, we propose a novel unified memory network (UNIMEMnet) for long-term video prediction, which can effectively exploit long-term motion-appearance dynamics and unify the short-term spatial-temporal dynamics and long-term ones in an architecture. In the UNIMEMnet, a dual branch multi-scale memory module is carefully designed to extract and preserve long-term spatial-temporal patterns. In addition, a short-term spatial-temporal dynamics module and an alignment and fusion module are devised to capture and coordinate short-term motion-appearance dynamics with long-term ones from our designed memory module. Extensive experiments on five video prediction datasets from both synthetic and real-world scenarios are conducted, which validate the effectiveness and superiority of our proposed method UNIMEMnet over state-of-the-art methods.

Utilizing Imine Bonds to Create a Self-Gated Mesoporous Silica Material with Controlled Release and Antimicrobial Properties.

In recent years, silica nanomaterials have been widely studied as carriers in the field of antibacterial activity in food. Therefore, it is a promising but challenging proposition to construct responsive antibacterial materials with food safety and controllable release capabilities using silica nanomaterials. In this paper, a pH-responsive self-gated antibacterial material is reported, which uses mesoporous silica nanomaterials as a carrier and achieves self-gating of the antibacterial agent through pH-sensitive imine bonds. This is the first study in the field of food antibacterial materials to achieve self-gating through the chemical bond of the antibacterial material itself. The prepared antibacterial material can effectively sense changes in pH values caused by the growth of foodborne pathogens and choose whether to release antibacterial substances and at what rate. The development of this antibacterial material does not introduce other components, ensuring food safety. In addition, carrying mesoporous silica nanomaterials can also effectively enhance the inhibitory ability of the active substance.

WDMNet: Modeling diverse variations of regional wind speed for multi-step predictions.

Regional wind speed prediction plays an important role in the development of wind power, which is usually recorded in the form of two orthogonal components, namely U-wind and V-wind. The regional wind speed has the characteristics of diverse variations, which are reflected in three aspects: (1) The spatially diverse variations of regional wind speed indicate that wind speed has different dynamic patterns at different positions; (2) The distinct variations between U-wind and V-wind denote that U-wind and V-wind at the same position exhibit different dynamic patterns; (3) The non-stationary variations of wind speed represent that the intermittent and chaotic nature of wind speed. In this paper, we propose a novel framework named Wind Dynamics Modeling Network (WDMNet) to model the diverse variations of regional wind speed and make accurate multi-step predictions. To jointly capture the spatially diverse variations and the distinct variations between U-wind and V-wind, WDMNet leverages a new neural block called Involution Gated Recurrent Unit Partial Differential Equation (Inv-GRU-PDE) as its key component. The block adopts involution to model spatially diverse variations and separately constructs hidden driven PDEs of U-wind and V-wind. The construction of PDEs in this block is achieved by a new Involution PDE (InvPDE) layers. Besides, a deep data-driven model is also introduced in Inv-GRU-PDE block as the complement to the constructed hidden PDEs for sufficiently modeling regional wind dynamics. Finally, to effectively capture the non-stationary variations of wind speed, WDMNet follows a time-variant structure for multi-step predictions. Comprehensive experiments have been conducted on two real-world datasets. Experimental results demonstrate the effectiveness and superiority of the proposed method over state-of-the-art techniques.

Adaptive Transfer of Graph Neural Networks for Few-Shot Molecular Property Prediction.

Few-Shot Molecular Property Prediction (FSMPP) is an improtant task on drug discovery, which aims to learn transferable knowledge from base property prediction tasks with sufficient data for predicting novel properties with few labeled molecules. Its key challenge is how to alleviate the data scarcity issue of novel properties. Pretrained Graph Neural Network (GNN) based FSMPP methods effectively address the challenge by pre-training a GNN from large-scale self-supervised tasks and then finetuning it on base property prediction tasks to perform novel property prediction. However, in this paper, we find that the GNN finetuning step is not always effective, which even degrades the performance of pretrained GNN on some novel properties. This is because these molecule-property relationships among molecules change across different properties, which results in the finetuned GNN overfits to base properties and harms the transferability performance of pretrained GNN on novel properties. To address this issue, in this paper, we propose a novel Adaptive Transfer framework of GNN for FSMPP, called ATGNN, which transfers the knowledge of pretrained and finetuned GNNs in a task-adaptive manner to adapt novel properties. Specifically, we first regard the pretrained and finetuned GNNs as model priors of target-property GNN. Then, a task-adaptive weight prediction network is designed to leverage these priors to predict target GNN weights for novel properties. Finally, we combine our ATGNN framework with existing FSMPP methods for FSMPP. Extensive experiments on four real-world datasets, i.e., Tox21, SIDER, MUV, and ToxCast, show the effectiveness of our ATGNN framework.

DynamicNet: A time-variant ODE network for multi-step wind speed prediction.

Wind power is a new type of green energy. Though it is economical to access and gather such energy, effectively matching the energy with consumers' demand is difficult, because of the fluctuate, intermittent and chaotic nature of wind speed. Hence, multi-step wind speed prediction becomes an important research topic. In this paper, we propose a novel deep learning method, DyanmicNet, for the problem. DynamicNet follows an encoder-decoder framework. To capture the fluctuate, intermittent and chaotic nature of wind speed, it leverages a time-variant structure to build the decoder, which is different from conventional encoder-decoder methods. In addition, a new neural block (ST-GRU-ODE) is developed, which can model the wind speed in a continuous manner by using the neural ordinary differential equation (ODE). To enhance the prediction performance, a multi-step training procedure is also put forward. Comprehensive experiments have been conducted on two real-world datasets, where wind speed is recorded in the form of two orthogonal components namely U-Wind and V-Wind. Each component can be illustrated as wind speed images. Experimental results demonstrate the effectiveness and superiority of the proposed method over state-of-the-art techniques.

SmileGNN: Drug-Drug Interaction Prediction Based on the SMILES and Graph Neural Network.

Concurrent use of multiple drugs can lead to unexpected adverse drug reactions. The interaction between drugs can be confirmed by routine in vitro and clinical trials. However, it is difficult to test the drug-drug interactions widely and effectively before the drugs enter the market. Therefore, the prediction of drug-drug interactions has become one of the research priorities in the biomedical field. In recent years, researchers have been using deep learning to predict drug-drug interactions by exploiting drug structural features and graph theory, and have achieved a series of achievements. A drug-drug interaction prediction model SmileGNN is proposed in this paper, which can be characterized by aggregating the structural features of drugs constructed by SMILES data and the topological features of drugs in knowledge graphs obtained by graph neural networks. The experimental results show that the model proposed in this paper combines a variety of data sources and has a better prediction performance compared with existing prediction models of drug-drug interactions. Five out of the top ten predicted new drug-drug interactions are verified from the latest database, which proves the credibility of SmileGNN.

LS-NTP: Unifying long- and short-range spatial correlations for near-surface temperature prediction.

The near-surface temperature prediction (NTP) is an important spatial-temporal forecast problem, which can be used to prevent temperature crises. Most of the previous approaches fail to explicitly model the long- and short-range spatial correlations simultaneously, which is critical to making an accurate temperature prediction. In this study, both long- and short-range spatial correlations are captured to fill this gap by a novel convolution operator named Long- and Short-range Convolution (LS-Conv). The proposed LS-Conv operator includes three key components, namely, Node-based Spatial Attention (NSA), Long-range Adaptive Graph Constructor (LAGC), and Long- and Short-range Integrator (LSI). To capture long-range spatial correlations, NSA and LAGC are proposed to evaluate node importance aiming at auto-constructing long-range spatial correlations, which is named as Long-range aware Graph Convolution Network (LR-GCN). After that, the Short-range aware Convolution Neural Network (SR-CNN) accounts for the short-range spatial correlations. Finally, LSI is proposed to capture both long- and short-range spatial correlations by intra-unifying LR-GCN and SR-CNN. Upon the proposed LS-Conv operator, a new model called Long- and Short-range for NPT (LS-NTP) is developed. Extensive experiments are conducted on two real-world datasets and the results demonstrate that the proposed method outperforms state-of-the-art techniques. The source code is available on GitHub:https://github.com/xuguangning1218/LS_NTP.

Interaction-Temporal GCN: A Hybrid Deep Framework For Covid-19 Pandemic Analysis.

The Covid-19 pandemic is still spreading around the world and seriously imperils humankind's health. This swift spread has caused the public to panic and look to scientists for answers. Fortunately, these scientists already have a wealth of data-the Covid-19 reports that each country releases, reports with valuable spatial-temporal properties. These data point toward some key actions that humans can take in their fight against Covid-19. Technically, the Covid-19 records can be described as sequences, which represent spatial-temporal linkages among the data elements with graph structure. Therefore, we propose a novel framework, the Interaction-Temporal Graph Convolution Network (IT-GCN), to analyze pandemic data. Specifically, IT-GCN introduces ARIMA into GCN to model the data which originate on nodes in a graph, indicating the severity of the pandemic in different cities. Instead of regular spatial topology, we construct the graph nodes with the vectors via ARIMA parameterization to find out the interaction topology underlying in the pandemic data. Experimental results show that IT-GCN is able to capture the comprehensive interaction-temporal topology and achieve well-performed short-term prediction of the Covid-19 daily infected cases in the United States. Our framework outperforms state-of-art baselines in terms of MAE, RMSE and MAPE. We believe that IT-GCN is a valid and reasonable method to forecast the Covid-19 daily infected cases and other related time-series. Moreover, the prediction can assist in improving containment policies.

MR-NTD: Manifold Regularization Nonnegative Tucker Decomposition for Tensor Data Dimension Reduction and Representation.

With the advancement of data acquisition techniques, tensor (multidimensional data) objects are increasingly accumulated and generated, for example, multichannel electroencephalographies, multiview images, and videos. In these applications, the tensor objects are usually nonnegative, since the physical signals are recorded. As the dimensionality of tensor objects is often very high, a dimension reduction technique becomes an important research topic of tensor data. From the perspective of geometry, high-dimensional objects often reside in a low-dimensional submanifold of the ambient space. In this paper, we propose a new approach to perform the dimension reduction for nonnegative tensor objects. Our idea is to use nonnegative Tucker decomposition (NTD) to obtain a set of core tensors of smaller sizes by finding a common set of projection matrices for tensor objects. To preserve geometric information in tensor data, we employ a manifold regularization term for the core tensors constructed in the Tucker decomposition. An algorithm called manifold regularization NTD (MR-NTD) is developed to solve the common projection matrices and core tensors in an alternating least squares manner. The convergence of the proposed algorithm is shown, and the computational complexity of the proposed method scales linearly with respect to the number of tensor objects and the size of the tensor objects, respectively. These theoretical results show that the proposed algorithm can be efficient. Extensive experimental results have been provided to further demonstrate the effectiveness and efficiency of the proposed MR-NTD algorithm.

MultiVCRank With Applications to Image Retrieval.

In this paper, we propose and develop a multi-visual-concept ranking (MultiVCRank) scheme for image retrieval. The key idea is that an image can be represented by several visual concepts, and a hypergraph is built based on visual concepts as hyperedges, where each edge contains images as vertices to share a specific visual concept. In the constructed hypergraph, the weight between two vertices in a hyperedge is incorporated, and it can be measured by their affinity in the corresponding visual concept. A ranking scheme is designed to compute the association scores of images and the relevance scores of visual concepts by employing input query vectors to handle image retrieval. In the scheme, the association and relevance scores are determined by an iterative method to solve limiting probabilities of a multi-dimensional Markov chain arising from the constructed hypergraph. The convergence analysis of the iteration method is studied and analyzed. Moreover, a learning algorithm is also proposed to set the parameters in the scheme, which makes it simple to use. Experimental results on the MSRC, Corel, and Caltech256 data sets have demonstrated the effectiveness of the proposed method. In the comparison, we find that the retrieval performance of MultiVCRank is substantially better than those of HypergraphRank, ManifoldRank, TOPHITS, and RankSVM.