Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ken Lin

dblp:156/3996 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
4since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Graph learning · 40% Vision and language · 30% Deep learning architectures and training · 30%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
attention mechanism
0.712023
Positional Attention Guided Transformer-Like Architecture for Visual Question Answering · IEEE Trans. Multim. 2023
Computer vision › Vision and language
visual question answering
0.712023
Positional Attention Guided Transformer-Like Architecture for Visual Question Answering · IEEE Trans. Multim. 2023
Machine learning › Graph learning › graph clustering
attributed graph clustering
0.412020
One2Multi Graph Autoencoder for Multi-view Graph Clustering · WWW 2020
Machine learning › Graph learning
graph autoencoder
0.412020
One2Multi Graph Autoencoder for Multi-view Graph Clustering · WWW 2020
Data mining
clustering
0.412020
One2Multi Graph Autoencoder for Multi-view Graph Clustering · WWW 2020
Data mining › clustering
graph clustering
0.412020
One2Multi Graph Autoencoder for Multi-view Graph Clustering · WWW 2020
Data mining › clustering › graph clustering
multi-view graph clustering
0.412020
One2Multi Graph Autoencoder for Multi-view Graph Clustering · WWW 2020

Methods — techniques the papers use, named apart from their topics

self-training · 0.9graph autoencoder · 0.9transformer · 0.7multimodal fusion · 0.7
YearPublicationVenuePosition
2026 When Systems Take Initiative: A Design Framework for Adaptive, Mixed-initiative Database Querying
abstract
Exploring databases remains cognitively demanding for non-experts. While natural language interfaces offer flexibility, they place the full burden of articulation and refinement on the user, hindering exploratory discovery. We identify a core interaction design problem: how to dynamically support users’ evolving understanding during query formulation. We propose and implement a paradigm of adaptive mixed-initiative interaction, where the system interprets user behavioral cues (e.g., tentativeness, focus shifts) to infer intent and dynamically adapts its support strategies. This involves switching between responsive and proactive modes, and integrating textual responses with graphical previews to scaffold the query-building process. We instantiate this paradigm in a functional prototype. A controlled user study demonstrates that this adaptive approach not only improves task efficiency and usability but, more importantly, reduces cognitive load and fosters a more exploratory, less formulaic query-building process compared to traditional reactive interfaces.
Ken Lin, Yun Wang 0012, Yan Lu 0001, Quan Li 0002
DIS4
2024 Overcoming language priors in visual question answering with cumulative learning strategy
Aihua Mao, Ziying Ma, Ken Lin
Neurocomputing4
2023 Positional Attention Guided Transformer-Like Architecture for Visual Question Answering
abstract
Transformer architectures have recently been introduced into the field of visual question answering (VQA), due to their powerful capabilities of information extraction and fusion. However, existing Transformer-like models, including models using a single Transformer structure and large-scale pre-training generic visual-linguistic models, do not fully utilize both positional information of words in questions and positional information of objects in images, which are shown in this paper to be crucial in VQA tasks. To address this challenge, we propose a novel positional attention guided Transformer-like architecture, which can adaptively extracts positional information within and across the visual and language modalities, and use this information to guide high-level interactions in inter- and intra-modality information flows. In particular, we design and assemble three positional attention modules into a single Transformer-like model MCAN. We show that the positional information introduced in intra-modality interaction can adaptively modulate inter-modality interaction according to different inputs, which plays an important role for visual reasoning. Experimental results demonstrate that our model outperforms the state-of-the-art models and is particularly good at handling object counting questions. Overall, our model achieves the accuracy of 70.10%, 71.27%, and 71.52% on the datasets of COCO-QA, VQA v1.0 test-std and VQA v2.0 test-std, respectively.
Aihua Mao, Ken Lin, Jun Xuan, Yong-Jin Liu 0001
IEEE Trans. Multim.3
2022 Regulating Balance Degree for More Reasonable Visual Question Answering Benchmark
abstract
Superficial linguistic correlations is a critical issue for Visual Question Answering (VQA), where models can achieve high performance by exploiting the connection between question and answer, but fail to obtain better generalization ability for out-of-domain data. To ease such issue, VQA-CP v2.0 greedily re-partitions the distribution of VQA v2.0's training and test divides, it suppresses the performance improvement acquired by superficial linguistic correlations. However, some opportunistic methods (such as inverse supervision) can take advantage of the dataset's distribution characteristics to obtain high performance, which is incompatible with academic efforts to increase the model's visual reasoning and modal fusion abilities. To address this problem, we propose a more reasonable dataset in which we attempt to make the training split conform to the long-tailed distribution and the test split more balanced, so that inverse supervision does not result in performance gains and superficial linguistic correlations still can not assist the model in achieving high accuracy. Besides, we propose a decoupled training schema which can obtain better representation and visual reasoning modules to compensate for the shortcomings of ensemble-based methods that selectively learn some samples. Without any further annotations, such schema achieves state-of-the-art performance. In VQA-CP v2.0, it outperforms the simple baseline model UpDn by 15.54%. And its accuracy on VQA v2.0 has almost no drop compared to UpDn. Code is available at https://github.com/asklvd/new-benchmark-for-robust-VQA.
Ken Lin, Aihua Mao, Jiangfeng Liu
IJCNN1
2020 One2Multi Graph Autoencoder for Multi-view Graph Clustering
abstract
Multi-view graph clustering, which seeks a partition of the graph with multiple views that often provide more comprehensive yet complex information, has received considerable attention in recent years. Although some efforts have been made for multi-view graph clustering and achieve decent performances, most of them employ shallow model to deal with the complex relation within multi-view graph, which may seriously restrict the capacity for modeling multi-view graph information. In this paper, we make the first attempt to employ deep learning technique for attributed multi-view graph clustering, and propose a novel task-guided One2Multi graph autoencoder clustering framework. The One2Multi graph autoencoder is able to learn node embeddings by employing one informative graph view and content data to reconstruct multiple graph views. Hence, the shared feature representation of multiple graphs can be well captured. Furthermore, a self-training clustering objective is proposed to iteratively improve the clustering results. By integrating the self-training and autoencoder’s reconstruction into a unified framework, our model can jointly optimize the cluster label assignments and embeddings suitable for graph clustering. Experiments on real-world attributed multi-view graph datasets well validate the effectiveness of our model.
Shaohua Fan, Xiao Wang 0017, Chuan Shi 0001, Emiao Lu, Ken Lin, Bai Wang 0001
WWW5