Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Graphical probabilistic models). Showing records 1 – 30 of 76 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


Georgia Tech

1. Shegheva, Snejana. A computational model for solving raven’s progressive matrices intelligence test.

Degree: MS, Computer Science, 2018, Georgia Tech

Graphical models offer techniques for capturing the structure of many problems in real- world domains and provide means for representation, interpretation, and inference. The modeling… (more)

Subjects/Keywords: Probabilistic graphical models; Machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shegheva, S. (2018). A computational model for solving raven’s progressive matrices intelligence test. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60191

Chicago Manual of Style (16th Edition):

Shegheva, Snejana. “A computational model for solving raven’s progressive matrices intelligence test.” 2018. Masters Thesis, Georgia Tech. Accessed December 11, 2019. http://hdl.handle.net/1853/60191.

MLA Handbook (7th Edition):

Shegheva, Snejana. “A computational model for solving raven’s progressive matrices intelligence test.” 2018. Web. 11 Dec 2019.

Vancouver:

Shegheva S. A computational model for solving raven’s progressive matrices intelligence test. [Internet] [Masters thesis]. Georgia Tech; 2018. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1853/60191.

Council of Science Editors:

Shegheva S. A computational model for solving raven’s progressive matrices intelligence test. [Masters Thesis]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60191


University of New Mexico

2. Oyen, Diane. Interactive Exploration of Multitask Dependency Networks.

Degree: Department of Computer Science, 2013, University of New Mexico

 Scientists increasingly depend on machine learning algorithms to discover patterns in complex data. Two examples addressed in this dissertation are identifying how information sharing among… (more)

Subjects/Keywords: machine learning; probabilistic graphical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Oyen, D. (2013). Interactive Exploration of Multitask Dependency Networks. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/23359

Chicago Manual of Style (16th Edition):

Oyen, Diane. “Interactive Exploration of Multitask Dependency Networks.” 2013. Doctoral Dissertation, University of New Mexico. Accessed December 11, 2019. http://hdl.handle.net/1928/23359.

MLA Handbook (7th Edition):

Oyen, Diane. “Interactive Exploration of Multitask Dependency Networks.” 2013. Web. 11 Dec 2019.

Vancouver:

Oyen D. Interactive Exploration of Multitask Dependency Networks. [Internet] [Doctoral dissertation]. University of New Mexico; 2013. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1928/23359.

Council of Science Editors:

Oyen D. Interactive Exploration of Multitask Dependency Networks. [Doctoral Dissertation]. University of New Mexico; 2013. Available from: http://hdl.handle.net/1928/23359


Australian National University

3. Mohasel Afshar, Hadi. Probabilistic Inference in Piecewise Graphical Models .

Degree: 2016, Australian National University

 In many applications of probabilistic inference the models contain piecewise densities that are differentiable except at partition boundaries. For instance, (1) some models may intrinsically… (more)

Subjects/Keywords: Piecewise; Graphical models; probabilistic inference; MCMC; sampling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mohasel Afshar, H. (2016). Probabilistic Inference in Piecewise Graphical Models . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/107386

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mohasel Afshar, Hadi. “Probabilistic Inference in Piecewise Graphical Models .” 2016. Thesis, Australian National University. Accessed December 11, 2019. http://hdl.handle.net/1885/107386.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mohasel Afshar, Hadi. “Probabilistic Inference in Piecewise Graphical Models .” 2016. Web. 11 Dec 2019.

Vancouver:

Mohasel Afshar H. Probabilistic Inference in Piecewise Graphical Models . [Internet] [Thesis]. Australian National University; 2016. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1885/107386.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mohasel Afshar H. Probabilistic Inference in Piecewise Graphical Models . [Thesis]. Australian National University; 2016. Available from: http://hdl.handle.net/1885/107386

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Guelph

4. Alshememry, Abdulrahman. Privacy Sensitive Environment Decomposition for Hypertree Agent Organization Construction .

Degree: 2018, University of Guelph

 Cooperative multiagent systems form an active area of research and practice in AI and software engineering. Decentralized probabilistic reasoning, constraint reasoning, and decision-theoretic reasoning are… (more)

Subjects/Keywords: Artificial Intelligence; Multi-agent systems; Probabilistic Reasoning; Probabilistic Graphical Models; Graphical Models; Junction Tree; Agent Organization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Alshememry, A. (2018). Privacy Sensitive Environment Decomposition for Hypertree Agent Organization Construction . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14119

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Alshememry, Abdulrahman. “Privacy Sensitive Environment Decomposition for Hypertree Agent Organization Construction .” 2018. Thesis, University of Guelph. Accessed December 11, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14119.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Alshememry, Abdulrahman. “Privacy Sensitive Environment Decomposition for Hypertree Agent Organization Construction .” 2018. Web. 11 Dec 2019.

Vancouver:

Alshememry A. Privacy Sensitive Environment Decomposition for Hypertree Agent Organization Construction . [Internet] [Thesis]. University of Guelph; 2018. [cited 2019 Dec 11]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14119.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Alshememry A. Privacy Sensitive Environment Decomposition for Hypertree Agent Organization Construction . [Thesis]. University of Guelph; 2018. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14119

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – Berkeley

5. Wang, Zhe. Extracting and Querying Probabilistic Information in BayesStore.

Degree: Electrical Engineering & Computer Sciences, 2011, University of California – Berkeley

 During the past few years, the number of applications that need to process large-scale data has grown remarkably. The data driving these applications are often… (more)

Subjects/Keywords: Computer science; Conditional Random Fields; Database; Probabilistic Database; Probabilistic Graphical Models; Query-driven; Text Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, Z. (2011). Extracting and Querying Probabilistic Information in BayesStore. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/3557w390

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wang, Zhe. “Extracting and Querying Probabilistic Information in BayesStore.” 2011. Thesis, University of California – Berkeley. Accessed December 11, 2019. http://www.escholarship.org/uc/item/3557w390.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Zhe. “Extracting and Querying Probabilistic Information in BayesStore.” 2011. Web. 11 Dec 2019.

Vancouver:

Wang Z. Extracting and Querying Probabilistic Information in BayesStore. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2019 Dec 11]. Available from: http://www.escholarship.org/uc/item/3557w390.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang Z. Extracting and Querying Probabilistic Information in BayesStore. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/3557w390

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


RMIT University

6. Queiroz Batista da Silva, C. A holistic approach for measuring the survivability of SCADA systems.

Degree: 2012, RMIT University

 Supervisory Control and Data Acquisition (SCADA) systems are responsible for controlling and monitoring Industrial Control Systems (ICS) and Critical Infrastructure Systems (CIS) among others. Such… (more)

Subjects/Keywords: Fields of Research; SCADA; Survivability; Probabilistic Graphical Models; Security; Performance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Queiroz Batista da Silva, C. (2012). A holistic approach for measuring the survivability of SCADA systems. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:160341

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Queiroz Batista da Silva, C. “A holistic approach for measuring the survivability of SCADA systems.” 2012. Thesis, RMIT University. Accessed December 11, 2019. http://researchbank.rmit.edu.au/view/rmit:160341.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Queiroz Batista da Silva, C. “A holistic approach for measuring the survivability of SCADA systems.” 2012. Web. 11 Dec 2019.

Vancouver:

Queiroz Batista da Silva C. A holistic approach for measuring the survivability of SCADA systems. [Internet] [Thesis]. RMIT University; 2012. [cited 2019 Dec 11]. Available from: http://researchbank.rmit.edu.au/view/rmit:160341.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Queiroz Batista da Silva C. A holistic approach for measuring the survivability of SCADA systems. [Thesis]. RMIT University; 2012. Available from: http://researchbank.rmit.edu.au/view/rmit:160341

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Georgia Tech

7. Zou, Jun. Social computing for personalization and credible information mining using probabilistic graphical models.

Degree: PhD, Electrical and Computer Engineering, 2016, Georgia Tech

 In this dissertation, we address challenging social computing problems in personalized recommender systems and social media information mining. We tap into probabilistic graphical models, including… (more)

Subjects/Keywords: Social computing; Recommender systems; Collaborative filtering; Belief propagation; Probabilistic graphical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zou, J. (2016). Social computing for personalization and credible information mining using probabilistic graphical models. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55646

Chicago Manual of Style (16th Edition):

Zou, Jun. “Social computing for personalization and credible information mining using probabilistic graphical models.” 2016. Doctoral Dissertation, Georgia Tech. Accessed December 11, 2019. http://hdl.handle.net/1853/55646.

MLA Handbook (7th Edition):

Zou, Jun. “Social computing for personalization and credible information mining using probabilistic graphical models.” 2016. Web. 11 Dec 2019.

Vancouver:

Zou J. Social computing for personalization and credible information mining using probabilistic graphical models. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1853/55646.

Council of Science Editors:

Zou J. Social computing for personalization and credible information mining using probabilistic graphical models. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/55646


University of Southern California

8. Ma, Nam. Scalable exact inference in probabilistic graphical models on multi-core platforms.

Degree: PhD, Computer Science, 2014, University of Southern California

 The recent switch to multi‐core computing and the emergence of machine learning applications have offered many opportunities for parallelization. However, achieving scalability with respect to… (more)

Subjects/Keywords: parallel algorithms; probabilistic inference; scalability; graph computations; graphical models; multi‐core

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ma, N. (2014). Scalable exact inference in probabilistic graphical models on multi-core platforms. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/373594/rec/5681

Chicago Manual of Style (16th Edition):

Ma, Nam. “Scalable exact inference in probabilistic graphical models on multi-core platforms.” 2014. Doctoral Dissertation, University of Southern California. Accessed December 11, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/373594/rec/5681.

MLA Handbook (7th Edition):

Ma, Nam. “Scalable exact inference in probabilistic graphical models on multi-core platforms.” 2014. Web. 11 Dec 2019.

Vancouver:

Ma N. Scalable exact inference in probabilistic graphical models on multi-core platforms. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2019 Dec 11]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/373594/rec/5681.

Council of Science Editors:

Ma N. Scalable exact inference in probabilistic graphical models on multi-core platforms. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/373594/rec/5681

9. Ayadi, Inès. Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models.

Degree: Docteur es, Informatique, 2013, Université Paris-Est

 Actuellement, les équipements employés dans les milieux industriels sont de plus en plus complexes. Ils exigent une maintenance accrue afin de garantir un niveau de… (more)

Subjects/Keywords: Modèles graphiques probabilistes; Optimisation; Métaheuristique; Graphical probabilistic models; Optimization; Metaheuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ayadi, I. (2013). Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2013PEST1072

Chicago Manual of Style (16th Edition):

Ayadi, Inès. “Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models.” 2013. Doctoral Dissertation, Université Paris-Est. Accessed December 11, 2019. http://www.theses.fr/2013PEST1072.

MLA Handbook (7th Edition):

Ayadi, Inès. “Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models.” 2013. Web. 11 Dec 2019.

Vancouver:

Ayadi I. Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models. [Internet] [Doctoral dissertation]. Université Paris-Est; 2013. [cited 2019 Dec 11]. Available from: http://www.theses.fr/2013PEST1072.

Council of Science Editors:

Ayadi I. Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models. [Doctoral Dissertation]. Université Paris-Est; 2013. Available from: http://www.theses.fr/2013PEST1072


KTH

10. Hamesse, Charles. Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture.

Degree: RPL, 2018, KTH

Achilles tendonbrott (Achilles Tendon Rupture, ATR) är en av de typiska mjukvävnadsskadorna. Rehabilitering efter sådana muskuloskeletala skador förblir en långvarig process med ett mycket… (more)

Subjects/Keywords: Machine learning; Probabilistic graphical models; Healthcare; Computer Systems; Datorsystem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hamesse, C. (2018). Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231485

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hamesse, Charles. “Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture.” 2018. Thesis, KTH. Accessed December 11, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231485.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hamesse, Charles. “Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture.” 2018. Web. 11 Dec 2019.

Vancouver:

