869 resultados para height partition clustering


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Pós-graduação em Agronomia (Horticultura) - FCA

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Issues related to association mining have received attention, especially the ones aiming to discover and facilitate the search for interesting patterns. A promising approach, in this context, is the application of clustering in the pre-processing step. In this paper, eleven metrics are proposed to provide an assessment procedure in order to support the evaluation of this kind of approach. To propose the metrics, a subjective evaluation was done. The metrics are important since they provide criteria to: (a) analyze the methodologies, (b) identify their positive and negative aspects, (c) carry out comparisons among them and, therefore, (d) help the users to select the most suitable solution for their problems. Besides, the metrics do the users think about aspects related to the problems and provide a flexible way to solve them. Some experiments were done in order to present how the metrics can be used and their usefulness.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In a recent paper, the partition function (character) of ten-dimensional pure spinor worldsheet variables was calculated explicitly up to the fifth mass-level. In this letter, we propose a novel application of Padé approximants as a tool for computing the character of pure spinors. We get results up to the twelfth mass-level. This work is a first step towards an explicit construction of the complete pure spinor partition function.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Peak flow rate data (Qmax) are important for diagnosis of lower urinary tract obstruction. However, the lack of uroflowmetry studies in children, makes their interpretation difficult. With this aim, we studied 167 boys classified in four groups according to their age (G1: n = 48, 6-7 years; G2: n = 43, 8-9 years; G3: n = 37, 10-11 years; G4: n = 39, 12-14 years). We studied in all children, weight, height, body surface area, peak flow rate (Qmax) and the correspondant urinary volume (Vol). Means and standard deviations of Qmax (ml/sec) were: 15 +/- 5 (G1), 15 +/- 5 (G2), 17 +/- 5 (G3) and 22 +/- 7 (G4) respectively. Corresponding urinary volumes (Vol) (mean standard deviation-in ml) were: G1 = 123 +/- 75; G2 = 122 +/- 79; G3 = 158 +/- 96 and G4 = 162 +/- 101. We found a significant correlation (p < 0,01) between Qmax and Vol in groups G2, G3 and G4; and between Qmax and height in groups G1 and G4. The authors demonstrated a positive correlation between maximum flow and voided volume, and an increase of Qmax with age.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we deal with the problem of boosting the Optimum-Path Forest (OPF) clustering approach using evolutionary-based optimization techniques. As the OPF classifier performs an exhaustive search to find out the size of sample's neighborhood that allows it to reach the minimum graph cut as a quality measure, we compared several optimization techniques that can obtain close graph cut values to the ones obtained by brute force. Experiments in two public datasets in the context of unsupervised network intrusion detection have showed the evolutionary optimization techniques can find suitable values for the neighborhood faster than the exhaustive search. Additionally, we have showed that it is not necessary to employ many agents for such task, since the neighborhood size is defined by discrete values, with constrain the set of possible solution to a few ones.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Pós-graduação em Física - IFT

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The exponential growth of the Internet, coupled with the increasing popularity of dynamically generated content on the World Wide Web, has created the need for more and faster Web servers capable of serving the over 100 million Internet users. Server clustering has emerged as a promising technique to build scalable Web servers. In this article we examine the seminal work, early products, and a sample of contemporary commercial offerings in the field of transparent Web server clustering. We broadly classify transparent server clustering into three categories.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Heterogeneous waveband switching (HeteroWBS) in WDM networks reduces the network operational costs. We propose an autonomous clustering-based HeteroWBS architecture to support the design of efficient HeteroWBS algorithms under dynamic traffic requests in such a network.