# 5.2 Using markov random fields for election prediction  (Page 4/5)

 Page 4 / 5
$Z\left(\theta \right)=\sum _{\xi }\text{exp}\left\{\sum _{i=1}^{D},{\theta }_{i},{\mu }_{i},\left({\xi }_{j}\right)\right\}$

Note that the sum over $\xi$ in the partition function refers to the sum over all possible $\xi$ , not just the $\xi$ that have been observed. This fact makes computation of the partition function intractable and we must approximate it. Following a sampling-based learning technique, we conclude [link] :

$\text{ln}Z\left(\theta \right)\approx \text{ln}\left(\frac{1}{T},\sum _{t=1}^{T},\text{exp},\left\{\sum _{i=1}^{D},\left({\theta }_{i}-{\theta }_{i}^{0}\right),{\mu }_{i},\left({\xi }_{t}\right)\right\}\right)+\text{ln}Z\left({\theta }^{0}\right)$

Where ${\theta }^{0}$ is some set of parameters from which T samples are drawn (20 in our case). Since $\text{ln}Z\left({\theta }^{0}\right)$ is a constant, we can leave it out of the optimization's objective function and we solve the MLE problem via gradient ascent.

$\nabla {\theta }_{i}^{t-1}=\sum _{j=1}^{13}{\mu }_{i}\left({\xi }_{j}\right)-\frac{13{\sum }_{t=1}^{T}\left({\mu }_{i},\left({\xi }_{t}\right),\text{exp},\left\{{\sum }_{r=1}^{D},\left({\theta }_{r}^{t-1}-{\theta }_{r}^{t-2}\right),{\mu }_{r},\left({\xi }_{t}\right)\right\}\right)}{{\sum }_{t=1}^{T}\text{exp}\left\{{\sum }_{r=1}^{D},\left({\theta }_{r}^{t-1}-{\theta }_{r}^{t-2}\right),{\mu }_{r},\left({\xi }_{t}\right)\right\}}$
${\theta }^{t}={\theta }^{t-1}+s*\nabla {\theta }^{t-1}$

Where $s$ is some small step size. We update ${\theta }^{0}$ on each iteration to be ${\theta }^{t-2}$ . This is due to the fact that the partition function approximation is only reasonable in a neighborhood of ${\theta }^{0}$ [link] . It follows that the $\xi$ 's which are indexed by t are drawn from a model with parameters ${\theta }^{t-2}$ , while the $\xi$ 's indexed by j still represent the historical data.

## Correcting for lack of data

Due to the small number of historical observations (13) and the large number of possible combinations for any edge ( $60\text{states}*60\text{states}=3,600$ combinations), we must come up with a more concise way to learn the relationships between counties. To that end, we look not at the absolute voting percentages of counties but rather the difference in voting percentage between each pair of neighboring counties. This method has the added bonus of circumventing the problem of overall change that has affected every county. Unfortunately, there are still 119 possible differences that could occur (-59,-58,...,0,...58,59) and only 13 elections to determine the frequency with which each difference occurs. Therefore, we place each difference into a cluster, e.g. [-9,-6]. We use 11 clusters total and since the differences between counties are fairly consistent between years, the 13 observations should be sufficient for an approximation of the marginal probabilities for each edge. These approximation techniques do not affect the way we solve the problem via gradient ascent. However, once gradient ascent is finished we must convert our small $\theta$ into standard long form (as displayed in Section 2.1).

## Performing map inference

Due to our approximation techniques in the learning process, we are confronted with a problem when attempting to predict the 2012 election. Since the entire model is based off relativity, any outcome for a particular county is equally likely as long as the rest of the model shifts with it. In order to ensure we do not get extremely low or high results, we must fix some subset of the counties as a starting point for the model. In order to do this, we utilize linear regression techniques (as discussed in the next section). Once the model is partially filled in, we solve the binary program stated above with our learned $\theta$ (in standard long form) via Gurobi Optimizer.

## Multivariate regression

Multivariate Linear Regression is commonly used in social sciences as a means of predicting future outcomes based off of known data. It will provide us with a comparison as well as a starting off point for our Markov Random Field model. Our model will have Incumbent Party Vote % as the dependent variable. That is, if a Democratic president is currently in office, then we will be predicting the voting %'s earned by this year's Democratic Candidate.

Is there any normative that regulates the use of silver nanoparticles?
what king of growth are you checking .?
Renato
What fields keep nano created devices from performing or assimulating ? Magnetic fields ? Are do they assimilate ?
why we need to study biomolecules, molecular biology in nanotechnology?
?
Kyle
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
why?
what school?
Kyle
biomolecules are e building blocks of every organics and inorganic materials.
Joe
anyone know any internet site where one can find nanotechnology papers?
research.net
kanaga
sciencedirect big data base
Ernesto
Introduction about quantum dots in nanotechnology
what does nano mean?
nano basically means 10^(-9). nanometer is a unit to measure length.
Bharti
do you think it's worthwhile in the long term to study the effects and possibilities of nanotechnology on viral treatment?
absolutely yes
Daniel
how to know photocatalytic properties of tio2 nanoparticles...what to do now
it is a goid question and i want to know the answer as well
Maciej
Abigail
for teaching engĺish at school how nano technology help us
Anassong
Do somebody tell me a best nano engineering book for beginners?
there is no specific books for beginners but there is book called principle of nanotechnology
NANO
what is fullerene does it is used to make bukky balls
are you nano engineer ?
s.
fullerene is a bucky ball aka Carbon 60 molecule. It was name by the architect Fuller. He design the geodesic dome. it resembles a soccer ball.
Tarell
what is the actual application of fullerenes nowadays?
Damian
That is a great question Damian. best way to answer that question is to Google it. there are hundreds of applications for buck minister fullerenes, from medical to aerospace. you can also find plenty of research papers that will give you great detail on the potential applications of fullerenes.
Tarell
what is the Synthesis, properties,and applications of carbon nano chemistry
Mostly, they use nano carbon for electronics and for materials to be strengthened.
Virgil
is Bucky paper clear?
CYNTHIA
carbon nanotubes has various application in fuel cells membrane, current research on cancer drug,and in electronics MEMS and NEMS etc
NANO
so some one know about replacing silicon atom with phosphorous in semiconductors device?
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Harper
Do you know which machine is used to that process?
s.
how to fabricate graphene ink ?
for screen printed electrodes ?
SUYASH
What is lattice structure?
of graphene you mean?
Ebrahim
or in general
Ebrahim
in general
s.
Graphene has a hexagonal structure
tahir
On having this app for quite a bit time, Haven't realised there's a chat room in it.
Cied
what is biological synthesis of nanoparticles
Got questions? Join the online conversation and get instant answers!