+publisher:"University of Illinois – Chicago" +contributor:("Reyzin, Lev")

University of Illinois – Chicago

1. Fish, Benjamin. New Models and Algorithms for Data Analysis.

Degree: 2018, University of Illinois – Chicago

► In this thesis, we introduce and analyze new models and new algorithms for problems in data analysis. Many new challenges and constraints for data analysis… (more)

Subjects/Keywords: data analysis; machine learning; computational learning theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Fish, B. (2018). New Models and Algorithms for Data Analysis. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22689

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

Chicago Manual of Style (16^th Edition):

Fish, Benjamin. “New Models and Algorithms for Data Analysis.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22689.

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

MLA Handbook (7^th Edition):

Fish, Benjamin. “New Models and Algorithms for Data Analysis.” 2018. Web. 18 Jan 2021.

Vancouver:

Fish B. New Models and Algorithms for Data Analysis. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22689.

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

Council of Science Editors:

Fish B. New Models and Algorithms for Data Analysis. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22689

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

University of Illinois – Chicago

2. Janardhanan, Mano Vikash. Algorithms for Learning Networks and Learning from Networks.

Degree: 2019, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/23636

► There are many different networks we encounter in every day life. Social networks, internet (short form of interconnected network) and biological networks are some examples.… (more)

Subjects/Keywords: theoretical computer science; learning theory; complexity theory; graph theory; machine learning

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Janardhanan, M. V. (2019). Algorithms for Learning Networks and Learning from Networks. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23636

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

Chicago Manual of Style (16^th Edition):

Janardhanan, Mano Vikash. “Algorithms for Learning Networks and Learning from Networks.” 2019. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/23636.

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

MLA Handbook (7^th Edition):

Janardhanan, Mano Vikash. “Algorithms for Learning Networks and Learning from Networks.” 2019. Web. 18 Jan 2021.

Vancouver:

Janardhanan MV. Algorithms for Learning Networks and Learning from Networks. [Internet] [Thesis]. University of Illinois – Chicago; 2019. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/23636.

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

Council of Science Editors:

Janardhanan MV. Algorithms for Learning Networks and Learning from Networks. [Thesis]. University of Illinois – Chicago; 2019. Available from: http://hdl.handle.net/10027/23636

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

University of Illinois – Chicago

3. Huang, Yi. Problems in Learning under Limited Resources and Information.

Degree: 2017, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/21988

► The main theme of this thesis is to investigate how learning problems can be solved in the face of limited resources and with limited information… (more)

Subjects/Keywords: feature-efficient learning; network construction

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Huang, Y. (2017). Problems in Learning under Limited Resources and Information. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21988

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

Chicago Manual of Style (16^th Edition):

Huang, Yi. “Problems in Learning under Limited Resources and Information.” 2017. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/21988.

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

MLA Handbook (7^th Edition):

Huang, Yi. “Problems in Learning under Limited Resources and Information.” 2017. Web. 18 Jan 2021.

Vancouver:

Huang Y. Problems in Learning under Limited Resources and Information. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/21988.

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

Council of Science Editors:

Huang Y. Problems in Learning under Limited Resources and Information. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21988

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

University of Illinois – Chicago

4. Stading, RJ. Ramsey Type Results on Hypercubes and Hypergraphs.

Degree: 2015, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/19392

► In this thesis, we will examine some Ramsey type problems for graphs and hypergraphs. Our starting point, and motivating question, is to determine the minimum… (more)

Subjects/Keywords: hypercube

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Stading, R. (2015). Ramsey Type Results on Hypercubes and Hypergraphs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/19392

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

Chicago Manual of Style (16^th Edition):

Stading, RJ. “Ramsey Type Results on Hypercubes and Hypergraphs.” 2015. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/19392.

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

MLA Handbook (7^th Edition):

Stading, RJ. “Ramsey Type Results on Hypercubes and Hypergraphs.” 2015. Web. 18 Jan 2021.

Vancouver:

Stading R. Ramsey Type Results on Hypercubes and Hypergraphs. [Internet] [Thesis]. University of Illinois – Chicago; 2015. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/19392.

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

Council of Science Editors:

Stading R. Ramsey Type Results on Hypercubes and Hypergraphs. [Thesis]. University of Illinois – Chicago; 2015. Available from: http://hdl.handle.net/10027/19392

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

