Supporting public decision making in policy deliberations: An ontological approach

This is the post-print version of the Paper. The official published version can be accessed from the link below - Copyright @ 2011 SpringerSupporting public decision making in policy deliberations has been a key objective of eParticipation which is an emerging area of eGovernment. EParticipation aims to enhance citizen involvement in public governance activities through the use of information and communication technologies. An innovative approach towards this objective is exploiting the potentials of semantic web technologies centred on conceptual knowledge models in the form of ontologies. Ontologies are generally defined as explicit human and computer shared views on the world of particular domains. In this paper, the potentials and benefits of using ontologies for policy deliberation processes are discussed. Previous work is then extended and synthesised to develop a deliberation ontology. The ontology aims to define the necessary semantics in order to structure and interrelate the stages and various activities of deliberation processes with legal information, participant stakeholders and their associated arguments. The practical implications of the proposed framework are illustrated.This work is funded by the European Commission under the 2006/1 eParticipation call

Parameterized Complexity of the k-anonymity Problem

The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization that has been recently proposed is the $k$-anonymity. This approach requires that the rows of a table are partitioned in clusters of size at least $k$ and that all the rows in a cluster become the same tuple, after the suppression of some entries. The natural optimization problem, where the goal is to minimize the number of suppressed entries, is known to be APX-hard even when the records values are over a binary alphabet and $k=3$, and when the records have length at most 8 and $k=4$ . In this paper we study how the complexity of the problem is influenced by different parameters. In this paper we follow this direction of research, first showing that the problem is W[1]-hard when parameterized by the size of the solution (and the value $k$). Then we exhibit a fixed parameter algorithm, when the problem is parameterized by the size of the alphabet and the number of columns. Finally, we investigate the computational (and approximation) complexity of the $k$-anonymity problem, when restricting the instance to records having length bounded by 3 and $k=3$. We show that such a restriction is APX-hard.Comment: 22 pages, 2 figure

Non-surgical spinal decompression therapy: does the scientific literature support efficacy claims made in the advertising media?

<p>Abstract</p> <p>Background</p> <p>Traction therapy has been utilized in the treatment of low back pain for decades. The most recent incarnation of traction therapy is non-surgical spinal decompression therapy which can cost over $100,000. This form of therapy has been heavily marketed to manual therapy professions and subsequently to the consumer. The purpose of this paper is to initiate a debate pertaining to the relationship between marketing claims and the scientific literature on non-surgical spinal decompression.</p> <p>Discussion</p> <p>Only one small randomized controlled trial and several lower level efficacy studies have been performed on spinal decompression therapy. In general the quality of these studies is questionable. Many of the studies were performed using the VAX-D^®unit which places the patient in a prone position. Often companies utilize this research for their marketing although their units place the patient in the supine position.</p> <p>Summary</p> <p>Only limited evidence is available to warrant the routine use of non-surgical spinal decompression, particularly when many other well investigated, less expensive alternatives are available.</p

(So) Big Data and the transformation of the city

The exponential increase in the availability of large-scale mobility data has fueled the vision of smart cities that will transform our lives. The truth is that we have just scratched the surface of the research challenges that should be tackled in order to make this vision a reality. Consequently, there is an increasing interest among different research communities (ranging from civil engineering to computer science) and industrial stakeholders in building knowledge discovery pipelines over such data sources. At the same time, this widespread data availability also raises privacy issues that must be considered by both industrial and academic stakeholders. In this paper, we provide a wide perspective on the role that big data have in reshaping cities. The paper covers the main aspects of urban data analytics, focusing on privacy issues, algorithms, applications and services, and georeferenced data from social media. In discussing these aspects, we leverage, as concrete examples and case studies of urban data science tools, the results obtained in the “City of Citizens” thematic area of the Horizon 2020 SoBigData initiative, which includes a virtual research environment with mobility datasets and urban analytics methods developed by several institutions around Europe. We conclude the paper outlining the main research challenges that urban data science has yet to address in order to help make the smart city vision a reality

De-identifying a public use microdata file from the Canadian national discharge abstract database

<p>Abstract</p> <p>Background</p> <p>The Canadian Institute for Health Information (CIHI) collects hospital discharge abstract data (DAD) from Canadian provinces and territories. There are many demands for the disclosure of this data for research and analysis to inform policy making. To expedite the disclosure of data for some of these purposes, the construction of a DAD public use microdata file (PUMF) was considered. Such purposes include: confirming some published results, providing broader feedback to CIHI to improve data quality, training students and fellows, providing an easily accessible data set for researchers to prepare for analyses on the full DAD data set, and serve as a large health data set for computer scientists and statisticians to evaluate analysis and data mining techniques. The objective of this study was to measure the probability of re-identification for records in a PUMF, and to de-identify a national DAD PUMF consisting of 10% of records.</p> <p>Methods</p> <p>Plausible attacks on a PUMF were evaluated. Based on these attacks, the 2008-2009 national DAD was de-identified. A new algorithm was developed to minimize the amount of suppression while maximizing the precision of the data. The acceptable threshold for the probability of correct re-identification of a record was set at between 0.04 and 0.05. Information loss was measured in terms of the extent of suppression and entropy.</p> <p>Results</p> <p>Two different PUMF files were produced, one with geographic information, and one with no geographic information but more clinical information. At a threshold of 0.05, the maximum proportion of records with the diagnosis code suppressed was 20%, but these suppressions represented only 8-9% of all values in the DAD. Our suppression algorithm has less information loss than a more traditional approach to suppression. Smaller regions, patients with longer stays, and age groups that are infrequently admitted to hospitals tend to be the ones with the highest rates of suppression.</p> <p>Conclusions</p> <p>The strategies we used to maximize data utility and minimize information loss can result in a PUMF that would be useful for the specific purposes noted earlier. However, to create a more detailed file with less information loss suitable for more complex health services research, the risk would need to be mitigated by requiring the data recipient to commit to a data sharing agreement.</p