Hamesse C. Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture. [Internet] [Thesis]. KTH; 2018. [cited 2019 Dec 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231485.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hamesse C. Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture. [Thesis]. KTH; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231485

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Toronto

11. Dhoot, Aditya. Wind Farm Layout Optimization Using Approximate Inference in Graphical Models.

Degree: 2016, University of Toronto

Wind farm layout optimization (WFLO) determines the optimal location of wind turbines within a fixed geographical area to maximize the total power capacity of the… (more)

Subjects/Keywords: approximate inference; probabilistic graphical models; wind farm design; 0796

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dhoot, A. (2016). Wind Farm Layout Optimization Using Approximate Inference in Graphical Models. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/72692

Chicago Manual of Style (16th Edition):

Dhoot, Aditya. “Wind Farm Layout Optimization Using Approximate Inference in Graphical Models.” 2016. Masters Thesis, University of Toronto. Accessed December 11, 2019. http://hdl.handle.net/1807/72692.

MLA Handbook (7th Edition):

Dhoot, Aditya. “Wind Farm Layout Optimization Using Approximate Inference in Graphical Models.” 2016. Web. 11 Dec 2019.

Vancouver:

Dhoot A. Wind Farm Layout Optimization Using Approximate Inference in Graphical Models. [Internet] [Masters thesis]. University of Toronto; 2016. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1807/72692.

Council of Science Editors:

Dhoot A. Wind Farm Layout Optimization Using Approximate Inference in Graphical Models. [Masters Thesis]. University of Toronto; 2016. Available from: http://hdl.handle.net/1807/72692


University of Minnesota

12. Wang, Huahua. Large scale optimization for machine learning.

Degree: PhD, Computer Science, 2014, University of Minnesota

 Over the last several decades, tremendous tools have been developed in machine learning, ranging from statistical models to scalable algorithms, from learning strategies to various… (more)

Subjects/Keywords: Data mining; Machine learning; Optimization; Probabilistic graphical models; Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, H. (2014). Large scale optimization for machine learning. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/172052

Chicago Manual of Style (16th Edition):

Wang, Huahua. “Large scale optimization for machine learning.” 2014. Doctoral Dissertation, University of Minnesota. Accessed December 11, 2019. http://hdl.handle.net/11299/172052.

MLA Handbook (7th Edition):

Wang, Huahua. “Large scale optimization for machine learning.” 2014. Web. 11 Dec 2019.

Vancouver:

Wang H. Large scale optimization for machine learning. [Internet] [Doctoral dissertation]. University of Minnesota; 2014. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/11299/172052.

Council of Science Editors:

Wang H. Large scale optimization for machine learning. [Doctoral Dissertation]. University of Minnesota; 2014. Available from: http://hdl.handle.net/11299/172052


University of Illinois – Urbana-Champaign

13. Cao, Phuong. An experiment using factor graph for early attack detection.

Degree: MS, Computer Science, 2015, University of Illinois – Urbana-Champaign

 This paper presents a factor graph based framework (named AttackTagger) for high accuracy and preemptive detection of attacks. We use security logs of real-incidents that… (more)

Subjects/Keywords: probabilistic graphical models; factor graph; security incidents; preemptive intrusion detection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cao, P. (2015). An experiment using factor graph for early attack detection. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78579

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Cao, Phuong. “An experiment using factor graph for early attack detection.” 2015. Thesis, University of Illinois – Urbana-Champaign. Accessed December 11, 2019. http://hdl.handle.net/2142/78579.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Cao, Phuong. “An experiment using factor graph for early attack detection.” 2015. Web. 11 Dec 2019.

Vancouver:

Cao P. An experiment using factor graph for early attack detection. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2142/78579.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cao P. An experiment using factor graph for early attack detection. [Thesis]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78579

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Mauá, Denis Deratani. Algorithms and complexity results for discrete probabilistic reasoning tasks.

Degree: 2013, Università della Svizzera italiana

 Many solutions to problems in machine learning and artificial intelligence involve solving a combinatorial optimization problem over discrete variables whose functional dependence is conveniently represented… (more)

Subjects/Keywords: Probabilistic graphical models

…posteriori inference in discrete probabilistic graphical models (more precisely, in Bayesian… …probabilistic graphical models. These are multivariate models where irrelevance assessments between… …Maximum a posteriori inference 2.1 Graphical models and the MAP assignment problem . . . . 2.2… …optimization problems are the maximum a posteriori inference in discrete probabilistic graphical… …problems we consider involves credal networks, which are graphical models whose numerical… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mauá, D. D. (2013). Algorithms and complexity results for discrete probabilistic reasoning tasks. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/203103

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mauá, Denis Deratani. “Algorithms and complexity results for discrete probabilistic reasoning tasks.” 2013. Thesis, Università della Svizzera italiana. Accessed December 11, 2019. http://doc.rero.ch/record/203103.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mauá, Denis Deratani. “Algorithms and complexity results for discrete probabilistic reasoning tasks.” 2013. Web. 11 Dec 2019.

Vancouver:

Mauá DD. Algorithms and complexity results for discrete probabilistic reasoning tasks. [Internet] [Thesis]. Università della Svizzera italiana; 2013. [cited 2019 Dec 11]. Available from: http://doc.rero.ch/record/203103.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mauá DD. Algorithms and complexity results for discrete probabilistic reasoning tasks. [Thesis]. Università della Svizzera italiana; 2013. Available from: http://doc.rero.ch/record/203103

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Michigan

15. Wang, Boshen. An Empirical Evaluation of Algorithms for Computing Equilibria in Games for Approximate Inference in Large Dimensional Probabilistic Graphical Models.

Degree: MS, Computer and Information Science, College of Engineering & Computer Science, 2017, University of Michigan

 Work in graphical models for game theory typically borrows from results in probabilistic graphical models. In this work, we instead consider the opposite direction. By… (more)

Subjects/Keywords: Probabilistic graphical models; Belief inference; Game theory; Equilibrium computation; Ising models; Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, B. (2017). An Empirical Evaluation of Algorithms for Computing Equilibria in Games for Approximate Inference in Large Dimensional Probabilistic Graphical Models. (Masters Thesis). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/140771

Chicago Manual of Style (16th Edition):

Wang, Boshen. “An Empirical Evaluation of Algorithms for Computing Equilibria in Games for Approximate Inference in Large Dimensional Probabilistic Graphical Models.” 2017. Masters Thesis, University of Michigan. Accessed December 11, 2019. http://hdl.handle.net/2027.42/140771.

MLA Handbook (7th Edition):

Wang, Boshen. “An Empirical Evaluation of Algorithms for Computing Equilibria in Games for Approximate Inference in Large Dimensional Probabilistic Graphical Models.” 2017. Web. 11 Dec 2019.

Vancouver:

Wang B. An Empirical Evaluation of Algorithms for Computing Equilibria in Games for Approximate Inference in Large Dimensional Probabilistic Graphical Models. [Internet] [Masters thesis]. University of Michigan; 2017. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2027.42/140771.

Council of Science Editors:

Wang B. An Empirical Evaluation of Algorithms for Computing Equilibria in Games for Approximate Inference in Large Dimensional Probabilistic Graphical Models. [Masters Thesis]. University of Michigan; 2017. Available from: http://hdl.handle.net/2027.42/140771

16. Villanueva Talavera, Edwin Rafael. Métodos Bayesianos aplicados em taxonomia molecular.

Degree: Mestrado, Processamento de Sinais de Instrumentação, 2007, University of São Paulo

Neste trabalho são apresentados dois métodos de agrupamento de dados visados para aplicações em taxonomia molecular. Estes métodos estão baseados em modelos probabilísticos, o que… (more)

Subjects/Keywords: Agrupamento; Agrupamento hierárquico; Clustering; Hierarchical clustering; Modelos gráficos probabilísticos; Modelos probabilísticos; Molecular taxonomy; Probabilistic graphical models; Probabilistic models; Taxonomia molecular

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Villanueva Talavera, E. R. (2007). Métodos Bayesianos aplicados em taxonomia molecular. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/18/18152/tde-03102007-105125/ ;

Chicago Manual of Style (16th Edition):

Villanueva Talavera, Edwin Rafael. “Métodos Bayesianos aplicados em taxonomia molecular.” 2007. Masters Thesis, University of São Paulo. Accessed December 11, 2019. http://www.teses.usp.br/teses/disponiveis/18/18152/tde-03102007-105125/ ;.

MLA Handbook (7th Edition):

Villanueva Talavera, Edwin Rafael. “Métodos Bayesianos aplicados em taxonomia molecular.” 2007. Web. 11 Dec 2019.

Vancouver:

Villanueva Talavera ER. Métodos Bayesianos aplicados em taxonomia molecular. [Internet] [Masters thesis]. University of São Paulo; 2007. [cited 2019 Dec 11]. Available from: http://www.teses.usp.br/teses/disponiveis/18/18152/tde-03102007-105125/ ;.

Council of Science Editors:

Villanueva Talavera ER. Métodos Bayesianos aplicados em taxonomia molecular. [Masters Thesis]. University of São Paulo; 2007. Available from: http://www.teses.usp.br/teses/disponiveis/18/18152/tde-03102007-105125/ ;


University of Illinois – Urbana-Champaign

17. Choi, Jaesik. Lifted Inference for Relational Hybrid Models.

Degree: PhD, 0112, 2012, University of Illinois – Urbana-Champaign

Probabilistic Graphical Models (PGMs) promise to play a prominent role in many complex real-world systems. Probabilistic Relational Graphical Models (PRGMs) scale the representation and learning… (more)

Subjects/Keywords: Probabilistic Graphical Models; Relational Hybrid Models; Lifted Inference; First-Order Probabilistic Models; Probabilistic Logic; Kalman filter; Relational Kalman filter; Variational Learning, Markov Logic Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Choi, J. (2012). Lifted Inference for Relational Hybrid Models. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/32004

Chicago Manual of Style (16th Edition):

Choi, Jaesik. “Lifted Inference for Relational Hybrid Models.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed December 11, 2019. http://hdl.handle.net/2142/32004.

MLA Handbook (7th Edition):

Choi, Jaesik. “Lifted Inference for Relational Hybrid Models.” 2012. Web. 11 Dec 2019.

Vancouver:

Choi J. Lifted Inference for Relational Hybrid Models. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2142/32004.

Council of Science Editors:

Choi J. Lifted Inference for Relational Hybrid Models. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/32004


Carnegie Mellon University

18. Sun, Feng-Tso. Nonparametric Discovery of Human Behavior Patterns from Multimodal Data.

Degree: 2014, Carnegie Mellon University

 Recent advances in sensor technologies and the growing interest in context- aware applications, such as targeted advertising and location-based services, have led to a demand… (more)

Subjects/Keywords: Activity recognition; machine learning; topic modeling; nonparametric Bayesian; probabilistic graphical models; context-aware systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sun, F. (2014). Nonparametric Discovery of Human Behavior Patterns from Multimodal Data. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/359

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sun, Feng-Tso. “Nonparametric Discovery of Human Behavior Patterns from Multimodal Data.” 2014. Thesis, Carnegie Mellon University. Accessed December 11, 2019. http://repository.cmu.edu/dissertations/359.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sun, Feng-Tso. “Nonparametric Discovery of Human Behavior Patterns from Multimodal Data.” 2014. Web. 11 Dec 2019.

Vancouver:

Sun F. Nonparametric Discovery of Human Behavior Patterns from Multimodal Data. [Internet] [Thesis]. Carnegie Mellon University; 2014. [cited 2019 Dec 11]. Available from: http://repository.cmu.edu/dissertations/359.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sun F. Nonparametric Discovery of Human Behavior Patterns from Multimodal Data. [Thesis]. Carnegie Mellon University; 2014. Available from: http://repository.cmu.edu/dissertations/359

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – Berkeley

19. Chatterjee, Shaunak. Efficient inference algorithms for near-deterministic systems.

Degree: Electrical Engineering & Computer Sciences, 2013, University of California – Berkeley

 This thesis addresses the problem of performing probabilistic inference in stochastic systems where the probability mass is far from uniformly distributed among all possible outcomes.… (more)

Subjects/Keywords: Artificial intelligence; Eigenanalysis; Graphical models; MCMC; Near-deterministic systems; Probabilistic inference; Viterbi

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chatterjee, S. (2013). Efficient inference algorithms for near-deterministic systems. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/0g63029f

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chatterjee, Shaunak. “Efficient inference algorithms for near-deterministic systems.” 2013. Thesis, University of California – Berkeley. Accessed December 11, 2019. http://www.escholarship.org/uc/item/0g63029f.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chatterjee, Shaunak. “Efficient inference algorithms for near-deterministic systems.” 2013. Web. 11 Dec 2019.

Vancouver:

Chatterjee S. Efficient inference algorithms for near-deterministic systems. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2019 Dec 11]. Available from: http://www.escholarship.org/uc/item/0g63029f.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chatterjee S. Efficient inference algorithms for near-deterministic systems. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/0g63029f

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Cambridge

20. Hennig, Philipp. Approximate inference in graphical models.

Degree: PhD, 2011, University of Cambridge

 Probability theory provides a mathematically rigorous yet conceptually flexible calculus of uncertainty, allowing the construction of complex hierarchical models for real-world inference tasks. Unfortunately, exact… (more)

Subjects/Keywords: 519.2; Applied mathematics; Computer science; Probability theory; Probabilistic inference; Graphical models; Approximate inference

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hennig, P. (2011). Approximate inference in graphical models. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/237251 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541854

Chicago Manual of Style (16th Edition):

Hennig, Philipp. “Approximate inference in graphical models.” 2011. Doctoral Dissertation, University of Cambridge. Accessed December 11, 2019. https://www.repository.cam.ac.uk/handle/1810/237251 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541854.

MLA Handbook (7th Edition):

Hennig, Philipp. “Approximate inference in graphical models.” 2011. Web. 11 Dec 2019.

Vancouver:

Hennig P. Approximate inference in graphical models. [Internet] [Doctoral dissertation]. University of Cambridge; 2011. [cited 2019 Dec 11]. Available from: https://www.repository.cam.ac.uk/handle/1810/237251 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541854.

Council of Science Editors:

Hennig P. Approximate inference in graphical models. [Doctoral Dissertation]. University of Cambridge; 2011. Available from: https://www.repository.cam.ac.uk/handle/1810/237251 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541854


University of Cambridge

21. Hennig, Philipp. Approximate inference in graphical models .

Degree: 2011, University of Cambridge

 Probability theory provides a mathematically rigorous yet conceptually flexible calculus of uncertainty, allowing the construction of complex hierarchical models for real-world inference tasks. Unfortunately, exact… (more)

Subjects/Keywords: Applied mathematics; Computer science; Probability theory; Probabilistic inference; Graphical models; Approximate inference

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hennig, P. (2011). Approximate inference in graphical models . (Thesis). University of Cambridge. Retrieved from http://www.dspace.cam.ac.uk/handle/1810/237251

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hennig, Philipp. “Approximate inference in graphical models .” 2011. Thesis, University of Cambridge. Accessed December 11, 2019. http://www.dspace.cam.ac.uk/handle/1810/237251.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hennig, Philipp. “Approximate inference in graphical models .” 2011. Web. 11 Dec 2019.

Vancouver:

Hennig P. Approximate inference in graphical models . [Internet] [Thesis]. University of Cambridge; 2011. [cited 2019 Dec 11]. Available from: http://www.dspace.cam.ac.uk/handle/1810/237251.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hennig P. Approximate inference in graphical models . [Thesis]. University of Cambridge; 2011. Available from: http://www.dspace.cam.ac.uk/handle/1810/237251

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – Santa Cruz

22. Tomkins, Sabina. Probabilistic Methods for Data-Driven Social Good.

Degree: Technology and Information Management, 2018, University of California – Santa Cruz

 Computational techniques have much to offer in addressing questions of societal significance. Many such question can be framed as prediction problems, and approached with data-driven… (more)

Subjects/Keywords: Artificial intelligence; Collective Inference; Education; Malicious Behavior; Probabilistic Graphical Models; Social Networks; Spatio-temporal

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tomkins, S. (2018). Probabilistic Methods for Data-Driven Social Good. (Thesis). University of California – Santa Cruz. Retrieved from http://www.escholarship.org/uc/item/1z70t8vs

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tomkins, Sabina. “Probabilistic Methods for Data-Driven Social Good.” 2018. Thesis, University of California – Santa Cruz. Accessed December 11, 2019. http://www.escholarship.org/uc/item/1z70t8vs.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tomkins, Sabina. “Probabilistic Methods for Data-Driven Social Good.” 2018. Web. 11 Dec 2019.

Vancouver:

Tomkins S. Probabilistic Methods for Data-Driven Social Good. [Internet] [Thesis]. University of California – Santa Cruz; 2018. [cited 2019 Dec 11]. Available from: http://www.escholarship.org/uc/item/1z70t8vs.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tomkins S. Probabilistic Methods for Data-Driven Social Good. [Thesis]. University of California – Santa Cruz; 2018. Available from: http://www.escholarship.org/uc/item/1z70t8vs

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

23. Omar, Farheen. Online Bayesian Learning in Probabilistic Graphical Models using Moment Matching with Applications.

Degree: 2016, University of Waterloo

Probabilistic Graphical Models are often used to e fficiently encode uncertainty in real world problems as probability distributions. Bayesian learning allows us to compute a… (more)

Subjects/Keywords: Machine Learning; Artificial Intelligence; Bayesian Learning; Probabilistic Graphical Models; Topic Modeling; Activity Recognition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Omar, F. (2016). Online Bayesian Learning in Probabilistic Graphical Models using Moment Matching with Applications. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10499

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Omar, Farheen. “Online Bayesian Learning in Probabilistic Graphical Models using Moment Matching with Applications.” 2016. Thesis, University of Waterloo. Accessed December 11, 2019. http://hdl.handle.net/10012/10499.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Omar, Farheen. “Online Bayesian Learning in Probabilistic Graphical Models using Moment Matching with Applications.” 2016. Web. 11 Dec 2019.

Vancouver:

Omar F. Online Bayesian Learning in Probabilistic Graphical Models using Moment Matching with Applications. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10012/10499.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Omar F. Online Bayesian Learning in Probabilistic Graphical Models using Moment Matching with Applications. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10499

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of New Mexico

24. Roy, Sushmita. Learning condition-specific networks.

Degree: Department of Computer Science, 2009, University of New Mexico

 Condition-specific cellular networks are networks of genes and proteins that describe functional interactions among genes occurring under different environmental conditions. These networks provide a systems-level… (more)

Subjects/Keywords: Machine learning; Computational Biology; Probabilistic graphical models; Gene expression; Condition-specific response

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Roy, S. (2009). Learning condition-specific networks. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/10331

Chicago Manual of Style (16th Edition):

Roy, Sushmita. “Learning condition-specific networks.” 2009. Doctoral Dissertation, University of New Mexico. Accessed December 11, 2019. http://hdl.handle.net/1928/10331.

MLA Handbook (7th Edition):

Roy, Sushmita. “Learning condition-specific networks.” 2009. Web. 11 Dec 2019.

Vancouver:

Roy S. Learning condition-specific networks. [Internet] [Doctoral dissertation]. University of New Mexico; 2009. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1928/10331.

Council of Science Editors:

Roy S. Learning condition-specific networks. [Doctoral Dissertation]. University of New Mexico; 2009. Available from: http://hdl.handle.net/1928/10331


University of Illinois – Urbana-Champaign

25. Bean, Andrew J. Message passing algorithms - methods and applications.

Degree: PhD, Electrical & Computer Engr, 2015, University of Illinois – Urbana-Champaign

 Algorithms on graphs are used extensively in many applications and research areas. Such applications include machine learning, artificial intelligence, communications, image processing, state tracking, sensor… (more)

Subjects/Keywords: probabilistic graphical models; approximate inference; universal portfolios; message passing; analog to digital converters (ADC)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bean, A. J. (2015). Message passing algorithms - methods and applications. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78397

Chicago Manual of Style (16th Edition):

Bean, Andrew J. “Message passing algorithms - methods and applications.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed December 11, 2019. http://hdl.handle.net/2142/78397.

MLA Handbook (7th Edition):

Bean, Andrew J. “Message passing algorithms - methods and applications.” 2015. Web. 11 Dec 2019.

Vancouver:

Bean AJ. Message passing algorithms - methods and applications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2142/78397.

Council of Science Editors:

Bean AJ. Message passing algorithms - methods and applications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78397


University of Illinois – Urbana-Champaign

26. Zhao, Bo. Truth finding in databases.

Degree: PhD, 0112, 2013, University of Illinois – Urbana-Champaign

 In practical data integration systems, it is common for the data sources being integrated to provide conflicting information about the same entity. Consequently, a major… (more)

Subjects/Keywords: data integration; truth finding; data fusion; data quality; entity matching; data mining; probabilistic graphical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhao, B. (2013). Truth finding in databases. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42470

Chicago Manual of Style (16th Edition):

Zhao, Bo. “Truth finding in databases.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed December 11, 2019. http://hdl.handle.net/2142/42470.

MLA Handbook (7th Edition):

Zhao, Bo. “Truth finding in databases.” 2013. Web. 11 Dec 2019.

Vancouver:

Zhao B. Truth finding in databases. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2142/42470.

Council of Science Editors:

Zhao B. Truth finding in databases. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42470


University of Waterloo

27. Zhong, Zilong. Spectral-Spatial Neural Networks and Probabilistic Graph Models for Hyperspectral Image Classification.

Degree: 2019, University of Waterloo

 Pixel-wise hyperspectral image (HSI) classification has been actively studied since it shares similar characteristics with related computer vision tasks, including image classification, object detection, and… (more)

Subjects/Keywords: hyperspectral image classification; spectral-spatial neural networks; generative adversarial networks; probabilistic graphical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhong, Z. (2019). Spectral-Spatial Neural Networks and Probabilistic Graph Models for Hyperspectral Image Classification. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14893

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zhong, Zilong. “Spectral-Spatial Neural Networks and Probabilistic Graph Models for Hyperspectral Image Classification.” 2019. Thesis, University of Waterloo. Accessed December 11, 2019. http://hdl.handle.net/10012/14893.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zhong, Zilong. “Spectral-Spatial Neural Networks and Probabilistic Graph Models for Hyperspectral Image Classification.” 2019. Web. 11 Dec 2019.

Vancouver:

Zhong Z. Spectral-Spatial Neural Networks and Probabilistic Graph Models for Hyperspectral Image Classification. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10012/14893.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhong Z. Spectral-Spatial Neural Networks and Probabilistic Graph Models for Hyperspectral Image Classification. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14893

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Arkansas

28. Chung, Ming-Hua. Probabilistic Graphical Modeling on Big Data.

Degree: PhD, 2015, University of Arkansas

  The rise of Big Data in recent years brings many challenges to modern statistical analysis and modeling. In toxicogenomics, the advancement of high-throughput screening… (more)

Subjects/Keywords: Pure sciences; Applied sciences; Bayesian nonparametric; Big data; Probabilistic graphical models; Social networks; Topic models; Toxicogenomics; Applied Statistics; Categorical Data Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chung, M. (2015). Probabilistic Graphical Modeling on Big Data. (Doctoral Dissertation). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/1415

Chicago Manual of Style (16th Edition):

Chung, Ming-Hua. “Probabilistic Graphical Modeling on Big Data.” 2015. Doctoral Dissertation, University of Arkansas. Accessed December 11, 2019. https://scholarworks.uark.edu/etd/1415.

MLA Handbook (7th Edition):

Chung, Ming-Hua. “Probabilistic Graphical Modeling on Big Data.” 2015. Web. 11 Dec 2019.

Vancouver:

Chung M. Probabilistic Graphical Modeling on Big Data. [Internet] [Doctoral dissertation]. University of Arkansas; 2015. [cited 2019 Dec 11]. Available from: https://scholarworks.uark.edu/etd/1415.

Council of Science Editors:

Chung M. Probabilistic Graphical Modeling on Big Data. [Doctoral Dissertation]. University of Arkansas; 2015. Available from: https://scholarworks.uark.edu/etd/1415


ETH Zürich

29. Wadehn, Federico. State Space Methods with Applications in Biomedical Signal Processing.

Degree: 2019, ETH Zürich

 For more than a decade, the model-based approach to signal processing based on state space models (SSMs) and factor graphs is being pursued at the… (more)

Subjects/Keywords: Biomedical signal processing; Probabilistic graphical models; Signal processing; Optimization; State space models; info:eu-repo/classification/ddc/621.3; Electric engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wadehn, F. (2019). State Space Methods with Applications in Biomedical Signal Processing. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/344762

Chicago Manual of Style (16th Edition):

Wadehn, Federico. “State Space Methods with Applications in Biomedical Signal Processing.” 2019. Doctoral Dissertation, ETH Zürich. Accessed December 11, 2019. http://hdl.handle.net/20.500.11850/344762.

MLA Handbook (7th Edition):

Wadehn, Federico. “State Space Methods with Applications in Biomedical Signal Processing.” 2019. Web. 11 Dec 2019.

Vancouver:

Wadehn F. State Space Methods with Applications in Biomedical Signal Processing. [Internet] [Doctoral dissertation]. ETH Zürich; 2019. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/20.500.11850/344762.

Council of Science Editors:

Wadehn F. State Space Methods with Applications in Biomedical Signal Processing. [Doctoral Dissertation]. ETH Zürich; 2019. Available from: http://hdl.handle.net/20.500.11850/344762


University of Colorado

30. Kightley, Eric Paul. Stokes, Gauss, and Bayes Walk into a Bar...

Degree: PhD, 2019, University of Colorado

 This thesis consists of three distinct projects. The first is a study of microbial aggregate fragmentation, in which we develop a dynamical model of aggregate… (more)

Subjects/Keywords: classification; clustering; dimensionality reduction; probabilistic graphical models; random projections; Applied Mathematics; Artificial Intelligence and Robotics; Statistical Models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kightley, E. P. (2019). Stokes, Gauss, and Bayes Walk into a Bar... (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/152

Chicago Manual of Style (16th Edition):

Kightley, Eric Paul. “Stokes, Gauss, and Bayes Walk into a Bar...” 2019. Doctoral Dissertation, University of Colorado. Accessed December 11, 2019. https://scholar.colorado.edu/appm_gradetds/152.

MLA Handbook (7th Edition):

Kightley, Eric Paul. “Stokes, Gauss, and Bayes Walk into a Bar...” 2019. Web. 11 Dec 2019.

Vancouver:

Kightley EP. Stokes, Gauss, and Bayes Walk into a Bar... [Internet] [Doctoral dissertation]. University of Colorado; 2019. [cited 2019 Dec 11]. Available from: https://scholar.colorado.edu/appm_gradetds/152.

Council of Science Editors:

Kightley EP. Stokes, Gauss, and Bayes Walk into a Bar... [Doctoral Dissertation]. University of Colorado; 2019. Available from: https://scholar.colorado.edu/appm_gradetds/152

[1] [2] [3]

.