default search action
Guillermo Sánchez-Díaz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Manuel S. Lazo-Cortés
, Guillermo Sánchez-Díaz, Nelva Nely Almanza Ortega:
Shortest-length and coarsest-granularity constructs vs. reducts: An experimental evaluation. Int. J. Approx. Reason. 170: 109187 (2024) - 2022
- [j13]Guillermo Sánchez-Díaz
A review of algorithms to computing irreducible testors applied to feature selection. Artif. Intell. Rev. 55(8): 6607-6628 (2022) - 2020
- [j12]Iván Piza-Dávila, Guillermo Sánchez-Díaz
An Algorithm for Computing Minimum-Length Irreducible Testors. IEEE Access 8: 56312-56320 (2020)
2010 – 2019
- 2018
- [j11]Iván Piza-Dávila, Guillermo Sánchez-Díaz
Enhancing the Performance of YYC Algorithm Useful to Generate Irreducible Testors. Int. J. Pattern Recognit. Artif. Intell. 32(1): 1860001:1-1860001:18 (2018) - 2017
- [j10]Iván Piza-Dávila, Guillermo Sánchez-Díaz
A CUDA-based hill-climbing algorithm to find irreducible testors from a training matrix. Pattern Recognit. Lett. 95: 22-28 (2017) - 2016
- [j9]Manuel S. Lazo-Cortés
A new algorithm for computing reducts based on the binary discernibility matrix. Intell. Data Anal. 20(2): 317-337 (2016) - 2015
- [j8]Iván Piza-Dávila, Guillermo Sánchez-Díaz
A parallel hill-climbing algorithm to generate a subset of irreducible testors. Appl. Intell. 42(4): 622-641 (2015) - [j7]Manuel Sabino Lazo-Cortés
On the relation between rough set reducts and typical testors. Inf. Sci. 294: 152-163 (2015) - [c16]Manuel Sabino Lazo-Cortés
Computing Constructs by Using Typical Testor Algorithms. MCPR 2015: 44-53 - 2014
- [j6]Guillermo Sánchez-Díaz
An evolutionary algorithm with acceleration operator to generate a subset of typical testors. Pattern Recognit. Lett. 41: 34-42 (2014) - [c15]Manuel Sabino Lazo-Cortés
Are Reducts and Typical Testors the Same? CIARP 2014: 294-301 - 2013
- [j5]Anilu Franco-Arcega, Jesús Ariel Carrasco-Ochoa, Guillermo Sánchez-Díaz, José Francisco Martínez Trinidad:
Clasificadores basados en arboles de decisión para grandes conjuntos de datos. Computación y Sistemas 17(1) (2013) - [j4]Alexsey Lias-Rodríguez, Guillermo Sánchez-Díaz
An Algorithm for Computing Typical Testors Based on Elimination of Gaps and Reduction of columns. Int. J. Pattern Recognit. Artif. Intell. 27(8) (2013) - [c14]Manuel Lazo-Cortés
Easy Categorization of Attributes in Decision Tables Based on Basic Binary Discernibility Matrix. CIARP (1) 2013: 302-310 - 2012
- [j3]Anilu Franco-Arcega
Building fast decision trees from large training sets. Intell. Data Anal. 16(4): 649-664 (2012) - [j2]Guillermo Sánchez-Díaz
A Fast Implementation for the Typical Testor Property Identification Based on an Accumulative Binary Tuple. Int. J. Comput. Intell. Syst. 5(6): 1025-1039 (2012) - [c13]Guillermo Sánchez-Díaz
Parallel k-Most Similar Neighbor Classifier for Mixed Data. IDEAL 2012: 586-593 - 2011
- [j1]Anilu Franco-Arcega
Decision tree induction using a fast splitting attribute selection for large datasets. Expert Syst. Appl. 38(11): 14290-14300 (2011) - [c12]German Diaz-Sanchez, Iván Piza-Dávila, Guillermo Sánchez-Díaz
Typical Testors Generation Based on an Evolutionary Algorithm. IDEAL 2011: 58-65 - 2010
- [c11]Anilu Franco-Arcega
Multivariate Decision Trees Using Different Splitting Attribute Subsets for Large Datasets. Canadian AI 2010: 370-373 - [c10]Miguel Mora-González
Radon Transform Algorithm for Fingerprint Core Point Detection. MCPR 2010: 134-143 - [c9]Guillermo Sánchez-Díaz
A Fast Implementation of the CT_EXT Algorithm for the Testor Property Identification. MICAI (2) 2010: 92-103
2000 – 2009
- 2008
- [c8]Anilu Franco-Arcega, Jesús Ariel Carrasco-Ochoa, Guillermo Sánchez-Díaz
A New Incremental Algorithm for Induction of Multivariate Decision Trees for Large Datasets. IDEAL 2008: 282-289 - 2007
- [c7]Luis Roberto Morales-Manilla, Guillermo Sánchez-Díaz
FS-EX Plus: A New Algorithm for the Calculation of Typical FS-Testor Set. CIARP 2007: 380-386 - [c6]Guillermo Sánchez-Díaz, Manuel Lazo-Cortés
CT-EXT: An Algorithm for Computing Typical Testor Set. CIARP 2007: 506-514 - 2005
- [c5]Aurora Pons-Porrata, Guillermo Sánchez-Díaz, Manuel S. Lazo-Cortés, Leydis Alfonso Ramírez:
An Incremental Clustering Algorithm Based on Compact Sets with Radius alpha. CIARP 2005: 518-527 - 2004
- [c4]Luis Roberto Morales-Manilla, Guillermo Sánchez-Díaz
An Image Resizing Algorithm for Binary Maps. ENC 2004: 126-132 - 2003
- [c3]Guillermo Sánchez-Díaz
Determination of Similarity Threshold in Clustering Problems for Large Data Sets. CIARP 2003: 611-618 - 2001
- [c2]Guillermo Sánchez-Díaz, José Ruiz-Shulcloper:
A Clustering Method for Very Large Mixed Data Sets. ICDM 2001: 643-644 - [c1]José Francisco Martínez Trinidad, Guillermo Sánchez-Díaz
LC: A Conceptual Clustering Algorithm. MLDM 2001: 117-127
Coauthor Index
aka: José Ariel Carrasco-Ochoa
aka: José Francisco Martínez Trinidad
aka: Hugo Iván Piza Dávila
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: