Rosana Veroneze
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rosana Veroneze has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
Fernando J. Von Zuben
Department of Computer Engineering and Industrial Automation, School of Electrical and Computer Engineering, University of Campinas (UNICAMP), Campinas, SP, Brazil
6 shared publications- Fernando JosÉ von Zuben
Universidade Estadual de Campinas (UNICAMP)
3 shared publications Arindam Banerjee
2 shared publicationsAlexander Romanha Santos
1 shared publicationAxel Legay
1 shared publication- Bernardo C. Rodrigues
Universidade Estadual de Campinas (UNICAMP)
1 shared publication
Latest Publications
- 8 September 2026
- Published by Springer Nature
- p. 40-58
Towards Associative Classification in Distributed Environments
- 8 September 2026
- Published by Springer Nature
- p. 40-58
Towards Associative Classification in Distributed Environments
- 2 September 2026
- Published by Springer Nature
- p. 111-120
Comparing Local Neighborhood-Based Collaborative Filtering Variants: A Trade-Off Between Prediction Performance and Coverage
- 2 September 2026
- Published by Springer Nature
- p. 111-120
Comparing Local Neighborhood-Based Collaborative Filtering Variants: A Trade-Off Between Prediction Performance and Coverage
- 23 January 2024
- Published by Associacao Brasileira de Inteligencia Computacional - ABRICOM
Wearable Sensor-Based Sleep Quality Recommendation Based on Association Rules
Título: Wearable Sensor-Based Sleep Quality Recommendation Based on Association Rules Autores: Aleksander Romanha Santos, Rosana Veroneze, Fernando J. Von Zuben, Emely Pujolli da Silva, Fernando J. Von Zuben Resumo: Frequent pattern mining and the subsequent proposition of association rules are Read More ...
- 23 January 2024
- Published by Associacao Brasileira de Inteligencia Computacional - ABRICOM
Wearable Sensor-Based Sleep Quality Recommendation Based on Association Rules
Título: Wearable Sensor-Based Sleep Quality Recommendation Based on Association Rules Autores: Aleksander Romanha Santos, Rosana Veroneze, Fernando J. Von Zuben, Emely Pujolli da Silva, Fernando J. Von Zuben Resumo: Frequent pattern mining and the subsequent proposition of association rules are Read More ...
- 27 May 2023
- Published by Springer Nature
- p. 95-107
RL-Net: Interpretable Rule Learning with Neural Networks
- 27 May 2023
- Published by Springer Nature
- p. 95-107
RL-Net: Interpretable Rule Learning with Neural Networks
- 25 July 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 127
Packer classification based on association rule mining
- 25 July 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 127
Packer classification based on association rule mining
- Open Access
- 2 October 2020
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 15 (10) , e0240269
Using association rule mining to jointly detect clinical features and differentially expressed genes related to chronic inflammatory diseases
It is increasingly common to find patients affected by a combination of type 2 diabetes mellitus (T2DM), dyslipidemia (DLP) and periodontitis (PD), which are chronic inflammatory diseases. More studies able to capture unknown relationships among these diseases will contribute to raise biological and clinical evidence. The aim of this study was to apply association rule mining (ARM) to discover whether there are consistent patterns of clinical features (CFs) and differentially expressed genes (DEGs) relevant to these diseases. We intend to reinforce the evidence of the T2DM-DLP-PD-interplay and demonstrate the ARM ability to provide new insights into multivariate pattern discovery.
- 2 October 2020
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 15 (10) , e0240269
Open AccessUsing association rule mining to jointly detect clinical features and differentially expressed genes related to chronic inflammatory diseases
It is increasingly common to find patients affected by a combination of type 2 diabetes mellitus (T2DM), dyslipidemia (DLP) and periodontitis (PD), which are chronic inflammatory diseases. More studies able to capture unknown relationships among these diseases will contribute to raise biological and clinical evidence. The aim of this study was to apply association rule mining (ARM) to discover whether there are consistent patterns of clinical features (CFs) and differentially expressed genes (DEGs) relevant to these diseases. We intend to reinforce the evidence of the T2DM-DLP-PD-interplay and demonstrate the ARM ability to provide new insights into multivariate pattern discovery.
- Open Access
New advances in enumerative biclustering algorithms with online partitioning
This paper further extends RIn-Close_CVC, a biclustering algorithm capable of performing an efficient, complete, correct and non-redundant enumeration of maximal biclusters with constant values on columns in numerical datasets. By avoiding a priori partitioning and itemization of the dataset, RIn-Close_CVC implements an online partitioning, which is demonstrated here to guide to more informative biclustering results. The improved algorithm is called RIn-Close_CVC3, keeps those attractive properties of RIn-Close_CVC, as formally proved here, and is characterized by: a drastic reduction in memory usage; a consistent gain in runtime; additional ability to handle datasets with missing values; and additional ability to operate with attributes characterized by distinct distributions or even mixed data types. The experimental results include synthetic and real-world datasets used to perform scalability and sensitivity analyses. As a practical case study, a parsimonious set of relevant and interpretable mixed-attribute-type rules is obtained in the context of supervised descriptive pattern mining.
Open AccessNew advances in enumerative biclustering algorithms with online partitioning
This paper further extends RIn-Close_CVC, a biclustering algorithm capable of performing an efficient, complete, correct and non-redundant enumeration of maximal biclusters with constant values on columns in numerical datasets. By avoiding a priori partitioning and itemization of the dataset, RIn-Close_CVC implements an online partitioning, which is demonstrated here to guide to more informative biclustering results. The improved algorithm is called RIn-Close_CVC3, keeps those attractive properties of RIn-Close_CVC, as formally proved here, and is characterized by: a drastic reduction in memory usage; a consistent gain in runtime; additional ability to handle datasets with missing values; and additional ability to operate with attributes characterized by distinct distributions or even mixed data types. The experimental results include synthetic and real-world datasets used to perform scalability and sensitivity analyses. As a practical case study, a parsimonious set of relevant and interpretable mixed-attribute-type rules is obtained in the context of supervised descriptive pattern mining.
- Open Access
RIn-Close_CVC2: an even more efficient enumerative algorithm for biclustering of numerical datasets
RIn-Close_CVC is an efficient (take polynomial time per bicluster), complete (find all maximal biclusters), correct (all biclusters attend the user-defined level of consistency) and non-redundant (all the obtained biclusters are maximal and the same bicluster is not enumerated more than once) enumerative algorithm for mining maximal biclusters with constant values on columns in numerical datasets. Despite RIn-Close_CVC has all these outstanding properties, it has a high computational cost in terms of memory usage because it must keep a symbol table in memory to prevent a maximal bicluster to be found more than once. In this paper, we propose a new version of RIn-Close_CVC, named RIn-Close_CVC2, that does not use a symbol table to prevent redundant biclusters, and keeps all these four properties. We also prove that these algorithms actually possess these properties. Experiments are carried out with synthetic and real-world datasets to compare RIn-Close_CVC and RIn-Close_CVC2 in terms of memory usage and runtime. The experimental results show that RIn-Close_CVC2 brings a large reduction in memory usage and, in average, significant runtime gain when compared to its predecessor.
Open AccessRIn-Close_CVC2: an even more efficient enumerative algorithm for biclustering of numerical datasets
RIn-Close_CVC is an efficient (take polynomial time per bicluster), complete (find all maximal biclusters), correct (all biclusters attend the user-defined level of consistency) and non-redundant (all the obtained biclusters are maximal and the same bicluster is not enumerated more than once) enumerative algorithm for mining maximal biclusters with constant values on columns in numerical datasets. Despite RIn-Close_CVC has all these outstanding properties, it has a high computational cost in terms of memory usage because it must keep a symbol table in memory to prevent a maximal bicluster to be found more than once. In this paper, we propose a new version of RIn-Close_CVC, named RIn-Close_CVC2, that does not use a symbol table to prevent redundant biclusters, and keeps all these four properties. We also prove that these algorithms actually possess these properties. Experiments are carried out with synthetic and real-world datasets to compare RIn-Close_CVC and RIn-Close_CVC2 in terms of memory usage and runtime. The experimental results show that RIn-Close_CVC2 brings a large reduction in memory usage and, in average, significant runtime gain when compared to its predecessor.
- Open Access
Efficient mining of maximal biclusters in mixed-attribute datasets
This paper presents a novel enumerative biclustering algorithm to directly mine all maximal biclusters in mixed-attribute datasets (containing both numerical and categorical attributes), with or without missing values. The proposal is an extension of RIn-Close_CVC, which was originally conceived to mine perfect or perturbed biclusters with constant values on columns solely from numerical datasets, and without missing values. Even endowed with additional and more general features, the extended RIn-Close_CVC retains four key properties: (1) efficiency, (2) completeness, (3) correctness, and (4) non-redundancy. Our proposal is the first one to deal with mixed-attribute datasets without requiring any pre-processing step, such as discretization and itemization of real-valued attributes. This is a decisive aspect, because discretization and itemization implies a priori decisions, with information loss and no clear control over the consequences. On the other hand, even having to specify a priori an individual threshold for each numerical attribute, that will be used to indicate internal consistency per attribute, each threshold will be applied during the construction of the biclusters, shaping the peculiarities of the data distribution. We also explore the strong connection between biclustering and frequent pattern mining to (1) provide filters to select a compact bicluster set that exhibits high relevance and low redundancy, and (2) in the case of labeled datasets, automatically present the biclusters in a user-friendly and intuitive form, by means of quantitative class association rules. Our experimental results showed that the biclusters yield a parsimonious set of relevant rules, providing useful and interpretable models for five mixed-attribute labeled datasets.
Open AccessEfficient mining of maximal biclusters in mixed-attribute datasets
This paper presents a novel enumerative biclustering algorithm to directly mine all maximal biclusters in mixed-attribute datasets (containing both numerical and categorical attributes), with or without missing values. The proposal is an extension of RIn-Close_CVC, which was originally conceived to mine perfect or perturbed biclusters with constant values on columns solely from numerical datasets, and without missing values. Even endowed with additional and more general features, the extended RIn-Close_CVC retains four key properties: (1) efficiency, (2) completeness, (3) correctness, and (4) non-redundancy. Our proposal is the first one to deal with mixed-attribute datasets without requiring any pre-processing step, such as discretization and itemization of real-valued attributes. This is a decisive aspect, because discretization and itemization implies a priori decisions, with information loss and no clear control over the consequences. On the other hand, even having to specify a priori an individual threshold for each numerical attribute, that will be used to indicate internal consistency per attribute, each threshold will be applied during the construction of the biclusters, shaping the peculiarities of the data distribution. We also explore the strong connection between biclustering and frequent pattern mining to (1) provide filters to select a compact bicluster set that exhibits high relevance and low redundancy, and (2) in the case of labeled datasets, automatically present the biclusters in a user-friendly and intuitive form, by means of quantitative class association rules. Our experimental results showed that the biclusters yield a parsimonious set of relevant rules, providing useful and interpretable models for five mixed-attribute labeled datasets.
- 1 February 2017
- Published by Elsevier in Information Sciences
- Vol. 379, 288-309
Enumerating all maximal biclusters in numerical datasets
- 1 February 2017
- Published by Elsevier in Information Sciences
- Vol. 379, 288-309
Enumerating all maximal biclusters in numerical datasets