Data Mining Research by Iryna Ivchenko
Across Chapters 1 through 14 of this series, we built a careful taxonomy of data mining methods — classification trees, clustering algorithms, regression models, association rules, and dimensionality reduction techniques. Each method occupied a well-defined place. Each had known strengths, assumptions, and failure modes. That taxonomy served the field faithfully for over two decades.
This concluding chapter synthesizes insights from fourteen chapters of data mining taxonomy and analysis, projecting the field's trajectory toward 2030 and beyond. We present a comprehensive taxonomy of future research directions organized across five dimensions: theoretical foundations, algorithmic innovation, application domains, ethical considerations, and sociotechnical integration. Drawing...
This chapter surveys cutting-edge data mining techniques emerging between 2024-2026, distinguishing transformative innovations from incremental improvements. We examine five frontier areas: (1) AutoML systems achieving expert-level performance through neural architecture search and meta-learning, (2) foundation models for tabular data adapting large language model techniques to structured datas...
This chapter synthesizes patterns and principles across all data mining domains explored in previous chapters, identifying universal challenges, transferable solutions, and recurring research gaps. We analyze commonalities between finance, healthcare, manufacturing, retail, and telecommunications applications, demonstrating that despite domain-specific nuances, data mining confronts a remarkabl...
Density-based clustering methods represent a fundamentally different philosophy of grouping than their partitional and hierarchical counterparts: rather than minimizing geometric distances or optimizing variance, they identify clusters as regions of high point concentration separated by relative emptiness. This chapter provides a comprehensive taxonomic and conceptual analysis of density-based ...
Hierarchical clustering represents one of the oldest and most intuitive approaches to unsupervised pattern discovery — the idea that natural structures in data can be revealed through successive merging or splitting of groups, producing a nested taxonomy rather than a flat partition. This chapter provides a comprehensive taxonomic analysis of hierarchical clustering methods, tracing their intel...
Clustering stands at the heart of unsupervised data mining — it is the art of asking a machine to look at raw, unlabeled data and answer a deceptively simple question: what belongs together? This chapter offers a comprehensive taxonomy of clustering and segmentation strategies, tracing the intellectual lineage of each major family of algorithms and exposing the often-overlooked gaps in how thes...
Academic Citation: Iryna Ivchenko & Oleh Ivchenko. (2026). Chapter 8: Sequential Pattern Mining — Temporal Discoveries. Intellectual Data Analysis Series, Chapter 8. Odessa National Polytechnic University. DOI: 10.5281/zenodo.18666030 Abstract Sequential pattern mining represents one of the most intellectually compelling challenges in data mining: discovering meaningful patterns hidden with...
In the early 1990s, a rumor began circulating through the corridors of data mining conferences that would become the field's most enduring urban legend. According to the story, analysts at Walmart discovered an unexpected correlation in their transaction data: purchases of beer and diapers frequently occurred together, particularly on Thursday and Saturday evenings. The explanation offered was ...
This chapter develops a systematic taxonomy of unsupervised learning methods for data mining applications. We classify approaches across four major paradigms: clustering algorithms (partitional, hierarchical, and density-based), dimensionality reduction techniques (linear and nonlinear), self-organizing maps, and modern representation learning through autoencoders and deep generative models. Fo...