


default search action
Adán José García
- > Home > Persons > Adán José García
Publications
- 2024
- [j10]Adán José García
, Julie Jacques
, Vincent Sobanski
, Clarisse Dhaenens
:
Metaheuristic Biclustering Algorithms: From State-of-the-art to Future Opportunities. ACM Comput. Surv. 56(3): 69:1-69:38 (2024) - [c12]Adán José García, Julie Jacques, Clément Chauvet
, Vincent Sobanski, Clarisse Dhaenens:
HBIC: A Biclustering Algorithm for Heterogeneous Datasets. ECAI 2024: 3088-3095 - [i2]Adán José García, Julie Jacques, Clément Chauvet, Vincent Sobanski, Clarisse Dhaenens:
HBIC: A Biclustering Algorithm for Heterogeneous Datasets. CoRR abs/2408.13217 (2024) - 2023
- [j8]Adán José García
, Julia Handl
:
What's in a distance? Exploring the interplay between distance measures and internal cluster validity in multi-objective clustering. Nat. Comput. 22(2): 259-270 (2023) - [j7]Adán José García
, Wilfrido Gómez-Flores
:
CVIK: A Matlab-based cluster validity index toolbox for automatic data clustering. SoftwareX 22: 101359 (2023) - [j6]Mario Garza-Fabre
, Julia Handl
, Adán José García
:
Evolutionary Multiobjective Clustering Over Multiple Conflicting Data Views. IEEE Trans. Evol. Comput. 27(4): 817-831 (2023) - 2022
- [c11]Adán José García
, Julie Jacques, Alexandre Filiot, Julia Handl
, David Launay
, Vincent Sobanski
, Clarisse Dhaenens:
Multi-view Clustering of Heterogeneous Health Data: Application to Systemic Sclerosis. PPSN (2) 2022: 352-367 - [i1]Adán José García, Julie Jacques, Vincent Sobanski, Clarisse Dhaenens:
Biclustering Algorithms Based on Metaheuristics: A Review. CoRR abs/2203.16241 (2022) - 2021
- [j5]Adán José García
, Julia Handl
, Wilfrido Gómez-Flores
, Mario Garza-Fabre
:
An evolutionary many-objective approach to multiview clustering using feature and relational data. Appl. Soft Comput. 108: 107425 (2021) - [c10]Adán José García
, Julia Handl
:
On the Interaction Between Distance Functions and Clustering Criteria in Multi-objective Clustering. EMO 2021: 504-515 - [c9]Adán José García
, Wilfrido Gómez-Flores:
A survey of cluster validity indices for automatic data clustering using differential evolution. GECCO 2021: 314-322 - 2019
- [c8]Adán José García
, Julia Handl
, Wilfrido Gómez-Flores
, Mario Garza-Fabre
:
Many-view clustering: an illustration using multiple dissimilarity measures. GECCO (Companion) 2019: 213-214 - 2017
- [c7]Adán José García
, Wilfrido Gómez-Flores
:
Evolutionary Clustering Using Multi-prototype Representation and Connectivity Criterion. MCPR 2017: 63-73 - 2016
- [j2]Adán José García
, Wilfrido Gómez-Flores
:
Automatic clustering using nature-inspired metaheuristics: A survey. Appl. Soft Comput. 41: 192-213 (2016) - 2011
- [c5]Adán José García
, Hillel Romero-Monsivais, Cindy G. Hernandez-Morales, Arturo Rodríguez-Cristerna, Ivan Rivera-Islas, José Torres-Jiménez
:
A Simulated Annealing Algorithm for the Problem of Minimal Addition Chains. EPIA 2011: 311-325 - [c4]Arturo Rodríguez-Cristerna, José Torres-Jiménez
, Ivan Rivera-Islas, Cindy G. Hernandez-Morales, Hillel Romero-Monsivais, Adán José García
:
A Mutation-Selection Algorithm for the Problem of Minimum Brauer Chains. MICAI (2) 2011: 107-118

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.
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.
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.
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 2025-03-20 01:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
