Jie Wang

ORCID: 0000-0001-9902-5723
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Graph Neural Networks
  • Topic Modeling
  • Data Quality and Management
  • Complex Network Analysis Techniques
  • Graph Theory and Algorithms
  • Adversarial Robustness in Machine Learning
  • Domain Adaptation and Few-Shot Learning
  • Advanced Image Processing Techniques
  • Machine Learning and Algorithms
  • Optical measurement and interference techniques
  • Advanced Neural Network Applications
  • Evolutionary Algorithms and Applications
  • Video Surveillance and Tracking Methods
  • Explainable Artificial Intelligence (XAI)
  • Generative Adversarial Networks and Image Synthesis
  • Constraint Satisfaction and Optimization
  • Fuzzy Logic and Control Systems
  • Semantic Web and Ontologies
  • Human Pose and Action Recognition
  • Multimodal Machine Learning Applications
  • Recommender Systems and Techniques
  • Image Enhancement Techniques
  • Reinforcement Learning in Robotics
  • Music and Audio Processing
  • Data Visualization and Analytics

University of Science and Technology of China
2017-2025

Jinan Maternity And Care Hospital
2024

Xi'an High Tech University
2024

Dalian Maritime University
2023

Sun Yat-sen University
2023

National Engineering Research Center of Electromagnetic Radiation Control Materials
2021

University of Electronic Science and Technology of China
2021

National Science Center
2021

Institute of Art
2021

Institute of Microelectronics
2020

In video object tracking, there exist rich temporal contexts among successive frames, which have been largely overlooked in existing trackers. this work, we bridge the individual frames and explore across them via a transformer architecture for robust tracking. Different from classic usage of natural language processing tasks, separate its encoder decoder into two parallel branches carefully design within Siamese-like tracking pipelines. The promotes target templates attention-based feature...

10.1109/cvpr46437.2021.00162 article EN 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2021-06-01

Knowledge graph embedding, which aims to represent entities and relations as low dimensional vectors (or matrices, tensors, etc.), has been shown be a powerful technique for predicting missing links in knowledge graphs. Existing embedding models mainly focus on modeling relation patterns such symmetry/antisymmetry, inversion, composition. However, many existing approaches fail model semantic hierarchies, are common real-world applications. To address this challenge, we propose novel...

10.1609/aaai.v34i03.5701 article EN Proceedings of the AAAI Conference on Artificial Intelligence 2020-04-03

State-of-the-art neural style transfer methods have demonstrated amazing results by training feed-forward convolutional networks or using an iterative optimization strategy. The image representation used in these methods, which contains two components: and content representation, is typically based on high-level features extracted from pretrained classification networks. Because the are originally designed for object recognition, often focus central neglect other details. As a result,...

10.1109/tip.2019.2936746 article EN IEEE Transactions on Image Processing 2019-08-27

Graph convolutional networks (GCNs)—which are effective in modeling graph structures—have been increasingly popular knowledge completion (KGC). GCN-based KGC models first use GCNs to generate expressive entity representations and then embedding (KGE) capture the interactions among entities relations. However, many fail outperform state-of-the-art KGE though introducing additional computational complexity. This phenomenon motivates us explore real effect of KGC. Therefore, this paper, we...

10.1145/3485447.3511923 article EN Proceedings of the ACM Web Conference 2022 2022-04-25

Deep graph neural networks (GNNs) have been shown to be expressive for modeling graph-structured data. Nevertheless, the overstacked architecture of deep models makes it difficult deploy and rapidly test on mobile or embedded systems. To compress over-stacked GNNs, knowledge distillation via a teacher-student turns out an effective technique, where key step is measure discrepancy between teacher student with predefined distance functions. However, using same graphs various structures may...

10.1145/3534678.3539315 article EN Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining 2022-08-12

Sample efficiency remains a key challenge for the deployment of deep reinforcement learning (RL) in real-world scenarios. A common approach is to learn efficient representations through future prediction tasks, facilitating agent make farsighted decisions that benefit its long-term performance. Existing methods extract predictive features by predicting multi-step state signals. However, they do not fully exploit structural information inherent sequential signals, which can potentially...

10.1109/tpami.2025.3529264 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2025-01-01

Tensor factorization based models have shown great power in knowledge graph completion (KGC). However, their performance usually suffers from the overfitting problem seriously. This motivates various regularizers -- such as squared Frobenius norm and tensor nuclear while limited applicability significantly limits practical usage. To address this challenge, we propose a novel regularizer namely, DUality-induced RegulArizer (DURA) which is not only effective improving of existing but widely...

10.48550/arxiv.2011.05816 preprint EN cc-by arXiv (Cornell University) 2020-01-01

Node representation learning on attributed graphs-whose nodes are associated with rich attributes (e.g., texts and protein sequences)-plays a crucial role in many important downstream tasks. To encode the graph structures simultaneously, recent studies integrate pre-trained models neural networks (GNNs), where serve as node encoders (NEs) to attributes. As jointly training large NEs GNNs large-scale graphs suffers from severe scalability issues, methods propose train separately....

10.1109/tpami.2024.3459408 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2024-01-01

