2 papers
cs.SI2026
Efficient Computation of Maximum Flexi-Clique in Networks
Song Kim, Hyewon Kim, Kaiqiang Yu +4
Discovering large cohesive subgraphs is a key task for graph mining. Existing models, such as clique, k-plex, and γ-quasi-clique, use fixed density thresholds that overlook the nat…
cs.LG2024
Online Drift Detection with Maximum Concept Discrepancy
Ke Wan, Yi Liang, Susik Yoon
Continuous learning from an immense volume of data streams becomes exceptionally critical in the internet era. However, data streams often do not conform to the same distribution o…