Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Keyword
-
- Conic Optimization Problem (1)
- Controlled Tabular Adjustment (1)
- Cosine similarity based clustering (1)
- Difference of votes (1)
- Electoral college (1)
-
- Fiedler vector (1)
- Interior Point Method (1)
- Laplacian matrix (1)
- Lattices (1)
- Order (1)
- Popular vote (1)
- Poset (1)
- Probability of agreement (1)
- Residuated maps (1)
- Statistical Disclosure Limitation (1)
- Unassociated data (1)
- Vector valued graph (1)
- Vertex weighted graph (1)
- Voting theory (1)
- Way-below (1)
Articles 1 - 4 of 4
Full-Text Articles in Other Mathematics
Residuated Maps, The Way-Below Relation, And Contractions On Probabilistic Metric Spaces., M. Ryan Luke
Residuated Maps, The Way-Below Relation, And Contractions On Probabilistic Metric Spaces., M. Ryan Luke
Electronic Theses and Dissertations
In this dissertation, we will examine residuated mappings on a function lattice and how they behave with respect to the way-below relation. In particular, which residuated $\phi$ has the property that $F$ is way-below $\phi(F)$ for $F$ in appropriate sets. We show the way-below relation describes the separation of two functions and how this corresponds to contraction mappings on probabilistic metric spaces. A new definition for contractions is considered using the way-below relation.
Extending Difference Of Votes Rules On Three Voting Models., Sarah Schulz King
Extending Difference Of Votes Rules On Three Voting Models., Sarah Schulz King
Electronic Theses and Dissertations
In a voting situation where there are only two competing alternatives, simple majority rule outputs the alternatives with the most votes or declares a tie if both alternatives receive the same number of votes. For any non-negative integer k, the difference of votes rule Mk outputs the alternative that beats the competing alternative by more than k votes. Llamazares (2006) gives a characterization of the difference of votes rules in terms of five axioms. In this thesis, we extend Llamazares' result by completely describing the class of voting rules that satisfy only two out of his five axioms. …
Vertex Weighted Spectral Clustering, Mohammad Masum
Vertex Weighted Spectral Clustering, Mohammad Masum
Electronic Theses and Dissertations
Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler vector. Coefficients of a Fiedler vector are used to partition vertices of a given graph into two clusters. A vertex of a graph is classified as unassociated if the Fiedler coefficient of the vertex is close to …
Optimization Methods For Tabular Data Protection, Iryna Petrenko
Optimization Methods For Tabular Data Protection, Iryna Petrenko
Electronic Theses and Dissertations
In this thesis we consider a minimum distance Controlled Tabular Adjustment (CTA) model for statistical disclosure limitation (control) of tabular data. The goal of the CTA model is to find the closest safe table to some original tabular data set that contains sensitive information. The measure of closeness is usually measured using l1 or l2 norm; with each measure having its advantages and disadvantages. According to the given norm CTA can be formulated as an optimization problem: Liner Programing (LP) for l1, Quadratic Programing (QP) for l2. In this thesis we present an alternative …