Academic literature on the topic 'Modèle à blocs stochastique'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Modèle à blocs stochastique.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Modèle à blocs stochastique"
Juillard, Michel. "Régimes de croissance pour les Etats-Unis, 1890-1991." Revue économique 46, no. 3 (May 1, 1995): 847–56. http://dx.doi.org/10.3917/reco.p1995.46n3.0847.
Full textYéo, Yardjouma. "Modèle épidémiologie stochastique dans un population structurée en âge." International Journal of Scientific Research and Management 8, `10 (October 12, 2020): 187–289. http://dx.doi.org/10.18535/ijsrm/v8i10.m01.
Full textKIRMAN, Alan. "Organisation et communication dans les marchés." Économie appliquée 38, no. 3 (1985): 597–609. http://dx.doi.org/10.3406/ecoap.1985.4054.
Full textEl-Jabi, N., G. Le-Kourdahi, and D. Caissie. "Modélisation stochastique de la température de l'eau en rivière." Revue des sciences de l'eau 8, no. 1 (April 12, 2005): 77–95. http://dx.doi.org/10.7202/705214ar.
Full textPhaneuf, Louis. "Approche d’équilibre général stochastique du cycle économique : problèmes et réalisations." L'Actualité économique 62, no. 1 (January 27, 2009): 110–46. http://dx.doi.org/10.7202/601362ar.
Full textMalouin, Mario. "Organisations autonomes décentralisées et enjeux de gouvernance : le cas de The DAO." Revue Organisations & territoires 32, no. 2 (September 21, 2023): 60–72. http://dx.doi.org/10.1522/revueot.v32n2.1600.
Full textIthurbide, Philippe. "Le marché de l’or et les bulles rationnelles." Articles 63, no. 4 (January 27, 2009): 331–56. http://dx.doi.org/10.7202/601426ar.
Full textBoussidi, Brahim, Ronan Fablet, Emmanuelle Autret, and Bertrand Chapron. "Accroissement stochastique de la résolution spatiale des traceurs géophysiques de l'océan: application aux observations satellitaires de la température de surface de l'océan." Revue Française de Photogrammétrie et de Télédétection, no. 202 (April 16, 2014): 66–78. http://dx.doi.org/10.52638/rfpt.2013.52.
Full textDetemple, Jérôme B., and Richard E. Kihlstrom. "Acquisition d’information dans un modèle intertemporel en temps continu." L'Actualité économique 63, no. 2-3 (January 27, 2009): 118–37. http://dx.doi.org/10.7202/601413ar.
Full textArnaud, P., J. Lavabre, and J. M. Masson. "Amélioration des performances d'un modèle stochastique de génération de hyétogrammes horaires: application au pourtour méditerranéen français." Revue des sciences de l'eau 12, no. 2 (April 12, 2005): 251–71. http://dx.doi.org/10.7202/705351ar.
Full textDissertations / Theses on the topic "Modèle à blocs stochastique"
De, santiago Kylliann. "From stratification to prediction : multimodal machine learning with latent block models and mixtures of experts." Electronic Thesis or Diss., université Paris-Saclay, 2025. http://www.theses.fr/2025UPASM001.
Full textThis thesis explores the application of multimodal machine learning techniques for the analysis of medical data, with a focus on patient stratification and the prediction of hearing recovery after acute sound trauma. The study relies on heterogeneous data (audiological, genomic, and proteomic) collected at various time points following the trauma. The main objective is to extract relevant features by combining these multimodal data, thus enabling a more accurate analysis of individual patient behavior and global trends. First, the challenges of multimodal learning and the specificities of data fusion are addressed. Next, a late fusion model based on stochastic block models is developed. This model allows the characterization of redundancy and complementarity of the available information by (i) grouping the different sources into components, and (ii) maintaining a global stratification of individuals, thereby defining communities. Moreover, the use of a Bayesian approach enables the implementation of a model selection method. Finally, an intermediate fusion model is proposed, extending the Mixture of Experts framework by incorporating conditional latent block modeling of the inputs. The objective is to reduce algorithmic complexity by summarizing variables into components while preserving interpretability and ensuring good predictive performance
Tabouy, Timothée. "Impact de l’échantillonnage sur l’inférence de structures dans les réseaux : application aux réseaux d’échanges de graines et à l’écologie." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS289/document.
Full textIn this thesis we are interested in studying the stochastic block model (SBM) in the presence of missing data. We propose a classification of missing data into two categories Missing At Random and Not Missing At Random for latent variable models according to the model described by D. Rubin. In addition, we have focused on describing several network sampling strategies and their distributions. The inference of SBMs with missing data is made through an adaptation of the EM algorithm : the EM with variational approximation. The identifiability of several of the SBM models with missing data has been demonstrated as well as the consistency and asymptotic normality of the maximum likelihood estimators and variational approximation estimators in the case where each dyad (pair of nodes) is sampled independently and with equal probability. We also looked at SBMs with covariates, their inference in the presence of missing data and how to proceed when covariates are not available to conduct the inference. Finally, all our methods were implemented in an R package available on the CRAN. A complete documentation on the use of this package has been written in addition
Brault, Vincent. "Estimation et sélection de modèle pour le modèle des blocs latents." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112238/document.
Full textClassification aims at sharing data sets in homogeneous subsets; the observations in a class are more similar than the observations of other classes. The problem is compounded when the statistician wants to obtain a cross classification on the individuals and the variables. The latent block model uses a law for each crossing object class and class variables, and observations are assumed to be independent conditionally on the choice of these classes. However, factorizing the joint distribution of the labels is impossible, obstructing the calculation of the log-likelihood and the using of the EM algorithm. Several methods and criteria exist to find these partitions, some frequentist ones, some bayesian ones, some stochastic ones... In this thesis, we first proposed sufficient conditions to obtain the identifiability of the model. In a second step, we studied two proposed algorithms to counteract the problem of the EM algorithm: the VEM algorithm (Govaert and Nadif (2008)) and the SEM-Gibbs algorithm (Keribin, Celeux and Govaert (2010)). In particular, we analyzed the combination of both and highlighted why the algorithms degenerate (term used to say that it returns empty classes). By choosing priors wise, we then proposed a Bayesian adaptation to limit this phenomenon. In particular, we used a Gibbs sampler and we proposed a stopping criterion based on the statistics of Brooks-Gelman (1998). We also proposed an adaptation of the Largest Gaps algorithm (Channarond et al. (2012)). By taking their demonstrations, we have shown that the labels and parameters estimators obtained are consistent when the number of rows and columns tend to infinity. Furthermore, we proposed a method to select the number of classes in row and column, the estimation provided is also consistent when the number of row and column is very large. To estimate the number of classes, we studied the ICL criterion (Integrated Completed Likelihood) whose we proposed an exact shape. After studying the asymptotic approximation, we proposed a BIC criterion (Bayesian Information Criterion) and we conjecture that the two criteria select the same results and these estimates are consistent; conjecture supported by theoretical and empirical results. Finally, we compared the different combinations and proposed a methodology for co-clustering
El, Haj Abir. "Stochastics blockmodels, classifications and applications." Thesis, Poitiers, 2019. http://www.theses.fr/2019POIT2300.
Full textThis PhD thesis focuses on the analysis of weighted networks, where each edge is associated to a weight representing its strength. We introduce an extension of the binary stochastic block model (SBM), called binomial stochastic block model (bSBM). This question is motivated by the study of co-citation networks in a context of text mining where data is represented by a graph. Nodes are words and each edge joining two words is weighted by the number of documents included in the corpus simultaneously citing this pair of words. We develop an inference method based on a variational maximization algorithm (VEM) to estimate the parameters of the modelas well as to classify the words of the network. Then, we adopt a method based on maximizing an integrated classification likelihood (ICL) criterion to select the optimal model and the number of clusters. Otherwise, we develop a variational approach to analyze the given network. Then we compare the two approaches. Applications based on real data are adopted to show the effectiveness of the two methods as well as to compare them. Finally, we develop a SBM model with several attributes to deal with node-weighted networks. We motivate this approach by an application that aims at the development of a tool to help the specification of different cognitive treatments performed by the brain during the preparation of the writing
Fallot, Pierre. "Etude d'un modèle stochastique du rayonnement solaire." Grenoble 1, 1992. http://www.theses.fr/1992GRE10146.
Full textLenormand, Maxime. "Initialiser et calibrer un modèle de microsimulation dynamique stochastique : application au modèle SimVillages." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2012. http://tel.archives-ouvertes.fr/tel-00822114.
Full textRochdi, Youssef. "Identification de systèmes non linéaires blocs." Phd thesis, Université de Caen, 2006. http://tel.archives-ouvertes.fr/tel-00261896.
Full textLa dernière partie du mémoire est centrée sur l'identification des systèmes de Wiener, dont l'élément non linéaire n'est pas supposé inversible. A cet effet, nous présentons deux schémas d'identification de type fréquentiel et établissons leur consistance dans les mêmes conditions que précédemment concernant les perturbations. L'exigence d'excitation persistante occupe une place centrale dans cette thèse. Pour procurer cette propriété aux différents schémas d'identifications proposés, il a été fait appel à une famille de signaux d'excitation de type impulsionnelle. Dans ce cadre, un lemme technique est élaboré précisant, pour les systèmes linéaires, le lien entre cette famille de signaux et la propriété d'excitation persistante. L'adaptation de ce lemme au cas des systèmes non linéaires est illustrée dans les différents schémas d'identification.
Le, Gorrec Luce. "Équilibrage bi-stochastique des matrices pour la détection de structures par blocs et applications." Thesis, Toulouse 3, 2019. http://www.theses.fr/2019TOU30136.
Full textThe detection of block structures in matrices is an important challenge. First in data analysis where matrices are a key tool for data representation, as data tables or adjacency matrices. Indeed, for the first one, finding a co-clustering is equivalent to finding a row and column block structure of the matrix. For the second one, finding a structure of diagonal dominant blocks leads to a clustering of the data. Moreover, block structure detection is also usefull for the resolution of linear systems. For instance, it helps to create efficient Block Jacobi precoditioners or to find groups of rows that are strongly decorrelated in order to apply a solver such as Block Cimmino. In this dissertation, we focus our analysis on the detection of dominant diagonal block structures by symmetrically permuting the rows and columns of matrices. Lots of algorithms have been designed that aim to highlight such structures. Among them, spectral algorithms play a key role. They can be divided into two kinds. The first one consists of algorithms that first project the matrix rows onto a low-dimensional space generated by the matrix leading eigenvectors, and then apply a procedure such as a k-means on the reduced data. Their main drawbacks is that the knowledge of number of clusters to uncover is required. The second kind consists of iterative procedures that look for the k-th best partition into two subblocks of the matrix at step k. However, if the matrix structure shows more than two blocks, the best partition into two blocks may be a poor fit to the matrix groundtruth structure. Hence, we propose a spectral algorithm that deals with both issues described above. To that end, we preprocess the matrix with a doubly-stochastic scaling, which leverages the blocks. First we show the benefits of using such a scaling by using it as a preprocessing for the Louvain's algorithm, in order to uncover community structures in networks. We also investigate several global modularity measures designed for quantifying the consistency of a block structure. We generalise them to make them able to handle doubly-stochastic matrices, and thus we remark that our scaling tends to unify these measures. Then, we describe our algorithm that is based on spectral elements of the scaled matrix. Our method is built on the principle that leading singular vectors of a doubly-stochastic matrix should have a staircase pattern when their coordinates are sorted in the increasing order, under the condition that the matrix shows a hidden block structure. Tools from signal processing-that have been initially designed to detect jumps in signals-are applied to the sorted vectors in order to detect steps in these vectors, and thus to find the separations between the blocks. However, these tools are not specifically designed to this purpose. Hence procedures that we have implemented to answer the encountered issues are also described. We then propose three applications for the matrices block structure detection. First, community detection in networks, and the design of efficient Block Jacobi type preconditioners for solving linear systems. For these applications, we compare the results of our algorithm with those of algorithms that have been designed on purpose. Finally, we deal with the dialogue act detection in a discorsre, using the STAC database that consists in a chat of online players of " The Settlers of Catan ". To that end we connect classical clustering algorithms with a BiLSTM neural network taht preprocesses the dialogue unities. Finally, we conclude by giving some preliminary remarks about the extension of our method to rectangular matrices
Bonvoisin, Frédéric. "Evaluation de la performance des blocs opératoires : du modèle aux indicateurs." Phd thesis, Université de Valenciennes et du Hainaut-Cambresis, 2011. http://tel.archives-ouvertes.fr/tel-00626150.
Full textZreik, Rawya. "Analyse statistique des réseaux et applications aux sciences humaines." Thesis, Paris 1, 2016. http://www.theses.fr/2016PA01E061/document.
Full textOver the last two decades, network structure analysis has experienced rapid growth with its construction and its intervention in many fields, such as: communication networks, financial transaction networks, gene regulatory networks, disease transmission networks, mobile telephone networks. Social networks are now commonly used to represent the interactions between groups of people; for instance, ourselves, our professional colleagues, our friends and family, are often part of online networks, such as Facebook, Twitter, email. In a network, many factors can exert influence or make analyses easier to understand. Among these, we find two important ones: the time factor, and the network context. The former involves the evolution of connections between nodes over time. The network context can then be characterized by different types of information such as text messages (email, tweets, Facebook, posts, etc.) exchanged between nodes, categorical information on the nodes (age, gender, hobbies, status, etc.), interaction frequencies (e.g., number of emails sent or comments posted), and so on. Taking into consideration these factors can lead to the capture of increasingly complex and hidden information from the data. The aim of this thesis is to define new models for graphs which take into consideration the two factors mentioned above, in order to develop the analysis of network structure and allow extraction of the hidden information from the data. These models aim at clustering the vertices of a network depending on their connection profiles and network structures, which are either static or dynamically evolving. The starting point of this work is the stochastic block model, or SBM. This is a mixture model for graphs which was originally developed in social sciences. It assumes that the vertices of a network are spread over different classes, so that the probability of an edge between two vertices only depends on the classes they belong to
Books on the topic "Modèle à blocs stochastique"
Stoyan, Dietrich. Stochastic geometry and its applications. 2nd ed. Chichester: Wiley, 1995.
Find full textCooper, Robert B. Introduction to queueing theory. 3rd ed. Washington, D.C: CEEPress Books, 1990.
Find full textKendall, Wilfrid S., Joseph Mecke, and Dietrich Stoyan. Stochastic Geometry and Its Applications, 2nd Edition. 2nd ed. Wiley, 1996.
Find full textMecke, Joseph, and Dietrich Stoyan. Stochastische Geometrie. de Gruyter GmbH, Walter, 2022.
Find full textMecke, Joseph, and Dietrich Stoyan. Stochastische Geometrie: Eine Einführung. de Gruyter GmbH, Walter, 2022.
Find full textBook chapters on the topic "Modèle à blocs stochastique"
AUBERT, Julie, Pierre BARBILLON, Sophie DONNET, and Vincent MIELE. "Modèles à blocs latents pour la détection de structures dans les réseaux écologiques." In Approches statistiques pour les variables cachées en écologie, 131–50. ISTE Group, 2022. http://dx.doi.org/10.51926/iste.9047.ch6.
Full textPROVAN, Gregory. "Diagnostic des systèmes stochastiques." In Diagnostic et commande à tolérance de fautes 1, 145–66. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9058.ch4.
Full text"’Europe, c’est vous, protéger cette liberté, ce discrimination? Combien différentes cultures». [...] Allemands, c’est nous, pluralisme, cette diversité, de films français, combien Si vous le permettez, Français, ce sont tous les dont nous sommes si de films allemands sur le je voudrais partager cet peuples et toutes les fiers? marché américain? instant avec tous nos cultures de notre Je rêve moi aussi de la Combien de productions concitoyens d’Europe: continent. C’est nous, à construction d’un édifice européennes sur les quatre cent millions de l’Ouest, ce sont les commun, d’une grande chaînes de télévision lecteurs! autres, à l’Est, ce sont maison européenne. Mais américaines? Où est le Quatre cent millions nos amis hongrois, je voudrais que ses protectionnisme? Aux d’hommes et de femmes tchèques, roumains, fenêtres ne s’ouvrent pas États-Unis, les quotas qui attendent de nous polonais, les Allemands qu’aux vents d’Atlantique, appliqués aux productions non pas de vagues de la RDA. je voudrais qu’elles américaines ne sont pas paroles, mais des actes, La dernière guerre laissent passer le souffle de 50 %, pas de 70 %, des initiatives, la nous avait séparés en du continent européen, mais bien de 100 % sur constitution d’une deux blocs, aujourd’hui les brises de la les networks! [. . .] grande Europe de la les frontières Méditerranée ou de la Mais ce ne sont pas culture et de la création. commencent à Baltique. . . Cette maison, les Américains qui sont la Ce soir, je rêve d’un s’estomper et l’Europe je voudrais la faire vivre, la source de nos maux. S’ils grand sursaut, oui, d’une de demain se dessine. Je rendre accueillante : exportent si grande insurrection veux croire, de toutes quelques meubles massivement, c’est que contre l’uniformité, mes forces, que ce ne d’Amérique et du Japon – l’Europe audiovisuelle est contre un conformisme sera pas l’Europe triste, il en est de fort beaux – une passoire! La imposé de l’extérieur et l’Europe fade, l’Europe mais aussi des meubles responsabilité n’est pas à qui ne nous ressemble creuse qui en réalité européens, français, Washington ou Los pas. masque l’Europe espagnols, italiens, Angeles, elle est à Paris Ce soir, je voudrais implacable des grandes allemands. . . [. . .] ou à Rome! Et s’il faut retrouver avec vous concentrations Voici donc que nous, nous battre, tous l’esprit de Valmy [2], cet économiques. Si nos Européens, nous élevons ensemble, c’est aussi enthousiasme que le amis de l’Est se libèrent un peu la voix.Voici que contre nous-mêmes. grand Goethe avait si peu à peu du carcan des nous demandons un peu Contre l’indifférence et la bien reconnu, le soir idées mortes, s’ils se de place, un peu d’espace facilité, le laisser-faire et le même de la bataille: «Ici tournent maintenant pour nos productions laisser-aller. et aujourd’hui vers nous, qu’avons-nous audiovisuelles.Voici que Cette préférence commence une nouvelle à leur proposer? N’est-nous évoquons un européenne, nous l’avons époque de l’histoire du ce pas cela, la vrai système préférentiel, le établie pour l’agriculture monde. . .» question? respect de certaines et l’industrie. En quoi est-Les mois qui Allons-nous leur dire : proportions raisonnables ce sacrilège de l’instituer viennent sont aussi «Bienvenue au pays de la pour les œuvres d’origine aussi pour la Culture? décisifs pour notre jungle! Bienvenue au européenne. Mais quelle Comme M. François avenir que le fut en pays de la rentabilité outrecuidance! Quelle Mitterrand l’a rappelé il y septembre 1792 la immédiate! Bienvenue audace! a quelques jours à bataille de Valmy pour au pays du conformisme, Los Angeles crie à la Bologne: «L’Europe n’est l’idéal républicain. Le du modèle unique!»? discrimination, au coup de pas qu’un marché, s’il est champ de bataille? Ne risquons-nous pas force, à l’injustice, au un ciment à l’Europe c’est L’Europe toute entière? de les décevoir scandale! Los Angeles bien cet espace L’enjeu? L’Europe toute cruellement? Ne faut-il menace! Los Angeles intellectuel et artistique entière! pas dès à présent attaque! où cohabitent et prendre les moyens de Mais où est la dialoguent nos." In Francotheque: A resource for French studies, 137–39. Routledge, 2014. http://dx.doi.org/10.4324/978020378416-23.
Full text