Speaker: Susan L. Epstein, Hunter College
Location: Warren Weaver Hall 1302
Date: November 1, 2013, 11:30 a.m.
Host: Ernest Davis
Real-world problems and human perceptions about them are considerably richer and more challenging than pairwise relationships suggest. This talk explores the shortcomings of a traditional focus on pairwise similarity metrics, and shows how sets of similar objects better support incisive reasoning and intelligent behavior. In three diverse domains, a new algorithm detects subgraphs of size greater than two that support particular goals. The first domain is constraint satisfaction problems, where binary graphs represent the degree to which variables mutually restrict one another. Here, the algorithm discovers particularly difficult subproblems, directs initial resources to them, demonstrably accelerates search, and clarifies the nature of the problem for human users. The second domain is protein-protein interaction (PPI) networks, where binary graphs represent known interactions between proteins. Here, the algorithm discovers sets of genes that interact heavily with one another and suggests avenues of investigation for human researchers. The third domain is item recommendation, where sets of binary graphs represent multiple similarities among movies. Here, the algorithm discovers subsets that support recommendations for a prospective viewer. In each case, facets of similarity are explored and controlled to support reasoning and develop expertise.
Refreshments will be offered starting 15 minutes prior to the scheduled start of the talk.