University of Illinois – Chicago

5. Kun, Jeremy J. Graphs, New Models, and Complexity.

Degree: 2016, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/20977

► Over the past few decades the internet and social networks became central to our society. As a consequence, the study of networks and the algorithmic… (more)

Subjects/Keywords: computational complexity; graphs; resilience; theoretical computer science

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kun, J. J. (2016). Graphs, New Models, and Complexity. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/20977

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

Chicago Manual of Style (16^th Edition):

Kun, Jeremy J. “Graphs, New Models, and Complexity.” 2016. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/20977.

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

MLA Handbook (7^th Edition):

Kun, Jeremy J. “Graphs, New Models, and Complexity.” 2016. Web. 18 Jan 2021.

Vancouver:

Kun JJ. Graphs, New Models, and Complexity. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/20977.

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

Council of Science Editors:

Kun JJ. Graphs, New Models, and Complexity. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/20977

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

University of Illinois – Chicago

6. Monfort, Mathew. Methods in Large Scale Inverse Optimal Control.

Degree: 2016, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/21540

► As our technology continues to evolve, so does the complexity of the problems that we expect our systems to solve. The challenge is that these… (more)

Subjects/Keywords: machine learning; artificial intelligence; inverse optimal control; graph search; autonomous agents; reinforcement learning; path distributions; robotic control; robotics; robots; activity recognition

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Monfort, M. (2016). Methods in Large Scale Inverse Optimal Control. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21540

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

Chicago Manual of Style (16^th Edition):

Monfort, Mathew. “Methods in Large Scale Inverse Optimal Control.” 2016. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/21540.

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

MLA Handbook (7^th Edition):

Monfort, Mathew. “Methods in Large Scale Inverse Optimal Control.” 2016. Web. 18 Jan 2021.

Vancouver:

Monfort M. Methods in Large Scale Inverse Optimal Control. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/21540.

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

Council of Science Editors:

Monfort M. Methods in Large Scale Inverse Optimal Control. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/21540

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

University of Illinois – Chicago

7. Lelkes, Ádám D. Algorithms and Complexity Results for Learning and Big Data.

Degree: 2017, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/21729

► This thesis focuses on problems in the theory and practice of machine learning and big data. We will explore the complexity-theoretic properties of MapReduce, one… (more)

▼ This thesis focuses on problems in the theory and practice of machine learning and big data. We will explore the complexity-theoretic properties of MapReduce, one of the most ubiquitous distributed computing frameworks for big data, give new algorithms and prove computational hardness results for a model of clustering, and study fairness in machine learning applications. In our study of MapReduce, we address some of the central questions that computational complexity theory asks about models of computation. After giving a detailed and precise formalization of MapReduce as a model of computation, based on the work of Karloff et al., we compare it to classical Turing machines, and show that languages which can be decided by a Turing machine using sublogarithmic space can also be decided by a constant-round MapReduce computation. In the second half of the chapter, we turn our attention to the question of whether an increased number of rounds or an increased amount of computation time per processor leads to strictly more computational power. We answer this question in the affirmative, proving a hierarchy theorem for MapReduce computations, conditioned on the Exponential Time Hypothesis. We will also study an interactive model of clustering introduced by Balcan and Blum. In this framework of clustering, we give algorithms for clustering linear functionals and hyperplanes, and give computational hardness results that show that other concept classes, including deterministic finite automata, constant-depth threshold circuits, and Boolean formulas, are not possible to efficiently cluster if standard cryptographic assumptions hold. Finally, we address the issue of fairness in machine learning. We propose a novel approach for modifying three popular machine learning algorithms, AdaBoost, logistic regression, and support vector machines, to eliminate bias against a protected group. We empirically compare our method to previous approaches in the literature as well as various baseline algorithms by evaluating them on various real-world datasets, and also give theoretical justification for its performance. We also propose a new measure of fairness for machine learning classifiers, and demonstrate that it can help distinguish between naive and more sophisticated approaches even in the cases when measuring error and bias is not sufficient. Advisors/Committee Members: Turán, György (advisor), Reyzin, Lev (advisor), Friedland, Shmuel (committee member), Hellerstein, Lisa (committee member), Sloan, Robert (committee member), Turán, György (chair).

