Markov clustering (MCL) is a widely used clustering algorithm for graph data partitioning. However, it suffers from three key limitations: the lack of theoretical investigation into the reliability of graph construction methods for MCL, difficulty in parameter expansion tuning, and the reliance on global pruning strate...
Le Li, Fei Wang, P. Fränti· Knowledge and Information Sy...· 0 citations
Constraint-Aligned Subspace Transformation (CAST), a novel framework that restricts metric adaptation to a low dimensional subspace strictly induced by pairwise constraints, is proposed, and an implicit update formulation that enables distance evaluation in O (r) time, effectively reducing memory complexity to O (nr).
Fei Wang, Le Li, P. Fränti· Proceedings of the 32nd ACM...· 0 citations
Kernel Distance Metric Learning (KDML) is a powerful tool for enhancing clustering performance by adapting the data geometry to correct structural mismatches. However, traditional global KDML methods suffer from severe scalability issues, often incurring O (n3) computational costs and O (n2) memory usage, where n is th...
Fei Wang, Le Li, P. Fränti· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.