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
Tractable Group Detection on Large Link Data Sets2003
TSP: Mining Top-K Closed Sequential Patterns2003
Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis2003
Using Discriminant Analysis for Multi-class Classification2003
Validating and Refining Clusters via Visual Rendering2003
A Comparison Study on Algorithms for Incremental Update of Frequent Sequences2002
Adapting Information Extraction Knowledge For Unseen Web Sites2002
Adaptive and Resource-Aware Mining of Frequent Sets2002
Adaptive dimension reduction for clustering high dimensional data2002
An Algebraic Approach to Data Mining: Some Examples2002
Association Analysis with One Scan of Databases2002
A Theory of Inductive Query Answering2002
Cluster merging and splitting in hierarchical clustering algorithms2002
Considering Both Intra-Pattern and Inter-Pattern Anomalies for Intrusion Detection2002
Convex Hull Ensemble Machine2002
Discriminative Category Matching: Efficient Text Classification for Huge Document Collections2002
Efficient Discovery of Common Substructures in Macromolecules2002
Efficient Progressive Sampling for Association Rules2002
Empirical Comparison of Various Reinforcement Learning Strategies for Sequential Targeted Marketing2002
Feature Selection for Clustering - A Filter Solution2002
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns2002
gSpan: Graph-Based Substructure Pattern Mining2002
Heterogeneous Learner for Web Page Classification2002
High Performance Data Mining Using the Nearest Neighbor Join2002
InfoMiner+: Mining Partial Periodic Patterns with Gap Penalties2002
Investigative Profiling with Computer Forensic Log Data and Association Rules2002
Iterative Clustering of High Dimensional Text Data Augmented by Local Search2002
Linear Causal Model Discovery Using the MML criterion2002
Mining Associations by Pattern Structure in Large Relational Tables2002
Mining Case Bases for Action Recommendation2002
Mining General Temporal Association Rules for Items with Different Exhibition Periods2002
Mining Molecular Fragments: Finding Relevant Substructures of Molecules2002
Mining Significant Associations in Large Scale Text Corpora2002
Mining Top-K Frequent Closed Patterns without Minimum Support2002
Mixtures of ARMA Models for Model-Based Time Series Clustering2002
On Computing Condensed Frequent Pattern Bases2002
On the Mining of Substitution Rules for Statistically Dependent Items2002
PERUSE: An Unsupervised Algorithm for Finding Recurrig Patterns in Time Series2002
Progressive Modeling2002
Progressive Modeling.2002
Recognition of Common Areas in a Web Page Using Visual Information: a possible application in a page classification2002
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint2002
Speed-up Iterative Frequent Itemset Mining with Constraint Changes2002
TreeFinder: a First Step towards XML Data Mining2002
Using Category-Based Adherence to Cluster Market-Basket Data2002
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering2001
Analyzing the Interestingness of Association Rules from the Temporal Dimension2001
An Immune Neural Network Used for Classification2001
A Scalable Algorithm for Clustering Sequential Data2001
A Tight Upper Bound on the Number of Candidate Patterns2001

« prev Page 49/50 next »