Subjects/Keywords: theoretical computer science; learning theory; machine learning; big data; complexity theory; mapreduce; clustering

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Lelkes, �. D. (2017). Algorithms and Complexity Results for Learning and Big Data. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21729

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

Chicago Manual of Style (16^th Edition):

Lelkes, Ádám D. “Algorithms and Complexity Results for Learning and Big Data.” 2017. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/21729.

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

MLA Handbook (7^th Edition):

Lelkes, Ádám D. “Algorithms and Complexity Results for Learning and Big Data.” 2017. Web. 18 Jan 2021.

Vancouver:

Lelkes �D. Algorithms and Complexity Results for Learning and Big Data. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/21729.

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

Council of Science Editors:

Lelkes �D. Algorithms and Complexity Results for Learning and Big Data. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21729

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

University of Illinois – Chicago

8. Hardwick, John. Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games.

Degree: 2017, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/21740

► In cooperative game theory, the class of assignment games models a hypothetical market with two groups of people (for instance, buyers and sellers, or men… (more)

Subjects/Keywords: game theory; cooperative game theory; nucleolus; assignment game; matching; graph theory; directed graph; algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Hardwick, J. (2017). Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21740

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

Chicago Manual of Style (16^th Edition):

Hardwick, John. “Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games.” 2017. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/21740.

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

MLA Handbook (7^th Edition):

Hardwick, John. “Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games.” 2017. Web. 18 Jan 2021.

Vancouver:

Hardwick J. Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/21740.

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

Council of Science Editors:

Hardwick J. Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21740

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

University of Illinois – Chicago

9. Bliss, Nathan R. Computing Series Expansions of Algebraic Space Curves.

Degree: 2018, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/22682

► We work towards a series-based computational approach for polynomial systems having positive-dimensional solution sets. The tropical variety gives information on the exponents of the leading… (more)

Subjects/Keywords: computational algebraic geometry; puiseux series; gauss-newton algorithm; tropical geometry; polynomial systems; homotopy continuation

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Bliss, N. R. (2018). Computing Series Expansions of Algebraic Space Curves. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22682

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

Chicago Manual of Style (16^th Edition):

Bliss, Nathan R. “Computing Series Expansions of Algebraic Space Curves.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22682.

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

MLA Handbook (7^th Edition):

Bliss, Nathan R. “Computing Series Expansions of Algebraic Space Curves.” 2018. Web. 18 Jan 2021.

Vancouver:

Bliss NR. Computing Series Expansions of Algebraic Space Curves. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22682.

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

Council of Science Editors:

Bliss NR. Computing Series Expansions of Algebraic Space Curves. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22682

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

University of Illinois – Chicago

10. Sommars, Jeffrey C. Algorithms and Implementations in Computational Algebraic Geometry.

Degree: 2018, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/22687

► In this thesis, we explore several areas of computational algebraic geometry, and develop new algorithms and software in each. We are generally interested in solving… (more)

Subjects/Keywords: Tropical geometry; computational algebraic geometry

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sommars, J. C. (2018). Algorithms and Implementations in Computational Algebraic Geometry. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22687

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

Chicago Manual of Style (16^th Edition):

Sommars, Jeffrey C. “Algorithms and Implementations in Computational Algebraic Geometry.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22687.

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

MLA Handbook (7^th Edition):

Sommars, Jeffrey C. “Algorithms and Implementations in Computational Algebraic Geometry.” 2018. Web. 18 Jan 2021.

Vancouver:

Sommars JC. Algorithms and Implementations in Computational Algebraic Geometry. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22687.

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

Council of Science Editors:

Sommars JC. Algorithms and Implementations in Computational Algebraic Geometry. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22687

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

University of Illinois – Chicago

11. Cole, Samuel. An Iterative Spectral Approach to Recovering Planted Partitions.

Degree: 2018, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/22704

► In the planted partition problem, the n vertices of a random graph are partitioned into k "clusters," and edges between vertices in the same cluster… (more)

Subjects/Keywords: Planted partition; Clustering; Random graphs; Spectral algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cole, S. (2018). An Iterative Spectral Approach to Recovering Planted Partitions. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22704

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

Chicago Manual of Style (16^th Edition):

Cole, Samuel. “An Iterative Spectral Approach to Recovering Planted Partitions.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22704.

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

MLA Handbook (7^th Edition):

Cole, Samuel. “An Iterative Spectral Approach to Recovering Planted Partitions.” 2018. Web. 18 Jan 2021.

Vancouver:

Cole S. An Iterative Spectral Approach to Recovering Planted Partitions. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22704.

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

Council of Science Editors:

Cole S. An Iterative Spectral Approach to Recovering Planted Partitions. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22704

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

University of Illinois – Chicago

12. Sharabiani, Anooshiravan. Novel Approaches Towards Fast and Accurate Time series Classification.

Degree: 2018, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/22708

► A time series is a collection of values made or recorded over time. Dynamic Time Warping (DTW) is an algorithm for measuring similarity between two… (more)

▼ A time series is a collection of values made or recorded over time. Dynamic Time Warping (DTW) is an algorithm for measuring similarity between two time series. DTW is one the most successful similarity measure in time series data mining. First-Nearest-Neighbor Dynamic Time Warping (1-NN DTW) is the most widely used classification method on time series. Multiple recent studies show that for the problem of time series classification, 1-NN DTW is very hard to beat. The disadvantage of DTW is its quadratic complexity in the length of time series. The focus of this research is improving the efficiency of DTW while retaining its accuracy level on time series classification. The first contribution of this thesis is that, it proposes a new approximation called Control Chart Approximation (CCA). CCA representation approximates raw time series by transforming them into a set of segments with aggregated values and durations forming a reduced 3-dimensional vector. The CCA transformation attempts to reduce noise, dimensionality, and storage of time series, while retaining the significant features of the original time series. The second contribution of this thesis is extension of DTW in three dimension space as a distance measure for a 1-NN classifier. The method is called 1-Nearest Neighbor 3-Dimensional Dynamic Time Warping (1-NN 3D DTW). CCA and 1-NN 3D DTW, have focused on the reduction of data, while improving the processing time of 1-NN DTW on classification of long time series. The third contribution consists of developing Blocked Dynamic Time Warping (BDTW), a new similarity measure which works on run-length encoded time series. BDTW algorithm utilizes the repetition of values in time series to calculate the exact DTW for any- two-valued time series, and to calculate a close approximation of DTW for more-than-two-valued time series with repetition of any values. By combining BDTW and Adaptive Piecewise Constant Approximation (APCA) method, a new DTW approximation method is proposed which works for all type of time series (even without repetition of values). The effectiveness of the 3D DTW and BDTW are shown on different applications, using the case studies and 85 datasets in UCR time series classification archive. Advisors/Committee Members: Darabi, Houshang (advisor), Reyzin, Lev (committee member), Scott, Michael (committee member), Li, Lin (committee member), Hu, Mengqi (committee member), Darabi, Houshang (chair).

Subjects/Keywords: Time series; Dynamic Time Warping; Classification; Approximation Methods

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sharabiani, A. (2018). Novel Approaches Towards Fast and Accurate Time series Classification. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22708

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

Chicago Manual of Style (16^th Edition):

Sharabiani, Anooshiravan. “Novel Approaches Towards Fast and Accurate Time series Classification.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22708.

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

MLA Handbook (7^th Edition):

Sharabiani, Anooshiravan. “Novel Approaches Towards Fast and Accurate Time series Classification.” 2018. Web. 18 Jan 2021.

Vancouver:

Sharabiani A. Novel Approaches Towards Fast and Accurate Time series Classification. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22708.

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

Council of Science Editors:

Sharabiani A. Novel Approaches Towards Fast and Accurate Time series Classification. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22708

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

University of Illinois – Chicago

13. Wang, Lujia. Problems in Extremal and Probabilistic Combinatorics.

Degree: 2018, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/22982

► We study the following four problems in extremal and probabilistic combinatorics: 1. A sunflower is a collection of distinct sets such that the intersection of… (more)

▼ We study the following four problems in extremal and probabilistic combinatorics: 1. A sunflower is a collection of distinct sets such that the intersection of any two of them is the same as the common intersection C of all of them, and |C| is smaller than each of the sets. We consider the problems of determining the maximum sum and product of k families of subsets of [n] that contain no sunflower of size k with one set from each family. For the sum, we prove that the maximum is (k-1)2ⁿ⁺¹⁺∑_s=0^k-2\binom{n}{s} for all n ≥ k ≥ 3, and for the k=3 case of the product, we prove that the maximum is ≤ ft(\frac{1}{8}+o(1)))2³ⁿ. We conjecture that for all fixed k ≥ 3, the maximum product is (1/8+o(1))2^kn. 2. For k ≥ 4, a loose k-cycle C_k is a hypergraph with distinct edges e₁, e₂, …, e_k such that consecutive edges (modulo k) intersect in exactly one vertex and all other pairs of edges are disjoint. Our main result is that for every even integer k ≥ 4, there exists c>0 such that the number of triple systems with vertex set [n] containing no C_k is at most 2^cn². An easy construction shows that the exponent is sharp in order of magnitude. Our proof method is different than that used for most recent results of a similar flavor about enumerating discrete structures, since it does not use hypergraph containers. One novel ingredient is the use of some (new) quantitative estimates for an asymmetric version of the bipartite canonical Ramsey theorem. 3. For p ∈ [0,1] and an integer n, let Q(n,p) be the random set system, obtained by picking each subset of [n] independently with probability p. We prove that for many configurations \F that arise naturally in extremal set theory there is a threshold probability p₀ such that if p \ll p₀ then asymptotically almost surely Q(n,p) contains no member of \F while if p \gg p₀ then asymptotically almost surely Q(n,p) contains many members of \F. Our general results imply that p₀=(t+1)^-n/t is the threshold for the appearance of a matching of size t and is also a threshold for the appearance a chain of size of size t. This generalizes results of R\'enyi from 1961 who answered a question of Erd\H os by solving these two problems for t=2. R\'enyi observed that his approach did not work for larger t for either a matching or chain. We overcome this problem by using the second moment method on a more restricted class of configurations than the entire family \F. Our general result also determines the threshold for the appearance of a sunflower of size t and several other configurations. 4. A family \A\subset 2^[n] is intersecting if A\cap B\neq \emptyset for all A, B∈ \A. We prove that if p=2^-Θ(√{nlog n)}, the maximum intersecting family in the random set system Q(n, p) is (1+o(1))p 2^n-1. This is a continuation of the work by Balogh, Bohman and Mubayi who proved the random version of the Erd\H{o}s – Ko – Rado theorem in… Advisors/Committee Members: Mubayi, Dhruv (advisor), Turan, Gyorgy (committee member), Reyzin, Lev (committee member), DasGupta, Bhaskar (committee member), Kaul, Hemanshu (committee member), Mubayi, Dhruv (chair).

