deterministic clustering
[/dɪˌtɜːrmɪˈnɪstɪk ˈklʌstərɪŋ/]
noun
agrupamento determinístico
1. A clustering algorithm that produces the same partition of data every time it is run with the same input, without any randomness or probabilistic elements in the assignment process
K-means is a deterministic clustering algorithm that converges to a consistent solution when initialized with the same parameters.
K-means é um algoritmo de agrupamento determinístico que converge para uma solução consistente quando inicializado com os mesmos parâmetros.
2. A data partitioning method where cluster membership is strictly defined by explicit rules or mathematical functions, contrasting with probabilistic clustering approaches
Hierarchical agglomerative clustering is a deterministic clustering approach that always produces the same dendrogram for a given dataset.
O agrupamento hierárquico aglomerativo é uma abordagem de agrupamento determinístico que sempre produz o mesmo dendrograma para um conjunto de dados dado.
This is a specialized technical term primarily used in computer science, data science, and machine learning fields. It is equally recognized in both Brazilian and North American academic contexts, with minimal regional variation. The term is typically used in its English form even in Portuguese-speaking technical literature, though Portuguese translations are increasingly common in educational materials.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →