ReP USP - Resultado da busca

Trabalho de evento
A fast dendrogram refinement approach for unsupervised expansion of hierarchies (2012)
Marcacini, Ricardo Marcondes ; Cherman, Everton A; Metz, Jean; Rezende, Solange Oliveira
Source: Proceedings. Conference titles: European Conference on Machine Learning - ECML. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARCACINI, Ricardo Marcondes et al. A fast dendrogram refinement approach for unsupervised expansion of hierarchies. 2012, Anais.. Bristol: University of Bristol, 2012. . Acesso em: 16 nov. 2025.
APA
Marcacini, R. M., Cherman, E. A., Metz, J., & Rezende, S. O. (2012). A fast dendrogram refinement approach for unsupervised expansion of hierarchies. In Proceedings. Bristol: University of Bristol.
NLM
Marcacini RM, Cherman EA, Metz J, Rezende SO. A fast dendrogram refinement approach for unsupervised expansion of hierarchies. Proceedings. 2012 ;[citado 2025 nov. 16 ]
Vancouver
Marcacini RM, Cherman EA, Metz J, Rezende SO. A fast dendrogram refinement approach for unsupervised expansion of hierarchies. Proceedings. 2012 ;[citado 2025 nov. 16 ]
Trabalho de evento
An adaptive graph-based K-nearest neighbor (2011)
Murrugarra-Llerena, Nils; Lopes, Alneu de Andrade
Source: Proceedings. Conference titles: European Conference on Machine Learning - ECML. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MURRUGARRA-LLERENA, Nils e LOPES, Alneu de Andrade. An adaptive graph-based K-nearest neighbor. 2011, Anais.. Índia: Indian Institute of Technology Madras, 2011. Disponível em: http://www.cse.iitm.ac.in/CoLISD/Papers/5.pdf. Acesso em: 16 nov. 2025.
APA
Murrugarra-Llerena, N., & Lopes, A. de A. (2011). An adaptive graph-based K-nearest neighbor. In Proceedings. Índia: Indian Institute of Technology Madras. Recuperado de http://www.cse.iitm.ac.in/CoLISD/Papers/5.pdf
NLM
Murrugarra-Llerena N, Lopes A de A. An adaptive graph-based K-nearest neighbor [Internet]. Proceedings. 2011 ;[citado 2025 nov. 16 ] Available from: http://www.cse.iitm.ac.in/CoLISD/Papers/5.pdf
Vancouver
Murrugarra-Llerena N, Lopes A de A. An adaptive graph-based K-nearest neighbor [Internet]. Proceedings. 2011 ;[citado 2025 nov. 16 ] Available from: http://www.cse.iitm.ac.in/CoLISD/Papers/5.pdf
Trabalho de evento
A graph-based bagging (2011)
Murrugarra-Llerena, Nils; Lopes, Alneu de Andrade
Source: Proceedings. Conference titles: European Conference on Machine Learning - ECML. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MURRUGARRA-LLERENA, Nils e LOPES, Alneu de Andrade. A graph-based bagging. 2011, Anais.. Índia: Indian Institute of Technology Madras, 2011. Disponível em: http://www.cse.iitm.ac.in/CoLISD/Papers/4.pdf. Acesso em: 16 nov. 2025.
APA
Murrugarra-Llerena, N., & Lopes, A. de A. (2011). A graph-based bagging. In Proceedings. Índia: Indian Institute of Technology Madras. Recuperado de http://www.cse.iitm.ac.in/CoLISD/Papers/4.pdf
NLM
Murrugarra-Llerena N, Lopes A de A. A graph-based bagging [Internet]. Proceedings. 2011 ;[citado 2025 nov. 16 ] Available from: http://www.cse.iitm.ac.in/CoLISD/Papers/4.pdf
Vancouver
Murrugarra-Llerena N, Lopes A de A. A graph-based bagging [Internet]. Proceedings. 2011 ;[citado 2025 nov. 16 ] Available from: http://www.cse.iitm.ac.in/CoLISD/Papers/4.pdf

USP Schools

ReP

Filtros

Authors