Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Giancarlo Raiconi

dblp:33/6076 · DBLP profile ↗
← Back
19ranked-venue papers
0as first author
0since 2021 · last 2016
0000-0001-5307-7173ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 14Applied, interdisciplinary, general and emerging computing · 4Databases, data management, data science and information retrieval · 2Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › gene expression analysis
gene expression clustering
0.112006
A multi-step approach to time series analysis and gene expression clustering · Bioinform. 2006
Bioinformatics and computational biology › gene expression analysis › gene expression clustering
temporal gene expression clustering
0.112006
A multi-step approach to time series analysis and gene expression clustering · Bioinform. 2006
Data mining
clustering
0.012004
Probabilistic Principal Surfaces for Yeast Gene Microarray Data Mining · ICDM 2004
Data mining
dimensionality reduction
0.012004
Probabilistic Principal Surfaces for Yeast Gene Microarray Data Mining · ICDM 2004
Data mining › clustering
high-dimensional clustering
0.012004
Probabilistic Principal Surfaces for Yeast Gene Microarray Data Mining · ICDM 2004
Bioinformatics and computational biology
gene expression analysis
0.012004
Probabilistic Principal Surfaces for Yeast Gene Microarray Data Mining · ICDM 2004
Bioinformatics and computational biology › gene expression analysis
microarray data
0.012004
Probabilistic Principal Surfaces for Yeast Gene Microarray Data Mining · ICDM 2004

Methods — techniques the papers use, named apart from their topics

