4 papers
An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem
Huaiyuan Liu, Xianzhang Liu, Donghua Yang +5
The Maximum Minimal Cut Problem (MMCP), a NP-hard combinatorial optimization (CO) problem, has not received much attention due to the demanding and challenging bi-connectivity cons…
Data Debugging is NP-hard for Classifiers Trained with SGD
Zizheng Guo, Pengyu Chen, Yanzhang Fu +1
Data debugging is to find a subset of the training data such that the model obtained by retraining on the subset has a better accuracy. A bunch of heuristic approaches are proposed…
QUEST: An Efficient Query Evaluation Scheme Towards Scan-Intensive Cross-Model Analysis
Jianfeng Huang, Dongjing Miao, Xin Liu
Modern data-driven applications require that databases support fast cross-model analytical queries. Achieving fast analytical queries in a database system is challenging since they…
Random-Order Enumeration for Self-Reducible NP-Problems
Pengyu Chen, Dongjing Miao, Weitian Tong +3
In plenty of data analysis tasks, a basic and time-consuming process is to produce a large number of solutions and feed them into downstream processing. Various enumeration algorit…