An adaptive graph-based K-nearest neighbor (2011)
- Autores:
- Autor USP: LOPES, ALNEU DE ANDRADE - ICMC
- Unidade: ICMC
- Assunto: INTELIGÊNCIA ARTIFICIAL
- Idioma: Inglês
- Imprenta:
- Editora: Indian Institute of Technology Madras
- Local: Índia
- Data de publicação: 2011
- Fonte:
- Título do periódico: Proceedings
- Nome do evento: European Conference on Machine Learning - ECML
-
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: 24 abr. 2024. -
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 2024 abr. 24 ] 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 2024 abr. 24 ] Available from: http://www.cse.iitm.ac.in/CoLISD/Papers/5.pdf - Efficient identification of duplicate bibliographical references
- Information extraction from tagged bibliographical references
- A graph-based bagging
- An open source tool for crowd-sourcing the manual annotation of texts
- Link prediction in graph construction for supervised and semi-supervised learning
- Exploring data classification with k-associated network
- Bipartite graph for topic extraction
- Structural link prediction using community information on Twitter
- Graph-based cross-validated committees ensembles
- Data visualization and relevance feedback applied to information retrieval
Como citar
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
