IEEE TKDE

4,462 papers1,251 directions
IEEE Transactions on Knowledge and Data Engineering (TKDE) is a peer-reviewed journal active since 1993 that focuses on the intersection of data engineering, knowledge discovery, and machine learning. The venue publishes research concerning the design, implementation, and management of data-intensive systems and the extraction of knowledge from large-scale datasets. Its scope encompasses foundational data structures, scalable algorithms, and the application of artificial intelligence to complex data environments. The journal is characterized by a focus on graph-based machine learning and data stream processing. Key research directions represented in the venue include the development of dynamic node embeddings for time-evolving networks, memory-efficient graph processing, and scalable graph centrality analysis. Additionally, the venue features work on data quality, specifically regarding joint imputation and classification for incomplete datasets and modeling the signals inherent in missing data. Prolific contributors to the journal include researchers such as Xiaofang Zhou, Feiping Nie, Wenjie Zhang, and Xuelong Li. Recent publications indicate an integration of emerging technologies into the journal's core focus areas. This includes the application of Large Language Models (LLMs) for misinformation detection, bug detection in database engines, and managing scientific complexity through automated peer review systems. Other topics include spatial graph-based foundation models for urban representation and safety mechanisms within graph machine learning. By bridging the gap between database management and advanced analytics, the journal serves as a venue for research on the scalability and reliability of data-driven AI systems.

Papers by Year

2026 285
2025 479
2024 601
2023 834
2022 460
2021 314
2020 232
2019 209
2018 185
2017 183
2016 177
2015 181
2014 146
2013 132
2012 100
2011 90
2010 95
2009 72
2008 66
2007 50
2006 58
2005 56
2004 50
2003 41
2002 26
2001 27
2000 13
1999 22
1998 14
1997 16
1996 18
1995 9
1994 14
1993 7
1992 5
1991 5
1990 2
1989 3

Top Research Directions

Research directions most represented by papers from this venue.

Self Supervised Regularization for Sparse Recommender Systems 26
Dynamic Preference Modeling in Interactive Systems 25
Over-Smoothing in Graph Neural Networks 19
Cross-Task Generalization in Graph Neural Networks 11
Transparent Reasoning for Personalized Recommendation 11
Meta Path Learning in Heterogeneous Networks 10
Overcoming the Homophily Assumption in Graph Neural Networks 10
Adapting Homogeneous Graph Learning to Heterogeneous Structures 9
Scaling Graph Learning to Massive Networks 9
Knowledge Retention in Continual Deep Learning 9
Fusing Exogenous Context into Spatio-Temporal Neural Networks 8
Multimodal Feature Fusion for Recommender Systems 8
Learning on Graphs with Scarce Labels 8
Explaining Predictions in Graph Neural Networks 8
Hyperparameter Sensitivity in Complex Machine Learning Frameworks 8

Top Authors

AuthorPapers
Philip S. Yu169
Xiaofang Zhou85
Lei Chen77
Hui Xiong74
Xuemin Lin63
Ming-syan Chen60
Xuelong Li59
Wenjie Zhang48
Guoren Wang47
Jiawei Han46
Jianliang Xu43
Christian S. Jensen42
Li Qing41
Hongzhi Yin39
Chengqi Zhang38
Ying Zhang36
Yunjun Gao36
Xindong Wu35
Meng Wang34
Xinwang Liu34

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory2005
Cost-Constrained Data Acquisition for Intelligent Data Preparation2005
Divide-and-Approximate: A Novel Constraint Push Strategy for Iceberg Cube Mining2005
Document Clustering Using Locality Preserving Indexing2005
Dual Clustering: Integrating Data Clustering over Optimization and Constraint Domains2005
Editorial: TKDE Topic Area Revisions2005
Effectively Mining and Using Coverage and Overlap Statistics for Data Integration2005
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure2005
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications2005
Fast algorithms for frequent itemset mining using FP-trees2005
Feature Subset Selection and Feature Ranking for Multivariate Time Series2005
Frequent Substructure-Based Approaches for Classifying Chemical Compounds2005
Guest Editors' Introduction: Special Issue on Mining Biological Data2005
Guest Editors' Introduction: Special Section on Intelligent Data Preparation2005
Hierarchical Decision Tree Induction in Distributed Genomic Databases2005
Hierarchical Taxonomy Preparation for Text Categorization Using Consistent Bipartite Spectral Graph Copartitioning2005
IDR/QR: An Incremental Dimension Reduction Algorithm via QR Decomposition2005
Indexing High-Dimensional Data for Efficient In-Memory Similarity Search2005
Indexing Useful Structural Patterns for XML Query Processing2005
KBA: Kernel Boundary Alignment Considering Imbalanced Data Distribution2005
Maximum Weighted Likelihood via Rival Penalized EM for Density Mixture Clustering with Automatic Model Selection2005
"Missing Is Useful': Missing Values in Cost-Sensitive Decision Trees2005
On Change Diagnosis in Evolving Data Streams2005
On Rival Penalization Controlled Competitive Learning for Clustering with Automatic Cluster Number Selection2005
Preserving Privacy by De-Identifying Face Images2005
QA-Pagelet: Data Preparation Techniques for Large-Scale Data Analysis of the Deep Web2005
Query Processing in a Mobile Computing Environment: Exploiting the Features of Asymmetry2005
Secure Interoperation in a Multidomain Environment Employing RBAC Policies2005
Semisupervised Learning of Hierarchical Latent Trait Models for Data Visualization2005
Shared Memory Parallelization of Data Mining Algorithms: Techniques, Programming Interface, and Performance2005
Simulated Annealing Using a Reversible Jump Markov Chain Monte Carlo Algorithm for Fuzzy Clustering2005
SynchRuler: A Rule-Based Flexible Synchronization Model with Model Checking.2005
Techniques for Efficient Road-Network-Based Tracking of Moving Objects2005
TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets2005
Toward Integrating Feature Selection Algorithms for Classification and Clustering2005
Toward Unsupervised Correlation Preserving Discretization2005
Translation initiation sites prediction with mixture Gaussian models in human cDNA sequences2005
Tri-Training: Exploiting Unlabeled Data Using Three Classifiers2005
Using AUC and Accuracy in Evaluating Learning Algorithms2005
Using Datacube Aggregates for Approximate Querying and Deviation Detection2005
Using Object Deputy Model to Prepare Data for Data Warehousing2005
Using One-Class and Two-Class SVMs for Multiclass Image Annotation2005
Video Data Mining: Semantic Indexing and Event Detection from the Association Perspective2005
WISDOM: Web Intrapage Informative Structure Mining Based on Document Object Model2005
A Human-Computer Interactive Method for Projected Clustering2004
A keyword-based semantic prefetching approach in internet news services2004
An Efficient Algorithm for Discovering Frequent Subgraphs2004
An Efficient Algorithm to Compute Differences between Structured Documents2004
An Efficient and Scalable Algorithm for Clustering XML Documents by Structure2004
An Efficient Subspace Sampling Framework for High-Dimensional Data Reduction, Selectivity Estimation, and Nearest-Neighbor Search2004

« prev Page 84/90 next »