• Aucun résultat trouvé

[PDF] Top 20 Quantization based clustering: an iterative approach

Has 10000 "Quantization based clustering: an iterative approach" found on our website. Below are the top 20 most common "Quantization based clustering: an iterative approach".

Quantization based clustering: an iterative approach

Quantization based clustering: an iterative approach

... Quantization based clustering: an iterative approach Thomas Laloë Abstract In this paper we propose a simple new algorithm to perform clustering, based on the ... Voir le document complet

9

An Iterative Hybrid filter-Wrapper Approach to Feature Selection for Document Clustering

An Iterative Hybrid filter-Wrapper Approach to Feature Selection for Document Clustering

... propose an iterative feature selection scheme, which greed- ily selects the best feature subset from the bag-of-words that best classify the document set in each ...employs an Expectation ... Voir le document complet

13

An iterative multi-atlas patch-based approach for cortex segmentation from neonatal MRI

An iterative multi-atlas patch-based approach for cortex segmentation from neonatal MRI

... constitute an efficient strategy, taking advantage of images processed ...model based on patches; second, an iterative optimization ...proposed approach provides robust cortex ... Voir le document complet

26

RVA-clustering: An Approximation-based Indexing Approach for Multi-dimensional Objects

RVA-clustering: An Approximation-based Indexing Approach for Multi-dimensional Objects

... Unité de recherche INRIA Rocquencourt Domaine de Voluceau - Rocquencourt - BP 105 - 78153 Le Chesnay Cedex France Unité de recherche INRIA Futurs : Domaine de Voluceau - Rocquencourt - B[r] ... Voir le document complet

33

SPAWN: An Iterative, Potentials-Based, Dynamic Scheduling and Partitioning Tool

SPAWN: An Iterative, Potentials-Based, Dynamic Scheduling and Partitioning Tool

... computations of highly variable cost over time can occur. Distributing the un- derlying cells over manycore architectures is a critical load balancing step that should be performed the less frequently possible. Graph ... Voir le document complet

25

SPAWN: An Iterative, Potentials-Based, Dynamic Scheduling and Partitioning Tool

SPAWN: An Iterative, Potentials-Based, Dynamic Scheduling and Partitioning Tool

... We present Spawn, a physical interaction inspired scheduler that produces compact and optimal voronoi domains. In our case, Voronoi diagrams maximize per-core data locality, by providing numerous advantages: cache usage ... Voir le document complet

10

Bayesian calibration using different prior distributions: an iterative maximum a posteriori approach for radio interferometers

Bayesian calibration using different prior distributions: an iterative maximum a posteriori approach for radio interferometers

... Fig. 2 . Evolution of the MSE for a given ionospheric phase delay as a function of the SNR for different kinds of CG dis- tributions. situation for radio astronomy. Let us consider M = 8 anten- nas in a 2-dimensional ... Voir le document complet

6

A spatial regularization approach for vector quantization

A spatial regularization approach for vector quantization

... of quantization levels Q, and the spatial en- tropy of original image f ...with an Ishikawa-like graph, converges in 18 ...graph-cut based methods depends on |V| and on the number of ... Voir le document complet

18

A De Novo Robust Clustering Approach for Amplicon-Based Sequence Data

A De Novo Robust Clustering Approach for Amplicon-Based Sequence Data

... quired. An ambiguous sequence could be arbitrarily assigned to a nearby OTU, become the center of its own OTU or even be considered as an error and deleted but these operations imply such a knowledge of the ... Voir le document complet

10

A closed patterns-based approach to the consensus clustering problem

A closed patterns-based approach to the consensus clustering problem

... best clustering considering different cluster- ing problems, like the existence of noise, variable densities, and non well-separated clusters (very close ...presents an extensive survey of the performance ... Voir le document complet

137

Greedy quantization: new approach and applications to reflected backward SDE

Greedy quantization: new approach and applications to reflected backward SDE

... vector quantization with some finan- cial ...out an extensive numerical study bringing many improvements in the greedy quantization-based numerical integration ...greedy quantization ... Voir le document complet

218

Deconvolution of fMRI Data using a Paradigm Free Iterative Approach based on Partial Differential Equations

Deconvolution of fMRI Data using a Paradigm Free Iterative Approach based on Partial Differential Equations

... 6. Costantini, I., Filipiak, P., Maksymenko, K., Deslauriers-Gauthier, S., & Deriche, R. (2018, July). fMRI Deconvolution via Temporal Regularization using a LASSO model and the LARS algorithm. In 40th International ... Voir le document complet

5

Word sense discrimination in information retrieval: a spectral clustering-based approach

Word sense discrimination in information retrieval: a spectral clustering-based approach

... to an ambiguous ...is based on spectral clustering and reorders an initially retrieved doc- ument list by boosting documents that are semantically similar to the target ... Voir le document complet

17

Inferring Same-as Facts from Linked Data: An Iterative Import-by-Query Approach

Inferring Same-as Facts from Linked Data: An Iterative Import-by-Query Approach

... rule-based approach is that it is generic and declarative: new rules can be added without changing the algorithmic ...rule-based approach to model any kind of data and rules uncertainty as ... Voir le document complet

8

A supervised clustering approach for fMRI-based inference of brain states

A supervised clustering approach for fMRI-based inference of brain states

... that an fMRI brain image has typically 10 4 to 10 5 voxels, it is perfectly reasonable to use inter- mediate structures such as parcels for reducing the dimensionality of the ...is an accurate ... Voir le document complet

14

Template-Based Graph Clustering

Template-Based Graph Clustering

... Graph Clustering. Spectral Graph Clustering [20] is a popular technique for clustering data organized as ...k-means clustering is applied on this embedding. An application of Spectral ... Voir le document complet

16

Optimal Quantization: Limit Theorems, Clustering and Simulation of the McKean-Vlasov Equation

Optimal Quantization: Limit Theorems, Clustering and Simulation of the McKean-Vlasov Equation

... as an inner product or the Jaccard distance according to the features we want to extract from the ...vector quantization is an efficient tool to compute regular and conditional expectations (see ... Voir le document complet

232

Projection-based curve clustering

Projection-based curve clustering

... plus an error ...of clustering with random projections based on the Johnson-Lindenstrauss Lemma, which represent a sound alternative to or- thonormal projections thanks to their distance-preserving ... Voir le document complet

31

Word sense discrimination in information retrieval: a spectral clustering-based approach

Word sense discrimination in information retrieval: a spectral clustering-based approach

... to an ambiguous ...is based on spectral clustering and reorders an initially retrieved doc- ument list by boosting documents that are semantically similar to the target ... Voir le document complet

18

An iterative approach to build relevant ontology-aware data-driven models

An iterative approach to build relevant ontology-aware data-driven models

... generic iterative approach to design ontology-aware and rele- vant data-driven ...is based upon an ontology to model the domain knowledge and a learning method to build the interpretable ... Voir le document complet

37

Show all 10000 documents...