Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Theory and Algorithms
Influence Maximization Based On Community Detection And Dominating Sets, Ameya Marathe
Influence Maximization Based On Community Detection And Dominating Sets, Ameya Marathe
Master's Projects
An online platform where various people come together to share information and communicate is called a social network. These platforms are set apart from other means of communication mostly because you can follow and interact also with different people even some you never met, comment on their posts, and re-sharing their posts. Companies such as Amazon and Walmart use these platforms daily for marketing purposes, like spreading information regarding new products and services they offer. They carefully select a subset of users, called influencers, who are usually the ones with high influence over the rest of the users. Influencers receive …
Deep Learning On Graphs Using Graph Convolutional Networks, Saurabh Mithe
Deep Learning On Graphs Using Graph Convolutional Networks, Saurabh Mithe
Master's Projects
Graphs are a powerful way to model network data with the objects as nodes and the relationship between the various objects as links. Such graphs contain a plethora of valuable information about the underlying data which can be extracted, analyzed, and visualized using Machine Learning (ML). The challenge to this task is that graphs are non-Euclidean structures which means that they cannot be directly used with ML techniques because ML techniques only work with Euclidean structures like grids or sequences. In order to overcome this challenge, the graph structure first needs to be encoded into an equivalent Euclidean representation in …
Using Probabilistic Graphical Models To Solve Np-Complete Puzzle Problems, Fengjiao Wu
Using Probabilistic Graphical Models To Solve Np-Complete Puzzle Problems, Fengjiao Wu
Master's Projects
Probabilistic Graphical Models (PGMs) are commonly used in machine learning to solve problems stemming from medicine, meteorology, speech recognition, image processing, intelligent tutoring, gambling, games, and biology. PGMs are applicable for both directed graph and undirected graph. In this work, I focus on the undirected graphical model. The objective of this work is to study how PGMs can be applied to find solutions to two puzzle problems, sudoku and jigsaw puzzles. First, both puzzle problems are represented as undirected graphs, and then I map the relations of nodes to PGMs and Belief Propagation (BP). This work represents the puzzle grid …