Jesus Maria Pérez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jesus Maria Pérez has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Javier Muguerza
University of the Basque Country (UPV/EHU)
29 shared publications - Ibai Gurrutxaga
University of the Basque Country (UPV/EHU), San Sebastian, Spain
24 shared publications - Olatz Arbelaitz
Department of Computer Architecture and Technology, University of the Basque Country UPV/EHU, Donostia, Spain
24 shared publications - Jose Ignacio Martín
Department of Computer Architecture and Technology, University of the Basque Country (UPV/EHU), Donostia-San Sebastián, Spain
11 shared publications - Iñigo Perona
University of the Basque Country
9 shared publications Igor Ibarguren
Dept of Computer Science, Univ of the Basque Country, 20018 Donostia, Spain
4 shared publications
Latest Publications
- Open Access
- 12 August 2026
- Published by Elsevier in Engineering Science and Technology, an International Journal
- Vol. 81
Knowledge-based grinding burn detection: Signal segmentation, feature selection, and machine learning
- 12 August 2026
- Published by Elsevier in Engineering Science and Technology, an International Journal
- Vol. 81
Open AccessKnowledge-based grinding burn detection: Signal segmentation, feature selection, and machine learning
- 12 June 2024
- Published by Springer Nature
- p. 152-161
Driven PCTBagging: Seeking Greater Discriminating Capacity for the Same Level of Interpretability
- 12 June 2024
- Published by Springer Nature
- p. 152-161
Driven PCTBagging: Seeking Greater Discriminating Capacity for the Same Level of Interpretability
- Open Access
- 1 October 2018
- Published by Elsevier in Information Sciences
- Vol. 465, 505-522
UnPART: PART without the ‘partial’ condition of it
- 1 October 2018
- Published by Elsevier in Information Sciences
- Vol. 465, 505-522
Open AccessUnPART: PART without the ‘partial’ condition of it
- Open Access
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 13, 2656-2660
The Consolidated Tree Construction algorithm in imbalanced defect prediction datasets
In this short paper, we compare well-known rule/tree classifiers in software defect prediction with the CTC decision tree classifier designed to deal with class imbalanced. It is well-known that most software defect prediction datasets are highly imbalance (non-defective instances outnumber defective ones). In this work, we focused only on tree/rule classifiers as these are capable of explaining the decision, i.e., describing the metrics and thresholds that make a module error prone. Furthermore, rules/decision trees provide the advantage that they are easily understood and applied by project managers and quality assurance personnel. The CTC algorithm was designed to cope with class imbalance and noisy datasets instead of using preprocessing techniques (oversampling or undersampling), ensembles or cost weights of misclassification. The experimental work was carried out using the NASA datasets and results showed that induced CTC decision trees performed better or similar to the rest of the rule/tree classifiers.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 13, 2656-2660
Open AccessThe Consolidated Tree Construction algorithm in imbalanced defect prediction datasets
In this short paper, we compare well-known rule/tree classifiers in software defect prediction with the CTC decision tree classifier designed to deal with class imbalanced. It is well-known that most software defect prediction datasets are highly imbalance (non-defective instances outnumber defective ones). In this work, we focused only on tree/rule classifiers as these are capable of explaining the decision, i.e., describing the metrics and thresholds that make a module error prone. Furthermore, rules/decision trees provide the advantage that they are easily understood and applied by project managers and quality assurance personnel. The CTC algorithm was designed to cope with class imbalance and noisy datasets instead of using preprocessing techniques (oversampling or undersampling), ensembles or cost weights of misclassification. The experimental work was carried out using the NASA datasets and results showed that induced CTC decision trees performed better or similar to the rest of the rule/tree classifiers.
- 24 May 2017
- Published by Wiley in Expert Systems
- Vol. 34 (5)
CT <DT>: Extending the application of the consolidation methodology even further
The consolidation process, originally applied to the C4.5 tree induction algorithm, improved its discriminating capacity and stability. Consolidation creates multiple samples and builds a simple (nonmultiple) classifier by applying the ensemble process during the model construction phase. The work presented in this paper aims to show the consolidation process can improve algorithms other than C4.5 by applying the consolidation process to three tree induction algorithms: a variant of the chi‐squared automatic interaction detector (CHAID*), C4.4, and CHAIC (also a contribution of this paper). The consolidation of CHAID* and CHAIC, required solving the handicap of consolidating the value groupings proposed by each CHAID* or CHAIC tree for discrete attributes. The experimentation is divided in 3 classification contexts for 96 datasets. Results show that consolidated algorithms perform robustly, ranking competitively in all contexts, never falling into lower positions unlike most of the other rule‐induction algorithms considered in the study. When performing a global comparison consolidated algorithms rank in top positions.
- 24 May 2017
- Published by Wiley in Expert Systems
- Vol. 34 (5)
CT <DT>: Extending the application of the consolidation methodology even further
The consolidation process, originally applied to the C4.5 tree induction algorithm, improved its discriminating capacity and stability. Consolidation creates multiple samples and builds a simple (nonmultiple) classifier by applying the ensemble process during the model construction phase. The work presented in this paper aims to show the consolidation process can improve algorithms other than C4.5 by applying the consolidation process to three tree induction algorithms: a variant of the chi‐squared automatic interaction detector (CHAID*), C4.4, and CHAIC (also a contribution of this paper). The consolidation of CHAID* and CHAIC, required solving the handicap of consolidating the value groupings proposed by each CHAID* or CHAIC tree for discrete attributes. The experimentation is divided in 3 classification contexts for 96 datasets. Results show that consolidated algorithms perform robustly, ranking competitively in all contexts, never falling into lower positions unlike most of the other rule‐induction algorithms considered in the study. When performing a global comparison consolidated algorithms rank in top positions.
- 1 January 2017
- Published by Elsevier in Pattern Recognition Letters
- Vol. 85, 42-48
Analysis of several decision fusion strategies for clustering validation. Strategy definition, experiments and validation
- 1 January 2017
- Published by Elsevier in Pattern Recognition Letters
- Vol. 85, 42-48
Analysis of several decision fusion strategies for clustering validation. Strategy definition, experiments and validation
- 1 November 2016
- Published by Elsevier in Information Sciences
- Vol. 367-368, 927-952
BFPART: Best-First PART
- 1 November 2016
- Published by Elsevier in Information Sciences
- Vol. 367-368, 927-952
BFPART: Best-First PART
- Open Access
- 18 March 2016
- Published by EHU Press in EKAIA Euskal Herriko Unibertsitateko Zientzia eta Teknologia Aldizkaria
- No. 29,p. 155-178
J48Consolidated WEKA paketea, adibide ezohikoen patroiak identifikatzeko tresna
Artikulu honetan WEKA ikasketa automatikorako tresnarako CTC algoritmoaren inplementazioa, J48Consolidated paketea, aurkezten da. CTC algoritmoak lagin multzo bat sortzen du eta lagin guztietan dagoen ezagutza kontuan hartuta sailkapen zuhaitz bakarra eraikitzeko gai da, kasu berrien sailkapenaren azalpena galdu gabe. Gainera, lan honetan J48Consolidated-ek sortutako zuhaitzen emaitzak aztertuko dira errealitateko 36 sailkapen problematarako, laginketa mota desberdinetan oinarrituta, eta jatorrizko laginaren estaldura-maila desberdinekin. Emaitzek erakusten dute estaldura maila altuek orokorrean sailkatzeko gaitasuna handitzen dutela eta %75-eko lagin estratifikatuak erabiltzea aukerarik lehiakorrena dela problema hauetan.
- 18 March 2016
- Published by EHU Press in EKAIA Euskal Herriko Unibertsitateko Zientzia eta Teknologia Aldizkaria
- No. 29,p. 155-178
Open AccessJ48Consolidated WEKA paketea, adibide ezohikoen patroiak identifikatzeko tresna
Artikulu honetan WEKA ikasketa automatikorako tresnarako CTC algoritmoaren inplementazioa, J48Consolidated paketea, aurkezten da. CTC algoritmoak lagin multzo bat sortzen du eta lagin guztietan dagoen ezagutza kontuan hartuta sailkapen zuhaitz bakarra eraikitzeko gai da, kasu berrien sailkapenaren azalpena galdu gabe. Gainera, lan honetan J48Consolidated-ek sortutako zuhaitzen emaitzak aztertuko dira errealitateko 36 sailkapen problematarako, laginketa mota desberdinetan oinarrituta, eta jatorrizko laginaren estaldura-maila desberdinekin. Emaitzek erakusten dute estaldura maila altuek orokorrean sailkatzeko gaitasuna handitzen dutela eta %75-eko lagin estratifikatuak erabiltzea aukerarik lehiakorrena dela problema hauetan.
- 1 December 2015
- Published by Elsevier in Knowledge-Based Systems
- Vol. 90, 257-262
Corrigendum to “Coverage-based resampling: Building robust consolidated decision trees” [Knowledge-Based Systems 79(2015)51–67]
- 1 December 2015
- Published by Elsevier in Knowledge-Based Systems
- Vol. 90, 257-262
Corrigendum to “Coverage-based resampling: Building robust consolidated decision trees” [Knowledge-Based Systems 79(2015)51–67]
- 25 August 2015
- Published by Springer Nature
- p. 572-577
CTCHAID: Extending the Application of the Consolidation Methodology
- 25 August 2015
- Published by Springer Nature
- p. 572-577
CTCHAID: Extending the Application of the Consolidation Methodology