instruction:
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.
question:
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.
answer:
Multi-Labeled Classification of Demographic Attributes of Patients: a case study of diabetics patients


question:
The shortest path between two concepts in a taxonomic ontology is commonly used to represent the semantic distance between concepts in the edge-based semantic similarity measures. In the past, the edge counting is considered to be the default method for the path computation, which is simple, intuitive and has low computational complexity. However, a large lexical taxonomy of such as WordNet has the irregular densities of links between concepts due to its broad domain but. The edge counting-based path computation is powerless for this non-uniformity problem. In this paper, we advocate that the path computation is able to be separated from the edge-based similarity measures and form various general computing models. Therefore, in order to solve the problem of non-uniformity of concept density in a large taxonomic ontology, we propose a new path computing model based on the compensation of local area density of concepts, which is equal to the number of direct hyponyms of the subsumers of concepts in their shortest path. This path model considers the local area density of concepts as an extension of the edge-based path and converts the local area density divided by their depth into the compensation for edge-based path with an adjustable parameter, which idea has been proven to be consistent with the information theory. This model is a general path computing model and can be applied in various edge-based similarity algorithms. The experiment results show that the proposed path model improves the average correlation between edge-based measures with human judgments on Miller and Charles benchmark from less than 0.8 to more than 0.85, and has a big advantage in efficiency than information content (IC) computation in a dynamic ontology, thereby successfully solving the non-uniformity problem of taxonomic ontology.
answer:
A density compensation-based path computing model for measuring semantic similarity


question:
Twitter has become one of the main sources of news for many people. As real-world events and emergencies unfold, Twitter is abuzz with hundreds of thousands of stories about the events. Some of these stories are harmless, while others could potentially be lifesaving or sources of malicious rumors. Thus, it is critically important to be able to efficiently track stories that spread on Twitter during these events. In this paper, we present a novel semi-automatic tool that enables users to efficiently identify and track stories about real-world events on Twitter. We ran a user study with 25 participants, demonstrating that compared to more conventional methods, our tool can increase the speed and the accuracy with which users can track stories about real-
answer:

A Semi-automatic Method for Efficient Detection of Stories on Social Media