Unstructured Information Processing
with Apache UIMA
CSE 392, Computers Playing Jeopardy!, Fall 2011
Stony Brook University
http:/www.cs.stonybrook.edu/~cse392
What is UIMA?
UIMA is a framework, a me
CSE 392 Chapter 3 - Strong and Weak Ties:
3.1 - Triadic Closure:
The mechanisms by which nodes arrive and depart, and which edges form and vanish
Triadic Closure Principle = If 2 people in a social ne
CSE 392 Chapter 2 - Graphs:
2.1 - Basic Definitions:
Graph = A way of specifying relationships among a collection of items
A graph consists of a set of objects, called nodes, with certain pairs of the
CSE 392 Chapter 5 - Positive and Negative Networks: (5.1-5.3)
5.1 - Structural Balance:
Clique / Complete Graph = A social network in which everyone knows everyone else (an
edge joins each pair of nod
CSE 392 - Matching Markets:
10.1 - Bipartite Graphs and Perfect Matchings:
Good are allocated to people based on preferences, expressed in network form, but
there is no explicit buying, selling or pri
CSE 392 Chapter 9 - Auctions: (9.1 - 9.6)
9.1 - Types of Auctions:
Focus on where there is a seller auctioning one item to a set of buyers
Each bidder has an intrinsic value for the item being auction
XSB Prolog (cont.)
CSE 392, Computers Playing Jeopardy!, Fall 2011
Stony Brook University
http:/www.cs.stonybrook.edu/~cse392
1
Definite clause grammar (DCG)
A DCG is a way of expressing grammar in a
CSE 392 - Networks and Contexts:
4.1 - Homophily:
Homophily = Principle that we tend to be similar to our friends
Your friends are generally similar to you along racial and ethnic dimensions, age,
an