Subjects/Keywords: Combinatorics; Extremal set theory; Probabilistic methods; Random set systems

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Wang, L. (2018). Problems in Extremal and Probabilistic Combinatorics. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22982

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

Chicago Manual of Style (16^th Edition):

Wang, Lujia. “Problems in Extremal and Probabilistic Combinatorics.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22982.

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

MLA Handbook (7^th Edition):

Wang, Lujia. “Problems in Extremal and Probabilistic Combinatorics.” 2018. Web. 18 Jan 2021.

Vancouver:

Wang L. Problems in Extremal and Probabilistic Combinatorics. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22982.

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

Council of Science Editors:

Wang L. Problems in Extremal and Probabilistic Combinatorics. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22982

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

University of Illinois – Chicago

14. Liu, Anqi. Robust Prediction Methods for Covariate Shift and Active Learning.

Degree: 2018, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/22988

► In real world machine learning applications, it is often not very realistic to assume that the training data distribution aligns with the testing data distribution.… (more)

▼ In real world machine learning applications, it is often not very realistic to assume that the training data distribution aligns with the testing data distribution. A relaxation is to assume the distribution shift only occurs on the input variable (covariates), while the conditional output distribution given the input variable (covariates) remains the same. This is called the covariate shift setting. Besides various examples of covariate shift in supervised learning tasks, one of the typical covariate shift scenarios is the sampling bias problem in pool-based active learning, in which the learner selects the labeled set, thus introducing a different input distribution from the unlabeled pool in each step of learning and prediction. In this thesis, we propose a general framework for robust prediction under covariate shift. Rather than focusing on minimizing a reweighted empirical loss on training data, we manage to more directly optimize the expected test loss with a minimax approach. The resulting predictor provides more randomized predictions on test data when it lacks training data distribution support and therefore avoids possible loss induced by over optimistic extrapolation of other predictors. This framework accounts for facilitating different loss function minimization and incorporating different feature functions and feature generalization assumptions. We discuss how the framework reduces to specific forms and the corresponding approaches to estimate the parameters. Moreover, we investigate active learning using robust prediction when the active learning step is constructed as a special case of robust covariate shift problem. We conduct experiments on synthetic biased benchmark datasets and natural covariate shift datasets to show performance of the robust prediction on real data. Additionally, we evaluate pool-based active learning using robust prediction on benchmark real data sets. We demonstrate a number of benefits over existing methods. Advisors/Committee Members: Ziebart, Brian (advisor), Liu, Bing (committee member), Yu, Philip (committee member), Reyzin, Lev (committee member), Dudik, Miro (committee member), Ziebart, Brian (chair).

