Search results for "Method"

La Valutazione delle Tecnologie Sanitarie. The Health Technology Assessment

2004

The aim of this paper was to describe exhaustively, but concisely, the matter of the health technology assessment. It is a method of evaluating health technologies based on principles and tools of Evidence Based Medicine. We started from etymology to speak about its definition and implementation methodology. Moreover we guide the reader throughout the constellation of international societies of health technology assessment and the meaning of their international cooperation. Finally, we deal with the health technology assessment as a tool being an integral part of the clinical governance process.

From Research on Dialogical Practice to Dialogical Research: Open Dialogue Is Based on a Continuous Scientific Analysis

2020

Open dialogue is based on systematic research since the very beginning of the development. In every new phase of the development and reorganization of the psychiatric organization, research was needed for both understanding the phenomenon of the therapeutic processes and detecting the outcome of the new approach. The research is “naturalistic” in the way that it takes place within the everyday – natural – clinical practice following what happens there. This means that the research designs do not change the clinical practice for the research, as so often done in empiristic clinical trials. The research employs “mixed method research” to identify all the possible elements of the object of the…

FP247RENAL ALTERATIONS AFTER A MARATHON AND THE IMPACT OF POSTRACE RECOVERY METHOD ON THEIR RESOLUTION: A CLINICAL TRIAL

2018

A study on recovering the cloud top-height from infra-red video sequences

2004

In this paper we present some preliminary results on an opticalfow based technique aimed at recovering the cloud-top height from infra-red image sequences. The recovery of the cloud-top height from satellite infra-red images is an important topic in meteorological studies, and is traditionally based on the analysis of the temperature maps. In this work we explore the feasibility for this problem of a technique based on a robust multi-resolution opticalfow algorithm. The robustness is achieved adopting a Least Median of Squares paradigm. The algorithm has been tested on semi-synthetic data (i.e. real data that have been synthetically warped in order to have a reliable ground truth for the mo…

SMART: Unique splitting-while-merging framework for gene clustering

2014

© 2014 Fa et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Successful clustering algorithms are highly dependent on parameter settings. The clustering performance degrades significantly unless parameters are properly set, and yet, it is difficult to set these parameters a priori. To address this issue, in this paper, we propose a unique splitting-while-merging clustering framework, named "splitting merging awareness tactics" (SMART), which does not require any a priori knowledge of either the number …

Computation Cluster Validation in the Big Data Era

2017

Data-driven class discovery, i.e., the inference of cluster structure in a dataset, is a fundamental task in Data Analysis, in particular for the Life Sciences. We provide a tutorial on the most common approaches used for that task, focusing on methodologies for the prediction of the number of clusters in a dataset. Although the methods that we present are general in terms of the data for which they can be used, we offer a case study relevant for Microarray Data Analysis.

A local complexity based combination method for decision forests trained with high-dimensional data

2012

Accurate machine learning with high-dimensional data is affected by phenomena known as the “curse” of dimensionality. One of the main strategies explored in the last decade to deal with this problem is the use of multi-classifier systems. Several of such approaches are inspired by the Random Subspace Method for the construction of decision forests. Furthermore, other studies rely on estimations of the individual classifiers' competence, to enhance the combination in the multi-classifier and improve the accuracy. We propose a competence estimate which is based on local complexity measurements, to perform a weighted average combination of the decision forest. Experimental results show how thi…

Data Analysis and Bioinformatics

2007

Data analysis methods and techniques are revisited in the case of biological data sets. Particular emphasis is given to clustering and mining issues. Clustering is still a subject of active research in several fields such as statistics, pattern recognition, and machine learning. Data mining adds to clustering the complications of very large data-sets with many attributes of different types. And this is a typical situation in biology. Some cases studies are also described.

Structural clustering of millions of molecular graphs

2014

We propose an algorithm for clustering very large molecular graph databases according to scaffolds (i.e., large structural overlaps) that are common between cluster members. Our approach first partitions the original dataset into several smaller datasets using a greedy clustering approach named APreClus based on dynamic seed clustering. APreClus is an online and instance incremental clustering algorithm delaying the final cluster assignment of an instance until one of the so-called pending clusters the instance belongs to has reached significant size and is converted to a fixed cluster. Once a cluster is fixed, APreClus recalculates the cluster centers, which are used as representatives for…

A Feature Set Decomposition Method for the Construction of Multi-classifier Systems Trained with High-Dimensional Data

2013

Data mining for the discovery of novel, useful patterns, encounters obstacles when dealing with high-dimensional datasets, which have been documented as the "curse" of dimensionality. A strategy to deal with this issue is the decomposition of the input feature set to build a multi-classifier system. Standalone decomposition methods are rare and generally based on random selection. We propose a decomposition method which uses information theory tools to arrange input features into uncorrelated and relevant subsets. Experimental results show how this approach significantly outperforms three baseline decomposition methods, in terms of classification accuracy.