Hollow-tree: a metric access method for data with missing values (2019)
- Authors:
- USP affiliated authors: TRAINA JUNIOR, CAETANO - ICMC ; TRAINA, AGMA JUCI MACHADO - ICMC ; BRINIS, SAFIA - ICMC
- Unidade: ICMC
- DOI: 10.1007/s10844-019-00567-8
- Subjects: RECUPERAÇÃO DA INFORMAÇÃO; BANCO DE DADOS RELACIONAIS; RECONHECIMENTO DE PADRÕES
- Keywords: Missing values; Missing at random; Similarity search; Fractal dimension
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of Intelligent Information Systems
- ISSN: 0925-9902
- Volume/Número/Paginação/Ano: v. 53, n. 3, p. 481-508, Dec. 2019
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
BRINIS, Safia e TRAINA JUNIOR, Caetano e TRAINA, Agma Juci Machado. Hollow-tree: a metric access method for data with missing values. Journal of Intelligent Information Systems, v. 53, n. 3, p. 481-508, 2019Tradução . . Disponível em: https://doi.org/10.1007/s10844-019-00567-8. Acesso em: 14 fev. 2026. -
APA
Brinis, S., Traina Junior, C., & Traina, A. J. M. (2019). Hollow-tree: a metric access method for data with missing values. Journal of Intelligent Information Systems, 53( 3), 481-508. doi:10.1007/s10844-019-00567-8 -
NLM
Brinis S, Traina Junior C, Traina AJM. Hollow-tree: a metric access method for data with missing values [Internet]. Journal of Intelligent Information Systems. 2019 ; 53( 3): 481-508.[citado 2026 fev. 14 ] Available from: https://doi.org/10.1007/s10844-019-00567-8 -
Vancouver
Brinis S, Traina Junior C, Traina AJM. Hollow-tree: a metric access method for data with missing values [Internet]. Journal of Intelligent Information Systems. 2019 ; 53( 3): 481-508.[citado 2026 fev. 14 ] Available from: https://doi.org/10.1007/s10844-019-00567-8 - Querying on large and complex databases by content: challenges on variety and veracity regarding real applications
- Techniques for indexing large and complex datasets with missing attribute values
- Upgraded SemIndex prototype supporting intelligent database keyword queries through disambiguation, query as you type, and parallel search algorithms
- Content-based image retrieval using approximate shape of objects
- Distance functions association for content-based image retrieval using multiple comparison criteria
- DBM-tree
- An effective cost model for similarity queries in metric spaces
- Visually interacting with k-medoid-based algorithms
- BREATH: heat maps assisting the detection of abnormal lung regions in CT Scans
- Support to content-based image query in object-oriented databases
Informações sobre o DOI: 10.1007/s10844-019-00567-8 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
