Buscar
Mostrando ítems 11-20 de 8175
Generalized external indexes for comparing data partitions with overlapping categories
(ELSEVIER SCIENCE BV, 2010)
There is a family of well-known external clustering validity indexes to measure the degree of compatibility or similarity between two hard partitions of a given data set, including partitions with different numbers of ...
Random partition models with regression on covariates
(ELSEVIER SCIENCE BV, 2010)
Many recent applications of nonparametric Bayesian inference use random partition models, i.e. probability models for clustering a set of experimental units. We review the popular basic constructions. We then focus on an ...
Combinatorial interpretations as two-line array for the mock theta functions
(SpringerNew YorkEUA, 2013)
The effect of trail length on task partitioning in three Acromyrmex species (Hymenoptera: Formicidae)
(2003-05-19)
By comparing the behavior of three Acromyrmex (Hymenoptera, Formicidae) species during foraging on artificial trails of different lengths, we observed the occurrence of task partitioning and its relation to the food distance ...
Convergence of the approximate cores to the aspiration core in partitioning games
(Springer, 2015-07)
The approximate core and the aspiration core are two non-empty solutions for cooperative games that have emerged in order to give an answer to cooperative games with an empty core. Although the approximate core and the ...
New Two-Line Arrays Representing Partitions
(Birkhauser Verlag AgBaselSuíça, 2011)
Analytic partition function for plasmasAnalytic partition function for plasmas
(Revista Mexicana de Física, 2009)
Hyperbolic Geometrically Uniform Codes and Ungerboeck Partitioning on the Double Torus
(2022-03-01)
Current research builds labelings for geometrically uniform codes on the double torus through tiling groups. At least one labeling group was provided for all of the 11 regular tessellations on the double torus, derived ...
Clique partitioning with value-monotone submodular cost
(Elsevier, 2015)
We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. ...