BEGIN:VCALENDAR
PRODID:-//Mercury//HGEvent//EN
VERSION:2.0
METHOD:PUBLISH
BEGIN:VEVENT
STATUS:CONFIRMED
LAST-MODIFIED:20140426T231511
PRIORITY:0
CLASS:PUBLIC
UID:ATEvent-eed436ece7e23bbcfe0d4623c4969225
SUMMARY:CSE Seminar: Tina Eliassi-Rad
DESCRIPTION: \nSpeaker: Prof. Tina Eliassi-Rad\, Associate Professor\, Dept. of Computer Science\, Rutgers University\nTitle: \nMeasuring Tie Strength in Implicit Social Networks\nAbstract: \n"Given a set of people and a set of events attended by them\, we address the problem of measuring connectedness or tie strength between each pair of persons. The underlying assumption is that attendance at mutual events gives an implicit social network between people. We take an axiomatic approach to this problem. Starting from a list of axioms\, which a measure of tie strength must satisfy\, we characterize functions that satisfy all the axioms. We then show that there is a range of tie-strength measures that satisfy this characterization.\n \nA measure of tie strength induces a ranking on the edges of the social network (and on the set of neighbors for every person). We show that for applications where the ranking\, and not the absolute value of the tie strength\, is the important thing about the measure\, the axioms are equivalent to a natural partial order. To settle on a particular measure\, we must make a non-obvious decision about extending this partial order to a total order. This decision is best left to particular applications. We also classify existing tie-strength measures according to the axioms that they satisfy; and observe that none of the ""self-referential"" tie-strength measures satisfy the axioms. In our experiments\, we demonstrate the efficacy of our approach; show the completeness and soundness of our axioms\, and present Kendall Tau Rank Correlation between various tie-strength measures. Time-permitting\, I will discuss the big data issues of measuring tie-strength and applications of our work in the wild (e.g.\, the WaPo Social Reader).\nBio: \nTina Eliassi-Rad is an Associate Professor of Computer Science at Rutgers University. Before joining academia\, she was a Member of Technical Staff and Principal Investigator at Lawrence Livermore National Laboratory. Tina earned her Ph.D. in Computer Sciences (with a minor in Mathematical Statistics) at the University of Wisconsin-Madison. Within data mining and machine learning\, Tina's research has been applied to the World-Wide Web\, text corpora\, large-scale scientific simulation data\, complex networks\, and cyber situational awareness. She has published over 50 peer-reviewed papers (including a best paper runner-up award at ICDM'09 and a best interdisciplanary paper award at CIKM'12); and has given over 70 invited presentations. Tina is an action editor for the Data Mining and Knowledge Discovery Journal. In 2010\, she received an Outstanding Mentor Award from the US DOE Office of Science and a Directorate Gold Award from Lawrence Livermore National Laboratory for work on cyber situational awareness. Visit http://eliassi.org for more details.\n \n \n
DTSTART:20130426T140000
DTEND:20130426T150000
CREATED:20130419T151605
DTSTAMP:20130419T151605
SEQUENCE:0
LOCATION:
END:VEVENT
END:VCALENDAR