This paper presents a joint head pose and facial landmark regression method with input from depth images for realtime application. Our main contributions are: firstly, optimization to estimate landmarks, i.e., the result provides supervised initialization cascaded regression, while landmarks can also help further refine at each stage. Secondly, we classify space into 9 sub-spaces, then use random forest global shape constraint training in specific space. classification-guided effectively...

10.1007/s41095-017-0082-8 article EN cc-by Computational Visual Media 2017-05-08

Semantic matching models-which assume that entities with similar semantics have embeddings-have shown great power in knowledge graph embeddings (KGE). Many existing semantic models use inner products embedding spaces to measure the plausibility of triples and quadruples static temporal graphs. However, vectors same another vector can still be orthogonal each other, which implies may dissimilar embeddings. This property significantly limits performance models. To address this challenge, we...

10.1109/tpami.2022.3161804 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2022-03-24

Three-dimensional convolutional networks (3D CNNs) are used efficiently in various video recognition applications. Compared to traditional 2D CNNs, extra temporal dimension causes 3D CNNs more computationally intensive and have a larger memory footprint. Therefore, the optimization is extremely crucial this case. This paper presents design space exploration of access for FPGA-based CNN accelerator. We present non-overlapping data tiling method contiguous off-chip explore on-chip reuse...

10.23919/date48585.2020.9116376 article EN Design, Automation & Test in Europe Conference & Exhibition (DATE), 2015 2020-03-01

With the success of generative adversarial networks (GANs) on various real-world applications, controllability and security GANs have raised more concerns from community. Specifically, understanding latent space GANs, i.e., obtaining completely decoupled space, is essential for applications in some secure scenarios. At present, there no quantitative method to measure decoupling which not conducive development In this article, we propose two methods sensitivity dimensions: one a sequential...

10.1109/tai.2021.3071642 article EN IEEE Transactions on Artificial Intelligence 2021-02-01

Knowledge Graphs (KGs) provide human knowledge with nodes and edges being entities relations among them, respectively.Multihop question answering over KGs-which aims to find answer of given questions through reasoning paths in KGs-has attracted great attention from both academia industry recently.However, this task remains challenging, as it requires accurately identify answers a large candidate entity set, which the size grows exponentially number hops.To tackle problem, we propose novel...

10.18653/v1/2021.findings-acl.19 article EN cc-by 2021-01-01

Medical Visual Question Answering (MedVQA) has gained increasing attention at the intersection of computer vision and natural language processing. Its capability to interpret radiological images deliver precise answers clinical inquiries positions MedVQA as a valuable tool for supporting diagnostic decision-making physicians alleviating workload on radiologists. While recent approaches focus using unified pre-trained large models multi-modal fusion like cross-modal Transformers, research...

10.48550/arxiv.2410.21000 preprint EN arXiv (Cornell University) 2024-10-28

10.1007/s13042-023-01865-y article EN International Journal of Machine Learning and Cybernetics 2023-05-22

We investigate the explainability of graph neural networks (GNNs) as a step toward elucidating their working mechanisms. While most current methods focus on explaining nodes, edges, or features, we argue that, inherent functional mechanism GNNs, message flows are more natural for performing explainability. To this end, propose novel method here, known FlowX, to explain GNNs by identifying important flows. quantify importance flows, follow philosophy Shapley values from cooperative game...

10.1109/tpami.2023.3347470 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2023-12-26

Generalization across different environments with the same tasks is critical for successful applications of visual reinforcement learning (RL) in real scenarios. However, distractions---which are common scenes---from high-dimensional observations can be hurtful to learned representations RL, thus degrading performance generalization. To tackle this problem, we propose a novel approach, namely Characteristic Reward Sequence Prediction (CRESP), extract task-relevant information by reward...

10.1145/3534678.3539391 article EN Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining 2022-08-12

Knowledge graph embedding, which aims to represent entities and relations as low dimensional vectors (or matrices, tensors, etc.), has been shown be a powerful technique for predicting missing links in knowledge graphs. Existing embedding models mainly focus on modeling relation patterns such symmetry/antisymmetry, inversion, composition. However, many existing approaches fail model semantic hierarchies, are common real-world applications. To address this challenge, we propose novel --...

10.48550/arxiv.1911.09419 preprint EN other-oa arXiv (Cornell University) 2019-01-01

In industrial production and engineering operations, the health state of complex systems is critical, predicting it can ensure normal operation.Complex have many monitoring indicators, coupling structures, non-linear time-varying characteristics, so a challenge to establish reliable prediction model.The belief rule base (BRB) fuse observed data expert knowledge nonlinear relationship between input output has well modeling capabilities.Since each indicator system reflect some extent, BRB...

10.32604/iasc.2024.042285 article EN Intelligent Automation & Soft Computing 2024-01-01

Cutting planes (cuts) play an important role in solving mixed-integer linear programs (MILPs), which formulate many real-world applications. Cut selection heavily depends on (P1) cuts to prefer and (P2) how select. Although modern MILP solvers tackle (P1)-(P2) by human-designed heuristics, machine learning carries the potential learn more effective heuristics. However, existing learning-based methods prefer, neglecting importance of Moreover, we observe that (P3) what order selected...

10.1109/tpami.2024.3432716 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 2024-07-23
Coming Soon ...