ICDM

2,478 papers589 directions
The IEEE International Conference on Data Mining (ICDM) is a research venue established in 2001 that focuses on the fields of data mining, machine learning, and artificial intelligence. With a corpus of over 3,500 papers, the conference provides a platform for technical developments in data analysis and knowledge discovery. It covers a broad range of topics, including the design of algorithms for large-scale data processing, the evolution of AI personas, and the management of concept drift in real-time data streams. Research published at ICDM frequently addresses challenges in graph representation learning, such as generalizing graph neural networks to heterogeneous structures and developing weakly-supervised graph classification methods. The venue also emphasizes interpretability and fairness, with work focusing on self-explainable architectures and optimizing interpretability as a training objective. Other significant research directions include anomaly detection in multidimensional time series, hybrid information fusion for personalization, and the autonomous discovery of novel categories in unlabeled data. The venue is characterized by contributions from prolific researchers in the field, including Philip S. Yu, Hui Xiong, Enhong Chen, and Jiawei Han. Recent publications demonstrate a focus on both practical applications and theoretical advancements, such as contrastive learning for recommendation systems, fair tabular data generation using autoregressive decision trees, and deep Q-learning for graph-based optimization. By hosting research on both foundational algorithms and emerging AI challenges, ICDM maintains a consistent role in the development of data-driven technologies.

Papers by Year

2026 1
2025 6
2024 88
2023 153
2022 145
2021 144
2020 155
2019 161
2018 160
2017 127
2016 150
2015 115
2014 114
2013 119
2012 111
2011 107
2010 95
2009 83
2008 84
2007 58
2006 75
2005 60
2004 47
2003 55
2002 40
2001 33

Top Research Directions

Research directions most represented by papers from this venue.

Dynamic Preference Modeling in Interactive Systems 10
Adapting Homogeneous Graph Learning to Heterogeneous Structures 6
Self Supervised Regularization for Sparse Recommender Systems 6
Cross Dataset Validation for Robust Model Generalization 5
Causal Discovery via Minimum Description Length 4
Meta Path Learning in Heterogeneous Networks 4
Non Redundant Pattern Discovery 4
Greedy Maximization for Submodular Subset Selection 4
Scaling Influence Maximization Beyond Simulation Bottlenecks 4
The Scalability Bottleneck of Singular Value Decomposition 4
Learning in Non-Stationary Data Streams 4
Approximating the Uncomputable Ideals of Kolmogorov Complexity 3
Cross-Task Generalization in Graph Neural Networks 3
Advanced Representations and Denoising for Robust Recommendation 3
Overlapping Community Detection in Complex Networks 3

Top Authors

AuthorPapers
Philip S. Yu87
Jiawei Han52
Enhong Chen44
Hui Xiong44
Christos Faloutsos30
Qi Liu30
Xingquan Zhu28
Yanjie Fu28
Xindong Wu23
Chengqi Zhang22
Charu C. Aggarwal21
Claudia Plant21
Wei Wang21
Zhi-Hua Zhou21
Carlotta Domeniconi20
Chang-Dong Wang20
Aidong Zhang19
Peng Zhang19
Christian Böhm18
Chuan Zhou18

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Automatic Topic Identification Using Webpage Clustering2001
Classification through Maximizing Density2001
Clustering Validity Assessment: Finding the Optimal Partitioning of a Data Set2001
CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules2001
Creating Ensembles of Classifiers2001
Efficiently Mining Maximal Frequent Itemsets2001
Efficient Yet Accurate Clustering2001
Evolutionary Structure Learning Algorithm for Bayesian Network and Penalized Mutual Information Metric2001
Frequent Subgraph Discovery2001
Fuzzy Data Mining: Effect of Fuzzy Discretization2001
Hierarchical Text Classification and Evaluation2001
H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases2001
Incremental Support Vector Machine Construction2001
Inexact Field Learning: An Approach to Induce High Quality Rules from Low Quality Data2001
LPMiner: An Algorithm for Finding Frequent Itemsets Using Length-Decreasing Support Constraint2001
Meta-patterns: Revealing Hidden Periodic Patterns2001
Mining Generalized Association Rules for Sequential and Path Data2001
Mining Image Features for Efficient Query Processing2001
Mining the Smallest Association Rule Set for Predictions2001
Mining the Web with Active Hidden Markov Models2001
On Effective Conceptual Indexing and Similarity Search in Text Data2001
On Mining General Temporal Association Rules in a Publication Database2001
RPCL-Based Local PCA Algorithm2001
SSDT: A Scalable Subspace-Splitting Classifier for Biased Data2001
Text Clustering Based on Good Aggregations2001
The Computational Complexity of High-Dimensional Correlation Search2001
Using Artificial Anomalies to Detect Unknown and Known Network Intrusions2001
Who Links to Whom: Mining Linkage between Web Sites2001

« prev Page 50/50