Subjects/Keywords: Covariate Shift; Active Learning; Robust Learning; Classification; Kernel Methods

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Liu, A. (2018). Robust Prediction Methods for Covariate Shift and Active Learning. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22988

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

Chicago Manual of Style (16^th Edition):

Liu, Anqi. “Robust Prediction Methods for Covariate Shift and Active Learning.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22988.

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

MLA Handbook (7^th Edition):

Liu, Anqi. “Robust Prediction Methods for Covariate Shift and Active Learning.” 2018. Web. 18 Jan 2021.

Vancouver:

Liu A. Robust Prediction Methods for Covariate Shift and Active Learning. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22988.

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

Council of Science Editors:

Liu A. Robust Prediction Methods for Covariate Shift and Active Learning. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22988

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

University of Illinois – Chicago

15. Diochnos, Dimitrios. Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases.

Degree: 2013, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/10366

► This thesis is concerned with problems that arise in learning theory as well as with an investigation, using the tools of network analysis, of a… (more)

▼ This thesis is concerned with problems that arise in learning theory as well as with an investigation, using the tools of network analysis, of a popular commonsense knowledge base that is publicly available online and reasoning with the knowledge that is available in the database. We study the evolvability of monotone conjunctions through an intuitive neighborhood under the uniform distribution, give a structure theorem of best approximations, and improve the previous known results. We show the existence of local optima under μ-nondegenerate product distributions for the same algorithm. Using covariance as the fitness metric we prove a similar structure theorem as well as the evolvability of short monotone conjunctions under these distributions. Using points from the moment curve we show that the VC dimension of d-dimensional halfspaces is Ω(d\lg r) under the multiple-instance learning framework, matching the previous known upper bound. This result is also shown to hold over any large point set in general position. Further, it is shown that the hypothesis finding problem is NP-complete. The disagreement coefficient of a concept class for a fixed distribution can be used to give bounds for the label complexity of active learning. We study the disagreement coefficient of monotone conjunctions under the uniform distribution and compute tight, or almost tight, asymptotic lower and upper bounds for every target. This is the first time that the disagreement coefficient is studied for Boolean concept classes. We are investigating the commonsense knowledge base ConceptNet 4 using the tools of network analysis. We identify missing links, spurious links, as well as provide additional knowledge to be added in ConceptNet. Using variants of spreading activation techniques we use the database for question answering and explain, as well as improve, candidate answers for the same questions from a previous study that relied in a low-rank approximation of the adjacency matrix. Aiming to add general rules for further reasoning we mine frequent triples from ConceptNet. This mining approach also identifies incorrect assertions already in ConceptNet. Finally, we also identify rules that may make sense as factual statements about the world but not in terms of natural language usage. Advisors/Committee Members: Turán, György (advisor), Mubayi, Dhruv (committee member), Reyzin, Lev (committee member), Verschelde, Jan (committee member), Sloan, Robert H. (committee member).