probabilistic principal surfaces · 0.2nonlinear PCA · 0.1negentropy · 0.1agglomerative clustering · 0.1
YearPublicationVenuePosition
2016 Passive dense stereo vision on the Myriad2 VPU
abstract
Presents a collection of slides covering the following topics: passive-dense stereo vision; Myriad2 VPU; direct memory access controller; DMA controller; image matching; and computer vision.
Luca Puglia, Mircea Ionica, Giancarlo Raiconi, David Moloney
Hot Chips Symposium3
2015 A multi-view genomic data simulator
abstract
BACKGROUND: OMICs technologies allow to assay the state of a large number of different features (e.g., mRNA expression, miRNA expression, copy number variation, DNA methylation, etc.) from the same samples. The objective of these experiments is usually to find a reduced set of significant features, which can be used to differentiate the conditions assayed. In terms of development of novel feature selection computational methods, this task is challenging for the lack of fully annotated biological datasets to be used for benchmarking. A possible way to tackle this problem is generating appropriate synthetic datasets, whose composition and behaviour are fully controlled and known a priori. RESULTS: Here we propose a novel method centred on the generation of networks of interactions among different biological molecules, especially involved in regulating gene expression. Synthetic datasets are obtained from ordinary differential equations based models with known parameters. Our results show that the generated datasets are well mimicking the behaviour of real data, for popular data analysis methods are able to selectively identify existing interactions. CONCLUSIONS: The proposed method can be used in conjunction to real biological datasets in the assessment of data mining techniques. The main strength of this method consists in the full control on the simulated data while retaining coherence with the real biological processes. The R package MVBioDataSim is freely available to the scientific community at http://neuronelab.unisa.it/?p=1722.
Michele Fratello, Angela Serra, Vittorio Fortino, Giancarlo Raiconi, Roberto Tagliaferri, Dario Greco
BMC Bioinform.4
2015 MVDA: a multi-view genomic data integration methodology
abstract
BACKGROUND: Multiple high-throughput molecular profiling by omics technologies can be collected for the same individuals. Combining these data, rather than exploiting them separately, can significantly increase the power of clinically relevant patients subclassifications. RESULTS: We propose a multi-view approach in which the information from different data layers (views) is integrated at the levels of the results of each single view clustering iterations. It works by factorizing the membership matrices in a late integration manner. We evaluated the effectiveness and the performance of our method on six multi-view cancer datasets. In all the cases, we found patient sub-classes with statistical significance, identifying novel sub-groups previously not emphasized in literature. Our method performed better as compared to other multi-view clustering algorithms and, unlike other existing methods, it is able to quantify the contribution of single views on the final results. CONCLUSION: Our observations suggest that integration of prior information with genomic features in the subtyping analysis is an effective strategy in identifying disease subgroups. The methodology is implemented in R and the source code is available online at http://neuronelab.unisa.it/a-multi-view-genomic-data-integration-methodology/ .
Angela Serra, Michele Fratello, Vittorio Fortino, Giancarlo Raiconi, Roberto Tagliaferri, Dario Greco
BMC Bioinform.4
2013 An improved combinatorial biclustering algorithm
Ekaterina Nosova, Francesco Napolitano, Roberto Amato, Sergio Cocozza, Gennaro Miele, Giancarlo Raiconi, Roberto Tagliaferri
Neural Comput. Appl.6
2011 A multi-Biclustering Combinatorial Based algorithm
abstract
In the last years a large amount of information about genomes was discovered, increasing the complexity of analysis. Therefore the most advanced techniques and algorithms are required. In many cases researchers use unsupervised clustering. But the inability of clustering to solve a number of tasks requires new algorithms. So, recently, scientists turned their attention to the biclustering techniques. In this paper we propose a novel biclustering technique, that we call Combinatorial Biclustering Algorithm (BCA). This technique permits to solve the following problems: 1) classification of data with respect to rows and columns together; 2) discovering of the overlapped biclusters; 3) definition of the minimal number of rows and columns in biclusters; 4) finding all biclusters together. We apply our model to two synthetic and one real biological data sets and show the results.
Ekaterina Nosova, Giancarlo Raiconi, Roberto Tagliaferri
CIDM2
2011 Beyond classical consensus clustering: The least squares approach to multiple solutions
Loredana Murino, Claudia Angelini, Italia De Feis, Giancarlo Raiconi, Roberto Tagliaferri
Pattern Recognit. Lett.4
2010 Gene ontology fuzzy-enrichment analysis to investigate drug mode-of-action
abstract
We investigated the possibility of gaining information on the mode of action of a set of compounds by means of Gene Ontology (GO) enrichment analysis. To this aim, we developed a new method, based on fuzzy-sets, which is able to compute sets of genes that are consistently differentially expressed when treating cells with the analyzed compounds. Then a Gene Ontology enrichment analysis is performed on these sets. The method has been tested on several different groups of drugs, whose similarity in mode of action has been predicted by a gene-expression based, unsupervised, approach and verified by searching literature. The obtained results show that GO terms that are overrepresented in these fuzzy sets provide a quick and "easy-tointerpret" view of the mode of action of the analyzed drugs.
Francesco Iorio, Loredana Murino, Diego di Bernardo, Giancarlo Raiconi, Roberto Tagliaferri
IJCNN4
2010 A novel approach to simulate gene-environment interactions in complex diseases
abstract
BACKGROUND: Complex diseases are multifactorial traits caused by both genetic and environmental factors. They represent the major part of human diseases and include those with largest prevalence and mortality (cancer, heart disease, obesity, etc.). Despite a large amount of information that has been collected about both genetic and environmental risk factors, there are few examples of studies on their interactions in epidemiological literature. One reason can be the incomplete knowledge of the power of statistical methods designed to search for risk factors and their interactions in these data sets. An improvement in this direction would lead to a better understanding and description of gene-environment interactions. To this aim, a possible strategy is to challenge the different statistical methods against data sets where the underlying phenomenon is completely known and fully controllable, for example simulated ones. RESULTS: We present a mathematical approach that models gene-environment interactions. By this method it is possible to generate simulated populations having gene-environment interactions of any form, involving any number of genetic and environmental factors and also allowing non-linear interactions as epistasis. In particular, we implemented a simple version of this model in a Gene-Environment iNteraction Simulator (GENS), a tool designed to simulate case-control data sets where a one gene-one environment interaction influences the disease risk. The main aim has been to allow the input of population characteristics by using standard epidemiological measures and to implement constraints to make the simulator behaviour biologically meaningful. CONCLUSIONS: By the multi-logistic model implemented in GENS it is possible to simulate case-control samples of complex disease where gene-environment interactions influence the disease risk. The user has full control of the main characteristics of the simulated population and a Monte Carlo process allows random variability. A knowledge-based approach reduces the complexity of the mathematical model by using reasonable biological constraints and makes the simulation more understandable in biological terms. Simulated data sets can be used for the assessment of novel statistical methods or for the evaluation of the statistical power when designing a study.
Roberto Amato, Michele Pinelli, Daniel D'Andrea, Gennaro Miele, Mario Nicodemi, Giancarlo Raiconi, Sergio Cocozza
BMC Bioinform.6
2009 Global optimization, Meta Clustering and consensus clustering for class prediction
abstract
Clustering of real-world data is often ill-posed. Because of noise and intrinsic ambiguity in data, optimization models attempting to maximize a fitness function can be misled by the assumption of uniqueness of the solution. In this work we present a methodology including classic and novel techniques to approach clustering in a systematic way, with two application examples to biological data sets. The methodology is based on a process that generates multiple clustering solutions (using global optimization), performs cluster analysis on such clusterings (i.e. meta clustering) and analyzes the obtained clusterings by the appropriate application of different consensus techniques. In order to validate the method, we seek for the solutions that best match the real class labels, exploiting only a random sample of them. Finally, we guess the class labels of the remaining patterns using cluster enrichment information and verify the percentage of correct assignments for each class. The optimization of clustering objective functions together with the use of partial labeling puts the described approach in between unsupervised and semi-supervised methods.
Ida Bifulco, Carmine Fedullo, Francesco Napolitano, Giancarlo Raiconi, Roberto Tagliaferri
IJCNN4
2008 Robust Clustering by Aggregation and Intersection Methods
Ida Bifulco, Carmine Fedullo, Francesco Napolitano, Giancarlo Raiconi, Roberto Tagliaferri
KES (3)4
2008 Using Global Optimization to Explore Multiple Solutions of Clustering Problems
Ida Bifulco, Loredana Murino, Francesco Napolitano, Giancarlo Raiconi, Roberto Tagliaferri
KES (3)4
2008 Clustering and visualization approaches for human cell cycle gene expression data analysis
Francesco Napolitano, Giancarlo Raiconi, Roberto Tagliaferri, Angelo Ciaramella, Antonino Staiano, Gennaro Miele
Int. J. Approx. Reason.2
2008 Interactive data analysis and clustering of genomic data
Angelo Ciaramella, Sergio Cocozza, Francesco Iorio, Gennaro Miele, Francesco Napolitano, Michele Pinelli, Giancarlo Raiconi, Roberto Tagliaferri
Neural Networks7
2007 Clustering, Assessment and Validation: an application to gene expression data
abstract
In this work a multi-step approach for clustering assessment, visualization and data validation is introduced. Three main approaches for data clustering are used and compared: K-means, self organizing maps and probabilistic principal surfaces. A model explorer approach with different similarity measures is used to obtain the best parameters of the methods. The approach is used to identify genes periodically expressed in tumors related to the human cell cycle. Finally, clusters are validated by using GO term information.
Angelo Ciaramella, Sergio Cocozza, Francesco Iorio, Gennaro Miele, Francesco Napolitano, Michele Pinelli, Giancarlo Raiconi, Roberto Tagliaferri
IJCNN7
2006 A multi-step approach to time series analysis and gene expression clustering
abstract
MOTIVATION: The huge growth in gene expression data calls for the implementation of automatic tools for data processing and interpretation. RESULTS: We present a new and comprehensive machine learning data mining framework consisting in a non-linear PCA neural network for feature extraction, and probabilistic principal surfaces combined with an agglomerative approach based on Negentropy aimed at clustering gene microarray data. The method, which provides a user-friendly visualization interface, can work on noisy data with missing points and represents an automatic procedure to get, with no a priori assumptions, the number of clusters present in the data. Cell-cycle dataset and a detailed analysis confirm the biological nature of the most significant clusters. AVAILABILITY: The software described here is a subpackage part of the ASTRONEURAL package and is available upon request from the corresponding author. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Roberto Amato, Angelo Ciaramella, Natalia Deniskina, Carmine Del Mondo, Diego di Bernardo, Ciro Donalek, Giuseppe Longo, Giuseppe Mangano, Gennaro Miele, Giancarlo Raiconi, Antonino Staiano, Roberto Tagliaferri
Bioinform.10
2005 Data visualization methodologies for data mining systems in bioinformatics
abstract
Bioinformatics systems benefit from the use of data mining strategies to locate interesting and pertinent relationships within massive information. For example, data mining methods can ascertain and summarize the set of genes responding to a certain level of stress in an organism. Even a cursory glance through the literature in journals, reveals the persistent role of data mining in experimental biology. Integrating data mining within the context of experimental investigations is central to bioinformatics software. In this paper we describe the framework of probabilistic principal surfaces, a latent variable model which offers a large variety of appealing visualization capabilities and which can be successfully integrated in the context of microarray analysis. A preprocessing phase consisting of a nonlinear PCA neural network which seems to be very useful to deal with noisy and time dependent nature of microarray data has been added to this framework.
Antonino Staiano, Angelo Ciaramella, Giancarlo Raiconi, Roberto Tagliaferri, Roberto Amato, Giuseppe Longo, Gennaro Miele, Ciro Donalek
IJCNN3
2005 Genetic approach helps to speed classical Price algorithm for global optimization
Margherita Bresco, Giancarlo Raiconi, Fabrizio Barone, Rosario De Rosa, Leopoldo Milano
Soft Comput.2
2004 Probabilistic Principal Surfaces for Yeast Gene Microarray Data Mining
abstract
The recent technological advances are producing huge data sets in almost all fields of scientific research, from astronomy to genetics. Although each research field often requires ad-hoc, fine tuned, procedures to properly exploit all the available information inherently present in the data, there is an urgent need for a new generation of general computational theories and tools capable to boost most human activities of data analysis. Here, we propose probabilistic principal surfaces (PPS) as an effective high-D data visualization and clustering tool for data mining applications, emphasizing its flexibility and generality of use in data-rich field. In order to better illustrate the potentialities of the method, we also provide a real world case-study by discussing the use of PPS for the analysis of yeast gene expression levels from microarray chips.
Antonino Staiano, Lara De Vinco, Angelo Ciaramella, Giancarlo Raiconi, Roberto Tagliaferri, Roberto Amato, Giuseppe Longo, Ciro Donalek, Gennaro Miele, Diego di Bernardo
ICDM4
2003 Neural neZtworks in astronomy
Roberto Tagliaferri, Giuseppe Longo, Leopoldo Milano, Fausto Acernese, Fabrizio Barone, Angelo Ciaramella, Rosario De Rosa, Ciro Donalek, Antonio Eleuteri, Giancarlo Raiconi, Salvatore Sessa 0002, Antonino Staiano, Alfredo Volpicelli
Neural Networks10