In this task, you are given a part of an article. Your task is to generate headline (title) for this text. Preferred headlines are under fifteen words.

Finding inclusion-minimal hitting sets for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Much of the algorithmic literature focuses on the problem of recognizing the collection of minimal hitting sets; however, in many of the applications, it is more important to generate these hitting sets. We survey twenty algorithms from across a variety of domains, considering their history, classification, useful features, and computational performance on a variety of synthetic and real-world inputs. We also provide a suite of implementations of these algorithms with a ready-to-use, platform-agnostic interface based on Docker containers and the AlgoRun framework, so that interested computational scientists can easily perform similar tests with inputs from their own research areas on their own computers or through a convenient Web interface.
The minimal hitting set generation problem: algorithms and computation

Automated learning of patients’ demographics can be seen as multilabel problem where a patient model is based on different race and gender groups. The resulting model can be further integrated into Privacy-Preserving Data Mining, where they can be used to assess risk of identification of different patient groups. Our project considers relations between diabetes and demographics of patients as a multi-labelled problem. Most research in this area has been done as binary classification, where the target class is finding if a person has diabetes or not. But very few, and maybe no work has been done in multi-labeled analysis of the demographics of patients who are likely to be diagnosed with diabetes. To identify such groups, we applied ensembles of several multilabel learning algorithms. The best performing multi label ensembles include BR/Hoeffding Tree, CC/Hoeffding Tree, BCC/Hoeffding Tree, BR/JRIP, CC/JRIP, BCC/ JRIP respectively. In the empirical part of this study, we used on the UCI Diabetics dataset of over 100,000 records, collected from 130 US hospitals. The dataset consisted of attributes that included personal demographics, diagnoses code, lab results, etc. Experiments conducted on datasets of 1000, 10000, 20000 samples, show that BR/JRip model achieves a high overall accuracy of 0.533 (1000 samples), 0.702 (10000 samples), 0.569 (20000 samples), improving over the baseline model ZeroR with accuracy of 0.526, 0.586, .562 respectively. Loss functions such as Rank Loss, One Error, Hamming Loss, and Zero One Loss are also low for BCC/JRIP model for all samples of dataset, making it the best candidate for better performance given the label dependencies.
Multi-Labeled Classification of Demographic Attributes of Patients: a case study of diabetics patients

In this paper, we address the problem of embedded feature selection for ranking on top of the list problems. We pose this problem as a regularized empirical risk minimization with p-norm push loss function (p = ∞) and sparsity inducing regularizers. We leverage the issues related to this challenging optimization problem by considering an alternating direction method of multipliers algorithm which is built upon proximal operators of the loss function and the regularizer. Our main technical contribution is thus to provide a numerical scheme for computing the infinite push loss function proximal operator. Experimental results on toy, DNA microarray and BCI problems show how our novel algorithm compares favorably to competitors for ranking on top while using fewer variables in the scoring function.

Sparse Support Vector Infinite Push