Subjects/Keywords: evolvability; multiple-instance learning; active learning; knowledge bases; network analysis; Boolean functions

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Diochnos, D. (2013). Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/10366

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

Chicago Manual of Style (16^th Edition):

Diochnos, Dimitrios. “Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases.” 2013. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/10366.

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

MLA Handbook (7^th Edition):

Diochnos, Dimitrios. “Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases.” 2013. Web. 18 Jan 2021.

Vancouver:

Diochnos D. Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases. [Internet] [Thesis]. University of Illinois – Chicago; 2013. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/10366.

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

Council of Science Editors:

Diochnos D. Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases. [Thesis]. University of Illinois – Chicago; 2013. Available from: http://hdl.handle.net/10027/10366

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

University of Illinois – Chicago

16. Cameron, Alexander M. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.

Degree: 2018, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/23148

► Let a 2 to 1 directed hypergraph be a 3-uniform hypergraph where every edge has two tail vertices and one head vertex. For any such… (more)

Subjects/Keywords: combinatorics; graph theory; hypergraphs; extremal problems; directed hypergraphs; Ramsey's theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cameron, A. M. (2018). Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23148

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

Chicago Manual of Style (16^th Edition):

Cameron, Alexander M. “Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/23148.

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

MLA Handbook (7^th Edition):

