1965–1988

Iterative and Fuzzy Clustering Frameworks

Researchers consolidated clustering into iterative refinement frameworks aimed at producing compact and well-separated groups. Hard-partitioning baselines like K-Means anchored comparative analysis across diverse fields. Soft clustering and fuzzy partitions introduced uncertainty handling through partial memberships. Additionally, Self-Organizing Maps and graph-theoretic approaches enabled topology-preserving representations and network-based visualizations.

Period 1965-1988: Researchers formalised hierarchical, iterative, fuzzy, graph-theoretic, and probabilistic models for cross-domain knowledge discovery[1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. K-Means[17], fuzzy ISODATA[7], Fuzzy C-Means[18], and Self-Organizing Maps[19] established a durable iterative paradigm.

1989–2002

Metaheuristics and Density-Based Spectral Clustering

Metaheuristics and shell-based fuzzy approaches emerged to escape local optima and detect complex shapes. Probabilistic formulations and validity criteria established rigorous objective functions and interpretability. Density-based and spectral clustering matured to discover arbitrarily shaped clusters and low-dimensional manifolds in high-dimensional spaces. Scalable variants and co-clustering pipelines enabled cross-domain applications in text and biology.

Period 1989-1995: Shells, tabu search, and spectral techniques improved clustering via geometric modeling, global optimization, and eigenvector cuts[1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. Foundational metaheuristics, topographic maps, surveys, and fuzzy validity criteria shaped subsequent optimization, pattern discovery, and evaluation[10][17][18][19][9]. Period 1996-2002: Density-based, grid-based, and spectral methods handled arbitrary shapes, subspaces, text, and biology using scalable algorithms, statistical models, and validity measures[20][21][22][23][24][25][26][27][28][29][30][31][32]. Landmark algorithms for DBSCAN, spectral embedding, co-clustering, k-means acceleration, and comprehensive surveys shaped enduring theoretical and practical frameworks[20][33][34][35][36].

2003–2016

Spectral and Subspace Clustering Evolution

Graph-based spectral methods and locality-preserving techniques unified dimensionality reduction with clustering through graph Laplacians and eigen-structures. Subspace and sparse representations matured alongside ensemble methods, probabilistic modeling, and matrix factorization to uncover coherent structure in complex spaces. Researchers increasingly integrated scalability with robustness by advancing landmark-based representations, multi-view consistency, and kernel-based techniques. Early deep embeddings and hybrid optimization approaches eventually set the stage for modern learning-enabled clustering architectures.

Period 2003-2009: Spectral graphs, subspaces, ensembles, probabilistic matrix factorization, and distributed frameworks resolved high-dimensional data challenges[1][2][3][4][5][6][7][8][9][10][11][12][13][14][15]. Foundational manifold learning, sequence redundancy reduction, and topic models guided later algorithms, scalable pipelines, and benchmarking[1][2][16][17][11]. Period 2010-2016: Multi-view[18][19][20], large-scale[21][22][23], subspace[24][25], and kernel-based[26][27][28] spectral clustering techniques integrated sparse representations and hybrid optimization to process complex data. Accelerated algorithms[29][30], optimal indices[31], comprehensive surveys[32], and deep embeddings[33] forged scalable paradigms for subsequent research.

2017–2024

Adaptive Graph Fusion Multiview Clustering

Multiview clustering converged on adaptive graph fusion and cross-view optimization strategies. Researchers combined per-view graphs into unified clustering objectives to improve data representation. Latent subspace and deep learning paradigms enforced cross-view complementarity and non-linear semantics. These integrated frameworks enabled scalable analysis of heterogeneous data.

Period 2017-2024: Researchers combined adaptive graphs[1][2][3][4], latent subspaces[5][6][7][8][9], deep embeddings[10][11][12], noise reduction[13][14][15][16], and scalability[17][18][12] for multiview clustering. Seminal models integrated deep representations[19], citation mapping[20], text mining[21], and diversity-aware retrieval[22] to shape modern analytics.

Iterative and Fuzzy Clustering Frameworks era

J. A. Hartigan and M. Anthony Wong

J. A. Hartigan[1] conducted research while affiliated with Yale University[3] and the University of California, Los Angeles[4]. Through Clustering Algorithms.[7] and Algorithm AS 136: A K-Means Clustering Algorithm[6], they established hard-partitioning K-Means baselines that anchored comparative analysis and advanced iterative refinement frameworks for producing compact and well-separated groups. M. Anthony Wong[2] pursued investigations while working at the Massachusetts Institute of Technology[5] and Yale University[3]. By co-authoring Algorithm AS 136: A K-Means Clustering Algorithm[6], they contributed foundational hard-partitioning algorithms that consolidated iterative clustering methodologies across diverse fields.

Metaheuristics and Density-Based Spectral Clustering era

Hans‐Peter Kriegel and 3 others

Hans‐Peter Kriegel[8] conducted research while affiliated with Ludwig-Maximilians-Universität München[12] and Institut für Urheber- und Medienrecht[13]. Their work advanced density-based clustering to discover arbitrarily shaped clusters through the publication of A density-based algorithm for discovering clusters in large spatial Databases with Noise[17]. Jörg Sander[9] conducted research while affiliated with Ludwig-Maximilians-Universität München[12] and University of British Columbia[14]. Their work advanced density-based clustering to discover arbitrarily shaped clusters through the publication of A density-based algorithm for discovering clusters in large spatial Databases with Noise[17]. Martin Ester[10] conducted research while affiliated with Ludwig-Maximilians-Universität München[12] and Simon Fraser University[15]. Their work advanced density-based clustering to discover arbitrarily shaped clusters through the publication of A density-based algorithm for discovering clusters in large spatial Databases with Noise[17]. Xiaowei Xu[11] conducted research while affiliated with Ludwig-Maximilians-Universität München[12] and Siemens (Germany)[16]. Their work advanced density-based clustering to discover arbitrarily shaped clusters through the publication of A density-based algorithm for discovering clusters in large spatial Databases with Noise[17].

Spectral and Subspace Clustering Evolution era

Michael I. Jordan and 2 others

Michael I. Jordan[18] advanced probabilistic modeling while affiliated with the University of California, Berkeley[21] and Berkeley College[22]. Through Latent dirichlet allocation[26], this work contributed to uncovering coherent structure in complex spaces by introducing generative probabilistic models for discrete data collections. Andrew Y. Ng[19] pursued research at Stanford University[23] and Laboratoire d'Informatique de Paris-Nord[24]. They furthered the era's thematic focus on probabilistic modeling and complex structures through Latent dirichlet allocation[26]. David M. Blei[20] conducted investigations at Princeton University[25] and the University of California, Berkeley[21]. Their contribution via Latent dirichlet allocation[26] helped mature probabilistic modeling to uncover coherent structure within complex spaces.

Adaptive Graph Fusion Multiview Clustering era

Ludo Waltman and Nees Jan van Eck

Ludo Waltman[27] conducted research at Leiden University[29] and the African Studies Centre[30]. Through Citation-based clustering of publications using CitNetExplorer and VOSviewer[31], they advanced adaptive graph fusion and cross-view optimization strategies by combining per-view graphs into unified clustering objectives to improve data representation. Nees Jan van Eck[28] conducted research at Leiden University[29]. Through Citation-based clustering of publications using CitNetExplorer and VOSviewer[31], they advanced adaptive graph fusion and cross-view optimization strategies by combining per-view graphs into unified clustering objectives to improve data representation.