Cesar Henrique Comin

Cesar Henrique Comin

Auto-generated profile, based on publicly available information

Cesar Henrique Comin

Department of Computer Science Federal University of São Carlos São Carlos SP Brazil

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 January 2019 in PLOS ONE
Verified
Journal Article
Open access
PDF file
MRMayra Z Rodriguez
Mayra Z Rodriguez
CCCesar H Comin
Cesar H Comin
DCDalcimar Casanova
Dalcimar Casanova
OBOdemir M Bruno
Odemir M Bruno
DADiego R Amancio
Diego R Amancio
FRFrancisco A Rodrigues
Francisco A Rodrigues
Many real-world systems can be studied in terms of pattern recognition tasks, so that proper use (and understanding) of machine learning methods in practical applications becomes essential. While many classification methods have been proposed, there is no consensus on which methods are more suitable for a given dataset. As a consequence, it is important to comprehensively compare methods in many possible scenarios. In this context, we performed a systematic comparison of 9 well-known clustering methods available in the R language assuming normally distributed data. In order to account for the many possible variations of data, we considered artificial datasets with several tunable properties (number of classes, separation between classes, etc). In addition, we also evaluated the sensitivity of the clustering methods with regard to their parameters configuration. The results revealed that, when considering the default configurations of the adopted methods, the spectral approach tended to present particularly good performance. We also found that the default configuration of the adopted implementations was not always accurate. In these cases, a simple approach based on random selection of parameters values proved to be a good alternative to improve the performance. All in all, the reported approach provides subsidies guiding the choice of clustering algorithms.

24 April 2014 in PLOS ONE
Verified
Journal Article
Open access
PDF file
DADiego Amancio
Diego Amancio
CCCesar Henrique Comin
Cesar Henrique Comin
DCDalcimar Casanova
Dalcimar Casanova
GTGonzalo Travieso
Gonzalo Travieso
OBOdemir Martinez Bruno
Odemir Martinez Bruno
LCLuciano Da Fontoura Costa
Luciano Da Fontoura Costa
Pattern recognition has been employed in a myriad of industrial, commercial and academic applications. Many techniques have been devised to tackle such a diversity of applications. Despite the long tradition of pattern recognition research, there is no technique that yields the best classification in all scenarios. Therefore, as many techniques as possible should be considered in high accuracy applications. Typical related works either focus on the performance of a given algorithm or compare various classification methods. In many occasions, however, researchers who are not experts in the field of machine learning have to deal with practical classification tasks without an in-depth knowledge about the underlying parameters. Actually, the adequate choice of classifiers and parameters in such practical circumstances constitutes a long-standing problem and is one of the subjects of the current paper. We carried out a performance study of nine well-known classifiers implemented in the Weka framework and compared the influence of the parameter configurations on the accuracy. The default configuration of parameters in Weka was found to provide near optimal performance for most cases, not including methods such as the support vector machine (SVM). In addition, the k-nearest neighbor method frequently allowed the best accuracy. In certain conditions, it was possible to improve the quality of SVM by more than 20% with respect to their default parameter configuration.

1 September 2014 in Neuron
Verified
Journal Article
Closed access
BLBaptiste Lacoste
Baptiste Lacoste
CCCesar H. Comin
Cesar H. Comin
ABAyal Ben-Zvi
Ayal Ben-Zvi
PKPascal S. Kaeser
Pascal S. Kaeser
XXXiaoyin Xu
Xiaoyin Xu
CGChenghua Gu
Chenghua Gu

15 November 2011 in Physical Review E
Verified
Journal Article
Closed access
CCCesar Henrique Comin
Cesar Henrique Comin
LCLuciano Costa
Luciano Costa
When dealing with the dissemination of epidemics, one important question that can be asked is the location where the contamination began. In this paper, we analyze three spreading schemes and propose and validate an effective methodology for the identification of the source nodes. The method is based on the calculation of the centrality of the nodes on the sampled network, expressed here by degree, betweenness, closeness, and eigenvector centrality. We show that the source node tends to have the highest measurement values. The potential of the methodology is illustrated with respect to three theoretical complex network models as well as a real-world network, the email network of the University Rovira i Virgili.

13 July 2020 in Nature Neuroscience
Verified
Journal Article
Closed access
PDF file
JOJulie Ouellette
Julie Ouellette
XTXavier Toussay
Xavier Toussay
CCCesar H. Comin
Cesar H. Comin
LCLuciano da F. Costa
Luciano da F. Costa
MHMirabelle Ho
Mirabelle Ho
BLBaptiste Lacoste
Baptiste Lacoste

12 May 2014 in Physical Review E
Verified
Journal Article
Closed access
CYCheng Ye
Cheng Ye
RWRichard C. Wilson
Richard C. Wilson
CCCésar H. Comin
César H. Comin
LCLuciano Costa
Luciano Costa
EHEdwin Hancock
Edwin Hancock
In this paper, we develop an entropy measure for assessing the structural complexity of directed graphs. Although there are many existing alternative measures for quantifying the structural properties of undirected graphs, there are relatively few corresponding measures for directed graphs. To fill this gap in the literature, we explore an alternative technique that is applicable to directed graphs. We commence by using Chung's generalization of the Laplacian of a directed graph to extend the computation of von Neumann entropy from undirected to directed graphs. We provide a simplified form of the entropy which can be expressed in terms of simple node in-degree and out-degree statistics. Moreover, we find approximate forms of the von Neumann entropy that apply to both weakly and strongly directed graphs, and that can be used to characterize network structure. We illustrate the usefulness of these simplified entropy forms defined in this paper on both artificial and real-world data sets, including structures from protein databases and high energy physics theory citation networks.