Academic literature on the topic 'Latent Blocks Models'
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 'Latent Blocks Models.'
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 "Latent Blocks Models"
Moron-Lopez, Sara, Sushama Telwatte, Indra Sarabia, Emilie Battivelli, Mauricio Montano, Amanda B. Macedo, Dvir Aran, et al. "Human splice factors contribute to latent HIV infection in primary cell models and blood CD4+ T cells from ART-treated individuals." PLOS Pathogens 16, no. 11 (November 30, 2020): e1009060. http://dx.doi.org/10.1371/journal.ppat.1009060.
Full textSANTOS, Naiara Caroline Aparecido dos, and Jorge Luiz BAZÁN. "RESIDUAL ANALYSIS IN RASCH POISSON COUNTS MODELS." REVISTA BRASILEIRA DE BIOMETRIA 39, no. 1 (March 31, 2021): 206–20. http://dx.doi.org/10.28951/rbb.v39i1.531.
Full textNorget, Julia, and Axel Mayer. "Block-Wise Model Fit for Structural Equation Models With Experience Sampling Data." Zeitschrift für Psychologie 230, no. 1 (January 2022): 47–59. http://dx.doi.org/10.1027/2151-2604/a000482.
Full textVidal, E., A. Moreno, E. Bertolini, and M. Cambra. "Estimation of the accuracy of two diagnostic methods for the detection of Plum pox virus in nursery blocks by latent class models." Plant Pathology 61, no. 2 (July 13, 2011): 413–22. http://dx.doi.org/10.1111/j.1365-3059.2011.02505.x.
Full textMessick, Troy E., Garry R. Smith, Samantha S. Soldan, Mark E. McDonnell, Julianna S. Deakyne, Kimberly A. Malecka, Lois Tolvinski, et al. "Structure-based design of small-molecule inhibitors of EBNA1 DNA binding blocks Epstein-Barr virus latent infection and tumor growth." Science Translational Medicine 11, no. 482 (March 6, 2019): eaau5612. http://dx.doi.org/10.1126/scitranslmed.aau5612.
Full textCisneros, William J., Shimaa H. A. Soliman, Miriam Walter, Lacy M. Simons, Daphne Cornish, Simone De Fabritiis, Ariel W. Halle, et al. "Release of P-TEFb from the Super Elongation Complex promotes HIV-1 latency reversal." PLOS Pathogens 20, no. 9 (September 11, 2024): e1012083. http://dx.doi.org/10.1371/journal.ppat.1012083.
Full textMa, Suqiang, Chun Liu, Zheng Li, and Wei Yang. "Integrating Adversarial Generative Network with Variational Autoencoders towards Cross-Modal Alignment for Zero-Shot Remote Sensing Image Scene Classification." Remote Sensing 14, no. 18 (September 11, 2022): 4533. http://dx.doi.org/10.3390/rs14184533.
Full textDemir, Rezan, Lewis B. Haberly, and Meyer B. Jackson. "Characteristics of Plateau Activity During the Latent Period Prior to Epileptiform Discharges in Slices From Rat Piriform Cortex." Journal of Neurophysiology 83, no. 2 (February 1, 2000): 1088–98. http://dx.doi.org/10.1152/jn.2000.83.2.1088.
Full textBessac, Julie, Pierre Ailliot, Julien Cattiaux, and Valerie Monbet. "Comparison of hidden and observed regime-switching autoregressive models for (u, v)-components of wind fields in the northeastern Atlantic." Advances in Statistical Climatology, Meteorology and Oceanography 2, no. 1 (February 29, 2016): 1–16. http://dx.doi.org/10.5194/ascmo-2-1-2016.
Full textLai, Zhi-Fei, Gang Zhang, Xiao-Bo Zhang, and Hong-Tao Liu. "High-Resolution Histopathological Image Classification Model Based on Fused Heterogeneous Networks with Self-Supervised Feature Representation." BioMed Research International 2022 (August 21, 2022): 1–10. http://dx.doi.org/10.1155/2022/8007713.
Full textDissertations / Theses on the topic "Latent Blocks Models"
Robert, Valérie. "Classification croisée pour l'analyse de bases de données de grandes dimensions de pharmacovigilance." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLS111/document.
Full textThis thesis gathers methodological contributions to the statistical analysis of large datasets in pharmacovigilance. The pharmacovigilance datasets produce sparse and large matrices and these two characteritics are the main statistical challenges for modelling them. The first part of the thesis is dedicated to the coclustering of the pharmacovigilance contingency table thanks to the normalized Poisson latent block model. The objective is on the one hand, to provide pharmacologists with some interesting and reduced areas to explore more precisely. On the other hand, this coclustering remains a useful background information for dealing with individual database. Within this framework, a parameter estimation procedure for this model is detailed and objective model selection criteria are developed to choose the best fit model. Datasets are so large that we propose a procedure to explore the model space in coclustering, in a non exhaustive way but a relevant one. Additionnally, to assess the performances of the methods, a convenient coclustering index is developed to compare partitions with high numbers of clusters. The developments of these statistical tools are not specific to pharmacovigilance and can be used for any coclustering issue. The second part of the thesis is devoted to the statistical analysis of the large individual data, which are more numerous but also provides even more valuable information. The aim is to produce individual clusters according their drug profiles and subgroups of drugs and adverse effects with possible links, which overcomes the coprescription and masking phenomenons, common contingency table issues in pharmacovigilance. Moreover, the interaction between several adverse effects is taken into account. For this purpose, we propose a new model, the multiple latent block model which enables to cocluster two binary tables by imposing the same row ranking. Assertions inherent to the model are discussed and sufficient identifiability conditions for the model are presented. Then a parameter estimation algorithm is studied and objective model selection criteria are developed. Moreover, a numeric simulation model of the individual data is proposed to compare existing methods and study its limits. Finally, the proposed methodology to deal with individual pharmacovigilance data is presented and applied to a sample of the French pharmacovigilance database between 2002 and 2010
Anakok, Emre. "Prise en compte des effets d'échantillonnage pour la détection de structure des réseaux écologiques." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASM049.
Full textIn this thesis, we focus on the biases that sampling can cause on the estimation of statistical models and metrics describing ecological interaction networks. First, we propose to combine an observation model that accounts for sampling with a stochastic block model representing the structure of possible interactions. The identifiability of the model is demonstrated and an algorithm is proposed to estimate its parameters. Its relevance and its practical interest are attested on a large dataset of plant-pollinator networks, as we observe structural change on most of the networks. We then examine a large dataset sampled by a citizen science program. Using recent advances in artificial intelligence, we propose a method to reconstruct the ecological network free from sampling effects caused by the varying levels of experience among observers. Finally, we present methods to highlight variables of ecological interest that influence the network's connectivity and show that accounting for sampling effects partially alters the estimation of these effects. Our methods, implemented in either R or Python, are freely accessible
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
Tami, Myriam. "Approche EM pour modèles multi-blocs à facteurs à une équation structurelle." Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT303/document.
Full textStructural equation models enable the modeling of interactions between observed variables and latent ones. The two leading estimation methods are partial least squares on components and covariance-structure analysis. In this work, we first describe the PLS and LISREL methods and, then, we propose an estimation method using the EM algorithm in order to maximize the likelihood of a structural equation model with latent factors. Through a simulation study, we investigate how fast and accurate the method is, and thanks to an application to real environmental data, we show how one can handly construct a model or evaluate its quality. Finally, in the context of oncology, we apply the EM approach on health-related quality-of-life data. We show that it simplifies the longitudinal analysis of quality-of-life and helps evaluating the clinical benefit of a treatment
Febrissy, Mickaël. "Nonnegative Matrix Factorization and Probabilistic Models : A unified framework for text data." Electronic Thesis or Diss., Paris, CNAM, 2021. http://www.theses.fr/2021CNAM1291.
Full textSince the exponential growth of available Data (Big data), dimensional reduction techniques became essential for the exploration and analysis of high-dimensional data arising from many scientific areas. By creating a low-dimensional space intrinsic to the original data space, theses techniques offer better understandings across many data Science applications. In the context of text analysis where the data gathered are mainly nonnegative, recognized techniques producing transformations in the space of real numbers (e.g. Principal component analysis, Latent semantic analysis) became less intuitive as they could not provide a straightforward interpretation. Such applications show the need of dimensional reduction techniques like Nonnegative Matrix factorization (NMF) useful to embed, for instance, documents or words in the space of reduced dimension. By definition, NMF aims at approximating a nonnegative matrix by the product of two lower dimensionalnonnegative matrices, which results in the solving of a nonlinear optimization problem. Note however that this objective can be harnessed to document/word clustering domain even it is not the objective of NMF. In relying on NMF, this thesis focuses on improving clustering of large text data arising in the form of highly sparse document-term matrices. This objective is first achieved, by proposing several types of regularizations of the original NMF objective function. Setting this objective in a probabilistic context, a new NMF model is introduced bringing theoretical foundations for establishing the connection between NMF and Finite Mixture Models of exponential families leading, therefore, to offer interesting regularizations. This allows to set NMF in a real clustering spirit. Finally, a Bayesian Poisson Latent Block model is proposed to improve document andword clustering simultaneously by capturing noisy term features. This can be connected to NMTF (Nonnegative Matrix factorization Tri-factorization) devoted to co-clustering. Experiments on real datasets have been carried out to support the proposals of the thesis
Corneli, Marco. "Dynamic stochastic block models, clustering and segmentation in dynamic graphs." Thesis, Paris 1, 2017. http://www.theses.fr/2017PA01E012/document.
Full textThis thesis focuses on the statistical analysis of dynamic graphs, both defined in discrete or continuous time. We introduce a new extension of the stochastic block model (SBM) for dynamic graphs. The proposed approach, called dSBM, adopts non homogeneous Poisson processes to model the interaction times between pairs of nodes in dynamic graphs, either in discrete or continuous time. The intensity functions of the processes only depend on the node clusters, in a block modelling perspective. Moreover, all the intensity functions share some regularity properties on hidden time intervals that need to be estimated. A recent estimation algorithm for SBM, based on the greedy maximization of an exact criterion (exact ICL) is adopted for inference and model selection in dSBM. Moreover, an exact algorithm for change point detection in time series, the "pruned exact linear time" (PELT) method is extended to deal with dynamic graph data modelled via dSBM. The approach we propose can be used for change point analysis in graph data. Finally, a further extension of dSBM is developed to analyse dynamic net- works with textual edges (like social networks, for instance). In this context, the graph edges are associated with documents exchanged between the corresponding vertices. The textual content of the documents can provide additional information about the dynamic graph topological structure. The new model we propose is called "dynamic stochastic topic block model" (dSTBM).Graphs are mathematical structures very suitable to model interactions between objects or actors of interest. Several real networks such as communication networks, financial transaction networks, mobile telephone networks and social networks (Facebook, Linkedin, etc.) can be modelled via graphs. When observing a network, the time variable comes into play in two different ways: we can study the time dates at which the interactions occur and/or the interaction time spans. This thesis only focuses on the first time dimension and each interaction is assumed to be instantaneous, for simplicity. Hence, the network evolution is given by the interaction time dates only. In this framework, graphs can be used in two different ways to model networks. Discrete time […] Continuous time […]. In this thesis both these perspectives are adopted, alternatively. We consider new unsupervised methods to cluster the vertices of a graph into groups of homogeneous connection profiles. In this manuscript, the node groups are assumed to be time invariant to avoid possible identifiability issues. Moreover, the approaches that we propose aim to detect structural changes in the way the node clusters interact with each other. The building block of this thesis is the stochastic block model (SBM), a probabilistic approach initially used in social sciences. The standard SBM assumes that the nodes of a graph belong to hidden (disjoint) clusters and that the probability of observing an edge between two nodes only depends on their clusters. Since no further assumption is made on the connection probabilities, SBM is a very flexible model able to detect different network topologies (hubs, stars, communities, etc.)
Schmutz, Amandine. "Contributions à l'analyse de données fonctionnelles multivariées, application à l'étude de la locomotion du cheval de sport." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1241.
Full textWith the growth of smart devices market to provide athletes and trainers a systematic, objective and reliable follow-up, more and more parameters are monitored for a same individual. An alternative to laboratory evaluation methods is the use of inertial sensors which allow following the performance without hindering it, without space limits and without tedious initialization procedures. Data collected by those sensors can be classified as multivariate functional data: some quantitative entities evolving along time and collected simultaneously for a same individual. The aim of this thesis is to find parameters for analysing the athlete horse locomotion thanks to a sensor put in the saddle. This connected device (inertial sensor, IMU) for equestrian sports allows the collection of acceleration and angular velocity along time in the three space directions and with a sampling frequency of 100 Hz. The database used for model development is made of 3221 canter strides from 58 ridden jumping horses of different age and level of competition. Two different protocols are used to collect data: one for straight path and one for curved path. We restricted our work to the prediction of three parameters: the speed per stride, the stride length and the jump quality. To meet the first to objectives, we developed a multivariate functional clustering method that allow the division of the database into smaller more homogeneous sub-groups from the collected signals point of view. This method allows the characterization of each group by it average profile, which ease the data understanding and interpretation. But surprisingly, this clustering model did not improve the results of speed prediction, Support Vector Machine (SVM) is the model with the lowest percentage of error above 0.6 m/s. The same applied for the stride length where an accuracy of 20 cm is reached thanks to SVM model. Those results can be explained by the fact that our database is build from 58 horses only, which is a quite low number of individuals for a clustering method. Then we extend this method to the co-clustering of multivariate functional data in order to ease the datamining of horses’ follow-up databases. This method might allow the detection and prevention of locomotor disturbances, main source of interruption of jumping horses. Lastly, we looked for correlation between jumping quality and signals collected by the IMU. First results show that signals collected by the saddle alone are not sufficient to differentiate finely the jumping quality. Additional information will be needed, for example using complementary sensors or by expanding the database to have a more diverse range of horses and jump profiles
Laclau, Charlotte. "Hard and fuzzy block clustering algorithms for high dimensional data." Thesis, Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCB014.
Full textWith the increasing number of data available, unsupervised learning has become an important tool used to discover underlying patterns without the need to label instances manually. Among different approaches proposed to tackle this problem, clustering is arguably the most popular one. Clustering is usually based on the assumption that each group, also called cluster, is distributed around a center defined in terms of all features while in some real-world applications dealing with high-dimensional data, this assumption may be false. To this end, co-clustering algorithms were proposed to describe clusters by subsets of features that are the most relevant to them. The obtained latent structure of data is composed of blocks usually called co-clusters. In first two chapters, we describe two co-clustering methods that proceed by differentiating the relevance of features calculated with respect to their capability of revealing the latent structure of the data in both probabilistic and distance-based framework. The probabilistic approach uses the mixture model framework where the irrelevant features are assumed to have a different probability distribution that is independent of the co-clustering structure. On the other hand, the distance-based (also called metric-based) approach relied on the adaptive metric where each variable is assigned with its weight that defines its contribution in the resulting co-clustering. From the theoretical point of view, we show the global convergence of the proposed algorithms using Zangwill convergence theorem. In the last two chapters, we consider a special case of co-clustering where contrary to the original setting, each subset of instances is described by a unique subset of features resulting in a diagonal structure of the initial data matrix. Same as for the two first contributions, we consider both probabilistic and metric-based approaches. The main idea of the proposed contributions is to impose two different kinds of constraints: (1) we fix the number of row clusters to the number of column clusters; (2) we seek a structure of the original data matrix that has the maximum values on its diagonal (for instance for binary data, we look for diagonal blocks composed of ones with zeros outside the main diagonal). The proposed approaches enjoy the convergence guarantees derived from the results of the previous chapters. Finally, we present both hard and fuzzy versions of the proposed algorithms. We evaluate our contributions on a wide variety of synthetic and real-world benchmark binary and continuous data sets related to text mining applications and analyze advantages and inconvenients of each approach. To conclude, we believe that this thesis covers explicitly a vast majority of possible scenarios arising in hard and fuzzy co-clustering and can be seen as a generalization of some popular biclustering approaches
Laclau, Charlotte. "Hard and fuzzy block clustering algorithms for high dimensional data." Electronic Thesis or Diss., Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCB014.
Full textWith the increasing number of data available, unsupervised learning has become an important tool used to discover underlying patterns without the need to label instances manually. Among different approaches proposed to tackle this problem, clustering is arguably the most popular one. Clustering is usually based on the assumption that each group, also called cluster, is distributed around a center defined in terms of all features while in some real-world applications dealing with high-dimensional data, this assumption may be false. To this end, co-clustering algorithms were proposed to describe clusters by subsets of features that are the most relevant to them. The obtained latent structure of data is composed of blocks usually called co-clusters. In first two chapters, we describe two co-clustering methods that proceed by differentiating the relevance of features calculated with respect to their capability of revealing the latent structure of the data in both probabilistic and distance-based framework. The probabilistic approach uses the mixture model framework where the irrelevant features are assumed to have a different probability distribution that is independent of the co-clustering structure. On the other hand, the distance-based (also called metric-based) approach relied on the adaptive metric where each variable is assigned with its weight that defines its contribution in the resulting co-clustering. From the theoretical point of view, we show the global convergence of the proposed algorithms using Zangwill convergence theorem. In the last two chapters, we consider a special case of co-clustering where contrary to the original setting, each subset of instances is described by a unique subset of features resulting in a diagonal structure of the initial data matrix. Same as for the two first contributions, we consider both probabilistic and metric-based approaches. The main idea of the proposed contributions is to impose two different kinds of constraints: (1) we fix the number of row clusters to the number of column clusters; (2) we seek a structure of the original data matrix that has the maximum values on its diagonal (for instance for binary data, we look for diagonal blocks composed of ones with zeros outside the main diagonal). The proposed approaches enjoy the convergence guarantees derived from the results of the previous chapters. Finally, we present both hard and fuzzy versions of the proposed algorithms. We evaluate our contributions on a wide variety of synthetic and real-world benchmark binary and continuous data sets related to text mining applications and analyze advantages and inconvenients of each approach. To conclude, we believe that this thesis covers explicitly a vast majority of possible scenarios arising in hard and fuzzy co-clustering and can be seen as a generalization of some popular biclustering approaches
Galindo-Prieto, Beatriz. "Novel variable influence on projection (VIP) methods in OPLS, O2PLS, and OnPLS models for single- and multi-block variable selection : VIPOPLS, VIPO2PLS, and MB-VIOP methods." Doctoral thesis, Umeå universitet, Kemiska institutionen, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-130579.
Full textBooks on the topic "Latent Blocks Models"
Fedorov, Viktor, and Mihail San'kov. Management: theory and practice. ru: INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1859086.
Full textKuz'mina, Natal'ya. Criminology and crime prevention. ru: INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1900600.
Full textSkrypnik, Oleg. Radio navigation and landing systems. ru: INFRA-M Academic Publishing LLC., 2024. http://dx.doi.org/10.12737/1874250.
Full textPalomäki, Outi, and Petri Volmanen. Alternative neural blocks for labour analgesia. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780198713333.003.0018.
Full textSucci, Sauro. Lattice Boltzmann Models without Underlying Boolean Microdynamics. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199592357.003.0013.
Full textTibaldi, Stefano, and Franco Molteni. Atmospheric Blocking in Observation and Models. Oxford University Press, 2018. http://dx.doi.org/10.1093/acrefore/9780190228620.013.611.
Full textPierce, Helen. Graphic Satire and the Printed Image in Shakespeare’s London. Edited by Malcolm Smuts. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199660841.013.40.
Full textAnderson, Elisabeth. Agents of Reform. Princeton University Press, 2021. http://dx.doi.org/10.23943/princeton/9780691220895.001.0001.
Full textVeech, Richard L., and M. Todd King. Alzheimer’s Disease. Edited by Detlev Boison. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780190497996.003.0026.
Full textMiller, Kenneth P. Texas vs. California. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190077365.001.0001.
Full textBook chapters on the topic "Latent Blocks Models"
Boutalbi, Rafika, Lazhar Labiod, and Mohamed Nadif. "Latent Block Regression Model." In Studies in Classification, Data Analysis, and Knowledge Organization, 73–81. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-09034-9_9.
Full textKuckertz, Andreas, Thomas Leicht, Maximilian Scheu, Indra da Silva Wagner, and Bernd Ebersberger. "Architecture of the Venture: Understanding Business Modeling." In Mastering Your Entrepreneurial Journey, 63–73. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-71064-3_6.
Full textSalinas Ruíz, Josafhat, Osval Antonio Montesinos López, Gabriela Hernández Ramírez, and Jose Crossa Hiriart. "Generalized Linear Mixed Models for Repeated Measurements." In Generalized Linear Mixed Models with Applications in Agriculture and Biology, 377–423. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-32800-8_9.
Full textOsborne, Martin J., and Ariel Rubinstein. "Choice." In Models in Microeconomic Theory, 17–30. 2nd ed. Cambridge, UK: Open Book Publishers, 2023. http://dx.doi.org/10.11647/obp.0362.02.
Full textOsborne, Martin J., and Ariel Rubinstein. "Choice." In Models in Microeconomic Theory, 17–30. 2nd ed. Cambridge, UK: Open Book Publishers, 2023. http://dx.doi.org/10.11647/obp.0361.02.
Full textKhoufache, Reda, Anisse Belhadj, Hanene Azzag, and Mustapha Lebbah. "Distributed MCMC Inference for Bayesian Non-parametric Latent Block Model." In Advances in Knowledge Discovery and Data Mining, 271–83. Singapore: Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-2242-6_22.
Full textGuarino, Stefano, Enrico Mastrostefano, and Davide Torre. "The Hyperbolic Geometric Block Model and Networks with Latent and Explicit Geometries." In Complex Networks and Their Applications XI, 109–21. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21131-7_9.
Full textMarchello, Giulia, Marco Corneli, and Charles Bouveyron. "A Deep Dynamic Latent Block Model for the Co-Clustering of Zero-Inflated Data Matrices." In Machine Learning and Knowledge Discovery in Databases: Research Track, 695–710. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43412-9_41.
Full textHan, Sapphire Yu, and Cees H. Elzinga. "Modeling the Genesis of Life Courses." In Social Background and the Demographic Life Course: Cross-National Comparisons, 125–40. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67345-1_7.
Full textKirilenko, Andrei, and Svetlana Stepchenkova. "Automated Topic Analysis with Large Language Models." In Information and Communication Technologies in Tourism 2024, 29–34. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-58839-6_3.
Full textConference papers on the topic "Latent Blocks Models"
Zhuang, Junling, Guanhong Li, Hang Xu, Jintu Xu, and Runjia Tian. "Text-to-City: Controllable 3D Urban Block Generation With Latent Diffusion Model." In CAADRIA 2024: Accelerated Design, 169–78. CAADRIA, 2024. http://dx.doi.org/10.52842/conf.caadria.2024.2.169.
Full textWang, Liwei, Suraj Yerramilli, Akshay Iyer, Daniel Apley, Ping Zhu, and Wei Chen. "Data-Driven Design via Scalable Gaussian Processes for Multi-Response Big Data With Qualitative Factors." In ASME 2021 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/detc2021-71570.
Full textFogat, Mrigya, Samiran Roy, Viviane Ferreira, and Satyan Singh. "A Comparative Analysis of Convolutional Neural Networks for Seismic Noise Attenuation." In SPE EuropEC - Europe Energy Conference featured at the 84th EAGE Annual Conference & Exhibition. SPE, 2023. http://dx.doi.org/10.2118/214392-ms.
Full textZhu, Feida, Junwei Zhu, Wenqing Chu, Ying Tai, Zhifeng Xie, Xiaoming Huang, and Chengjie Wang. "HifiHead: One-Shot High Fidelity Neural Head Synthesis with 3D Control." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/244.
Full textCao, Bingyi, Kenneth A. Ross, Martha A. Kim, and Stephen A. Edwards. "Implementing latency-insensitive dataflow blocks." In 2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE). IEEE, 2015. http://dx.doi.org/10.1109/memcod.2015.7340485.
Full textda Rosa, Augusto Seben, Frederico Santos de Oliveira, Anderson da Silva Soares, and Arnaldo Candido Junior. "Yin Yang Convolutional Nets: Image Manifold Extraction by the Analysis of Opposites." In Congresso Latino-Americano de Software Livre e Tecnologias Abertas, 341–47. Sociedade Brasileira de Computação - SBC, 2024. https://doi.org/10.5753/latinoware.2024.245312.
Full textAilem, Melissa, Francois Role, and Mohamed Nadif. "Sparse Poisson Latent Block Model for Document Clustering (Extended Abstract)." In 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, 2018. http://dx.doi.org/10.1109/icde.2018.00229.
Full textDoersch, Stefan, Maria Starnberg, and Haike Brick. "Acoustic Certification of New Composite Brake Blocks." In EuroBrake 2021. FISITA, 2021. http://dx.doi.org/10.46720/1766833eb2021-stp-022.
Full textWang, Yujin, DeZhong Wang, Junlian Yin, and Yaoyu Hu. "The Use of Experimental Design for the Shrink-Fit Assembly of Multi-Ring Flywheel." In 2014 22nd International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/icone22-30359.
Full textLomet, Aurore, Gerard Govaert, and Yves Grandvalet. "An Approximation of the Integrated Classification Likelihood for the Latent Block Model." In 2012 IEEE 12th International Conference on Data Mining Workshops. IEEE, 2012. http://dx.doi.org/10.1109/icdmw.2012.32.
Full textReports on the topic "Latent Blocks Models"
Zagorevski, A., and C. R. van Staal. Cordilleran magmatism in Yukon and northern British Columbia: characteristics, temporal variations, and significance for the tectonic evolution of the northern Cordillera. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/326063.
Full textSentcоv, Valentin, Andrei Reutov, and Vyacheslav Kuzmin. Electronic training manual "Acute poisoning with alcohols and alcohol-containing liquids". SIB-Expertise, January 2024. http://dx.doi.org/10.12731/er0778.29012024.
Full textKnudsen, Tyler R. Interim Geologic Map of the Parowan Quadrangle, Iron County, Utah. Utah Geological Survey, June 2024. http://dx.doi.org/10.34191/ofr-764.
Full textTao, Yang, Amos Mizrach, Victor Alchanatis, Nachshon Shamir, and Tom Porter. Automated imaging broiler chicksexing for gender-specific and efficient production. United States Department of Agriculture, December 2014. http://dx.doi.org/10.32747/2014.7594391.bard.
Full textKaracic, Almir, and Anneli Adler. Fertilization of poplar plantations with dried sludge : a demonstration trial in Hillebola - central Sweden. Department of Crop Production Ecology, Swedish University of Agricultural Sciences, 2023. http://dx.doi.org/10.54612/a.2q9iahfphk.
Full textChejanovsky, Nor, and Suzanne M. Thiem. Isolation of Baculoviruses with Expanded Spectrum of Action against Lepidopteran Pests. United States Department of Agriculture, December 2002. http://dx.doi.org/10.32747/2002.7586457.bard.
Full textJohnson, Derek, and Nigel Clark. PR-746-22204-R01 Review of Technologies to Enable In-situ Valve Service to Reduce Methane Emissions. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), March 2024. http://dx.doi.org/10.55274/r0000058.
Full textMeir, Shimon, Michael Reid, Cai-Zhong Jiang, Amnon Lers, and Sonia Philosoph-Hadas. Molecular Studies of Postharvest Leaf and Flower Abscission. United States Department of Agriculture, 2005. http://dx.doi.org/10.32747/2005.7696523.bard.
Full textHarris, L. B., P. Adiban, and E. Gloaguen. The role of enigmatic deep crustal and upper mantle structures on Au and magmatic Ni-Cu-PGE-Cr mineralization in the Superior Province. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/328984.
Full textPerl-Treves, Rafael, Rebecca Grumet, Nurit Katzir, and Jack E. Staub. Ethylene Mediated Regulation of Sex Expression in Cucumis. United States Department of Agriculture, January 2005. http://dx.doi.org/10.32747/2005.7586536.bard.
Full text