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
A Dynamic Adaptive Self-Organising Hybrid Model for Text Clustering2003
A Fast Algorithm for Computing Hypergraph Transversals and its Application in Mining Emerging Patterns2003
A High-Performance Distributed Algorithm for Mining Association Rules2003
Algorithms for Spatial Outlier Detection2003
An Algebra for Inductive Query Evaluation2003
Analyzing High-Dimensional Data by Subspace Validity2003
A new optimization criterion for generalized discriminant analysis on undersampled problems2003
Association Rule Mining in Peer-to-Peer Systems2003
Building Text Classifiers Using Positive and Unlabeled Examples2003
CBC: Clustering Based Text Classification Requiring Minimal Labeled Data2003
Clustering Item Data Sets with Association-Taxonomy Similarity2003
CoMine: Efficient Mining of Correlated Patterns2003
Comparing Naive Bayes, Decision Trees, and SVM with AUC and Accuracy2003
Comparing Pure Parallel Ensemble Creation Techniques Against Bagging2003
Complex Spatial Relationships2003
Cost-Sensitive Learning by Cost-Proportionate Example Weighting2003
Detecting Patterns of Change Using Enhanced Parallel Coordinates Visualization2003
Dimensionality Reduction Using Kernel Pooled Local Discriminant Information2003
Direct Interesting Rule Generation2003
Dynamic Weighted Majority: A New Ensemble Method for Tracking Concept Drift2003
Effectiveness of Information Extraction, Multi-Relational, and Semi-Supervised Learning for Predicting Functional Properties of Genes2003
Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism2003
ExAMiner: Optimized Level-wise Frequent Pattern Mining with Monotone Constraint2003
Fast PNN-based Clustering Using K-nearest Neighbor Graph2003
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds2003
Identifying Markov Blankets with Decision Tree Induction2003
Impact Studies and Sensitivity Analysis in Medical Data Mining with ROC-based Genetic Learning2003
Information Theoretic Clustering of Sparse Co-Occurrence Data2003
Integrating Customer Value Considerations into Predictive Modeling2003
Introducing Uncertainty into Pattern Discovery in Temporal Event Sequences2003
Is random model better? On its accuracy and efficiency2003
MaPle: A Fast Algorithm for Maximal Pattern-based Clustering2003
Mining Frequent Itemsets in Distributed and Dynamic Databases2003
Mining Plans for Customer-Class Transformation2003
Mining Relevant Text from Unlabelled Documents2003
Mining Semantic Networks for Knowledge Discovery2003
Mining Significant Pairs of Patterns from Graph Structures with Class Labels2003
Mining Strong Affinity Association Patterns in Data Sets with Skewed Support Distribution2003
Model Stability: A key factor in determining whether an algorithm produces an optimal model from a matching distribution2003
Ontologies Improve Text Document Clustering2003
OP-Cluster: Clustering by Tendency in High Dimensional Space2003
PixelMaps: A New Visual Data Mining Approach for Analyzing Large Spatial Data Sets2003
Privacy-preserving Distributed Clustering using Generative Models2003
Reliable Detection of Episodes in Event Sequences2003
Semantic Role Parsing: Adding Semantic Structure to Unstructured Text2003
Simple Estimators for Relational Bayesian Classifiers2003
Spatial Interest Pixels (SIPs): Useful Low-Level Features of Visual Media Data2003
Statistical Relational Learning for Document Mining2003
Structure Search and Stability Enhancement of Bayesian Networks2003
Towards Simple, Easy-to-Understand, yet Accurate Classifiers2003

« prev Page 48/50 next »