Cameron, Alexander M. “Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.” 2018. Web. 18 Jan 2021.

Vancouver:

Cameron AM. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/23148.

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

Council of Science Editors:

Cameron AM. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/23148

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

University of Illinois – Chicago

17. Powers, Brian Reed. An Analysis of Multivariate Final-Offer Arbitration.

Degree: 2016, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/21615

► When negotiations fail, arbitration is often an effective means by which a binding resolution can be found. To address the many shortcomings of conventional arbitration,… (more)

Subjects/Keywords: game theory; final offer arbitration; muti-dimensional; whole package; uncertainty; optimal strategies

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Powers, B. R. (2016). An Analysis of Multivariate Final-Offer Arbitration. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21615

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

Chicago Manual of Style (16^th Edition):

Powers, Brian Reed. “An Analysis of Multivariate Final-Offer Arbitration.” 2016. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/21615.

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

MLA Handbook (7^th Edition):

Powers, Brian Reed. “An Analysis of Multivariate Final-Offer Arbitration.” 2016. Web. 18 Jan 2021.

Vancouver:

Powers BR. An Analysis of Multivariate Final-Offer Arbitration. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/21615.

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

Council of Science Editors:

Powers BR. An Analysis of Multivariate Final-Offer Arbitration. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/21615

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

University of Illinois – Chicago

18. Fathony, Rizal Zaini Ahmad. Performance-Aligned Learning Algorithms with Statistical Guarantees.

Degree: 2019, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/23627

