Search Results for author:
Found 27 papers, 6 papers with code
Adapter-Enhanced Semantic Prompting for Continual Learning
Continual learning (CL) enables models to adapt to evolving data streams.
HC-LLM: Historical-Constrained Large Language Models for Radiology Report Generation
Specifically, our approach extracts both time-shared and time-specific features from longitudinal chest X-rays and diagnostic reports to capture disease progression.
Hierarchical Multi-modal Transformer for Cross-modal Long Document Classification
In this paper, we propose a novel approach called Hierarchical Multi-modal Transformer (HMT) for cross-modal long document classification.
Query-Enhanced Adaptive Semantic Path Reasoning for Inductive Knowledge Graph Completion
Conventional Knowledge graph completion (KGC) methods aim to infer missing information in incomplete Knowledge Graphs (KGs) by leveraging existing information, which struggle to perform effectively in scenarios involving emerging entities.
Large Language Models-guided Dynamic Adaptation for Temporal Knowledge Graph Reasoning
To account for the evolving nature of TKGs, a dynamic adaptation strategy is proposed to update the LLM-generated rules with the latest events.
Center Focusing Network for Real-Time LiDAR Panoptic Segmentation
LiDAR panoptic segmentation facilitates an autonomous vehicle to comprehensively understand the surrounding objects and scenes and is required to run in real time.
A Survey on Temporal Knowledge Graph Completion: Taxonomy, Progress, and Prospects
Temporal characteristics are prominently evident in a substantial volume of knowledge, which underscores the pivotal role of Temporal Knowledge Graphs (TKGs) in both academia and industry.
DiMA: Sequence Diversity Dynamics Analyser for Viruses
DiMA provides a quantitative overview of sequence (nucleotide/protein) diversity by use of Shannon's entropy corrected for size bias, applied via a user-defined k-mer sliding window to an input alignment file, and each k-mer position is dissected to various diversity motifs.
Metro Passenger Flow Prediction via Dynamic Hypergraph Convolution Networks
Metro passenger flow prediction is a strategically necessary demand in an intelligent transportation system to alleviate traffic pressure, coordinate operation schedules, and plan future constructions.
CaEGCN: Cross-Attention Fusion based Enhanced Graph Convolutional Network for Clustering
In this paper, we propose a cross-attention based deep clustering framework, named Cross-Attention Fusion based Enhanced Graph Convolutional Network (CaEGCN), which contains four main modules: the cross-attention fusion module which innovatively concatenates the Content Auto-encoder module (CAE) relating to the individual data and Graph Convolutional Auto-encoder module (GAE) relating to the relationship between the data in a layer-by-layer manner, and the self-supervised model that highlights the discriminative information for clustering tasks.
Adversarial Privacy-preserving Filter
While widely adopted in practical applications, face recognition has been critically discussed regarding the malicious use of face images and the potential privacy problems, e. g., deceiving payment system and causing personal sabotage.
blessing in disguise: Designing Robust Turing Test by Employing Algorithm Unrobustness
Turing test was originally proposed to examine whether machine's behavior is indistinguishable from a human.
Vectorial Dimension Reduction for Tensors Based on Bayesian Inference
Under this expression, the projection base of the model is based on the tensor CandeComp/PARAFAC (CP) decomposition and the number of free parameters in the model only grows linearly with the number of modes rather than exponentially.
Localized LRR on Grassmann Manifolds: An Extrinsic View
Subspace data representation has recently become a common practice in many computer vision tasks.
Locality Preserving Projections for Grassmann manifold
Learning on Grassmann manifold has become popular in many computer vision tasks, with the strong capability to extract discriminative information for imagesets and videos.
Partial Least Squares Regression on Riemannian Manifolds and Its Application in Classifications
Partial least squares regression (PLSR) has been a popular technique to explore the linear relationship between two datasets.
Matrix Variate RBM Model with Gaussian Distributions
Restricted Boltzmann Machine (RBM) is a particular type of random neural network models modeling vector data based on the assumption of Bernoulli distribution.
Laplacian LRR on Product Grassmann Manifolds for Human Activity Clustering in Multi-Camera Video Surveillance
In multi-camera video surveillance, it is challenging to represent videos from different cameras properly and fuse them efficiently for specific applications such as human activity recognition and clustering.
Partial Sum Minimization of Singular Values Representation on Grassmann Manifolds
As a significant subspace clustering method, low rank representation (LRR) has attracted great attention in recent years.
Kernelized LRR on Grassmann Manifolds for Subspace Clustering
The novelty of this paper is to generalize LRR on Euclidean space onto an LRR model on Grassmann manifold in a uniform kernelized LRR framework.
Mixture of Bilateral-Projection Two-dimensional Probabilistic Principal Component Analysis
This paper proposes a mixture of bilateral-projection probabilistic principal component analysis model (mixB2DPPCA) on 2D data.
Block-Diagonal Sparse Representation by Learning a Linear Combination Dictionary for Recognition
In a sparse representation based recognition scheme, it is critical to learn a desired dictionary, aiming both good representational power and discriminative performance.
Matrix Variate RBM and Its Applications
In this paper, a Matrix-Variate Restricted Boltzmann Machine (MVRBM) model is proposed by generalizing the classic RBM to explicitly model matrix data.
Tensor Sparse and Low-Rank based Submodule Clustering Method for Multi-way Data
A new submodule clustering method via sparse and low-rank representation for multi-way data is proposed in this paper.
Fast Optimization Algorithm on Riemannian Manifolds and Its Application in Low-Rank Representation
The paper addresses the problem of optimizing a class of composite functions on Riemannian manifolds and a new first order optimization algorithm (FOA) with a fast convergence rate is proposed.
Low Rank Representation on Grassmann Manifolds: An Extrinsic Perspective
Many computer vision algorithms employ subspace models to represent data.
Kernelized Low Rank Representation on Grassmann Manifolds
One of its successful applications is subspace clustering which means data are clustered according to the subspaces they belong to.