► The goal of many prediction tasks in machine learning is to learn a prediction function that minimizes certain loss metrics (e.g., zero-one, ordinal, and cost-sensitive… (more)

Subjects/Keywords: Machine Learning; Classification; Surrogate Loss; Structured Prediction; Graphical Models

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Fathony, R. Z. A. (2019). Performance-Aligned Learning Algorithms with Statistical Guarantees. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23627

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

Chicago Manual of Style (16^th Edition):

Fathony, Rizal Zaini Ahmad. “Performance-Aligned Learning Algorithms with Statistical Guarantees.” 2019. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/23627.

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

MLA Handbook (7^th Edition):

Fathony, Rizal Zaini Ahmad. “Performance-Aligned Learning Algorithms with Statistical Guarantees.” 2019. Web. 18 Jan 2021.

Vancouver:

Fathony RZA. Performance-Aligned Learning Algorithms with Statistical Guarantees. [Internet] [Thesis]. University of Illinois – Chicago; 2019. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/23627.

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

Council of Science Editors:

Fathony RZA. Performance-Aligned Learning Algorithms with Statistical Guarantees. [Thesis]. University of Illinois – Chicago; 2019. Available from: http://hdl.handle.net/10027/23627

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

19. Cooper, Jeffrey R. Independent Sets in Sparse Hypergraphs.

Degree: 2014, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/18782

► We study the independence number and chromatic number of hypergraphs which contain no copies of a fixed subgraph. Let H be a 3-uniform hypergraph with… (more)

Subjects/Keywords: hypergraphs; independent sets; chromatic number

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cooper, J. R. (2014). Independent Sets in Sparse Hypergraphs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/18782

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

Chicago Manual of Style (16^th Edition):

Cooper, Jeffrey R. “Independent Sets in Sparse Hypergraphs.” 2014. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/18782.

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

MLA Handbook (7^th Edition):

Cooper, Jeffrey R. “Independent Sets in Sparse Hypergraphs.” 2014. Web. 18 Jan 2021.

Vancouver:

Cooper JR. Independent Sets in Sparse Hypergraphs. [Internet] [Thesis]. University of Illinois – Chicago; 2014. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/18782.

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

Council of Science Editors:

Cooper JR. Independent Sets in Sparse Hypergraphs. [Thesis]. University of Illinois – Chicago; 2014. Available from: http://hdl.handle.net/10027/18782

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

20. Yu, Xiangcheng. Accelerating Polynomial Homotopy Continuation on Graphics Processing Units.

Degree: 2016, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/20153

► Polynomial homotopy continuation is a symbolic-numerical method to compute all solutions of a polynomial system. In this thesis, an accelerated homotopy continuation method is designed… (more)

Subjects/Keywords: cloud computing; graphics processing unit(GPU); massive parallel algorithm; Newton's method; polynomial system; polynomial homotopy

3 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Yu, X. (2016). Accelerating Polynomial Homotopy Continuation on Graphics Processing Units. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/20153

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

Chicago Manual of Style (16^th Edition):

Yu, Xiangcheng. “Accelerating Polynomial Homotopy Continuation on Graphics Processing Units.” 2016. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/20153.

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

MLA Handbook (7^th Edition):

Yu, Xiangcheng. “Accelerating Polynomial Homotopy Continuation on Graphics Processing Units.” 2016. Web. 18 Jan 2021.

Vancouver:

Yu X. Accelerating Polynomial Homotopy Continuation on Graphics Processing Units. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/20153.

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

Council of Science Editors:

Yu X. Accelerating Polynomial Homotopy Continuation on Graphics Processing Units. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/20153

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

21. Habiba, Habiba. Critical Individuals in Dynamic Population Networks.

Degree: 2013, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/10140

► Diffusion of contaminants, diseases, rumors, fads, and many other dynamic processes typically take place through a network of interacting entities. One fundamental question in the… (more)

▼ Diffusion of contaminants, diseases, rumors, fads, and many other dynamic processes typically take place through a network of interacting entities. One fundamental question in the context of diffusion, particularly in social networks is: which entities in a network are critical for a given diffusion process? For instance, these critical entities could be individuals to whom free products should be given in a network so that the adoption of the product is maximized. Or, individuals in a population who should be vaccinated so that the spread of a virus or a contaminant is minimized. Or, leaders in a network that are critical for initiating a mass movement. In my research, I address the question of finding critical individuals for diffusion in networks in the context of network theory, graph mining, machine learning, and social network analysis. My research focuses on two complimentary optimization goals: maximization and minimization of the extent of the resulting extent of diffusion. For diffusion maximization, I analyze: 1. the hardness of diffusion maximization in dynamic networks; 2. the impact of structural changes in prediction of diffusion in networks; 3. the global structural indicators for measuring the effectiveness of various diffusion maximization methods in both static and dynamic networks. For diffusion minimization, I develop simple, practical, and locally computable heuristics for identifying critical nodes in dynamic networks. In this work, I study explicitly dynamic or time evolving networks instead of traditional static or aggregate representation of networks. Lastly, for rigorous analysis of the stochastic diffusion optimization problem, realistic network generative models are very crucial. I present a truly dynamic statistical generative network model that captures membership, formation, and fluidity of community membership and the resulting structure of interactions. Advisors/Committee Members: Berger-Wolf, Tanya (advisor), Di Eugenio, Barbara (committee member), Gmytrasiewicz, Piotr (committee member), Reyzin, Lev (committee member), Subramanian, Vijay (committee member).

Subjects/Keywords: Network theory; Graph mining; Social Network Analysis

10 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Habiba, H. (2013). Critical Individuals in Dynamic Population Networks. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/10140

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

Chicago Manual of Style (16^th Edition):

Habiba, Habiba. “Critical Individuals in Dynamic Population Networks.” 2013. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/10140.

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

MLA Handbook (7^th Edition):

Habiba, Habiba. “Critical Individuals in Dynamic Population Networks.” 2013. Web. 18 Jan 2021.

Vancouver:

Habiba H. Critical Individuals in Dynamic Population Networks. [Internet] [Thesis]. University of Illinois – Chicago; 2013. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/10140.

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

Council of Science Editors:

Habiba H. Critical Individuals in Dynamic Population Networks. [Thesis]. University of Illinois – Chicago; 2013. Available from: http://hdl.handle.net/10027/10140

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

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations