go to the list of abstracts

go to the list of previous talks
previous talks

go to the list of other SCS seminars
scs seminars

go to the SCS home page

go to the CMU home page


The Next Talk Sp'15 Talks General Info Speaking Req't

KB-LDA: Jointly Learning a Knowledge Base of Hierarchy, Relations, and Facts

Monday, March 30th, 2015 from 12-1 pm in GHC 6501.

Dana Movshovitz-Attias, CSD

Knowledge bases (KBs) are large repositories of structured knowledge. In many existing KBs, data is organized according to a manually defined schema, including, a hierarchy of interesting categories (e.g., "People", "Animals") and relations between the categories (e.g., <"People", "raise", "Animals">). The schema is given as an input to the system, which then extracts facts that match the structure (e.g., is_a("dog", "Animals")) from a collection of unstructured text documents. These structured repositories are useful in performing tasks which require high-level semantic reasoning over text, such as search and question answering, and they are widely used by all major search engines.

In this talk, we present a model that automatically learns a structure of categories and relations from an input collection of text documents, and also identifies facts that match the learned structure. Our approach is based on topic models, a learning framework through which we jointly model text and examples extracted from the text, using patterns that indicate hierarchy and relations between entities mentioned in the documents.

As a case study, we apply the model to Web documents from a specialized domain; we construct a knowledge base of software concepts, such as programming languages, version control systems, and databases.

In Partial Fulfillment of the Speaking Requirement.

Spring 2015 Schedule
Mon, Jan 12 GHC 6501 Expired
Fri, Jan 16 GHC 6501 Expired
Mon, Jan 19 GHC 6501 Expired
Fri, Jan 23 GHC 6501 AVAILABLE
Mon, Jan 26 GHC 6501 AVAILABLE
Fri, Jan 30 GHC 6501 AVAILABLE
Mon, Feb 2 GHC 6501 AVAILABLE
Fri, Feb 6 GHC 6501 AVAILABLE
Mon, Feb 9 GHC 6501 AVAILABLE
Fri, Feb 13 GHC 6501 AVAILABLE
Mon, Feb 16 GHC 7501 AVAILABLE
Fri, Feb 20 GHC 6501 AVAILABLE
Mon, Feb 23 GHC 6501 Se-Joon Chung Quadratic Encoding for Hand Pose Reconstruction from Multi-Touch Input
Fri, Feb 27 GHC 6501 AVAILABLE
Mon, Mar 2 GHC 6501 AVAILABLE
Fri, Mar 6 GHC 6501 AVAILABLE
Mon, Mar 9 GHC 6501 Spring Break By request only
Fri, Mar 13 GHC 6501 Spring Break By request only
Mon, Mar 16 GHC 6501 David Naylor Source Addresses: Can't Live with Them, Can't Live without Them
Fri, Mar 20 GHC 6501 John Dickerson FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments
Mon, Mar 23 GHC 6501 AVAILABLE
Fri, Mar 27 GHC 6501 AVAILABLE
Mon, Mar 30 GHC 6501 Dana Movshovitz-Attias KB-LDA: Jointly Learning a Knowledge Base of Hierarchy, Relations, and Facts
Fri, Apr 3 GHC 6501 Vagelis Papalexakis Efficient and Effective Brain Activity Mining and Modeling
Mon, Apr 6 GHC 6501 Pengtao Xie Incorporating Word Correlation Knowledge into Topic Modeling
Wed, Apr 8 GHC 8102 Alex Beutel ACCAMS: Additive Co-Clustering to Approximate Matrices Succinctly
Mon, Apr 13 GHC 6501 Matt Mukerjee TBA
Fri, Apr 17 GHC 6501 Miguel Araujo TBA
Mon, Apr 20 GHC 6501 AVAILABLE
Fri, Apr 24 GHC 6501 Stefan Muller TBA
Mon, Apr 27 GHC 6501 Deborah Katz TBA
Fri, May 1 GHC 6501 Joseph Tassarotti TBA
Mon, May 4 GHC 6501 Michael Sullivan A Calculus for Relaxed Memory

General Info

The Student Seminar Series is an informal research seminar by and for SCS graduate students from noon to 1 pm on Mondays and Fridays. Lunch is provided by the Computer Science Department (personal thanks to Sharon Burks and Debbie Cavlovich!). At each meeting, a different student speaker will give an informal, 40-minute talk about his/her research, followed by questions/suggestions/brainstorming. We try to attract people with a diverse set of interests, and encourage speakers to present at a very general, accessible level.

So why are we doing this and why take part? In the best case scenario, this will lead to some interesting cross-disciplinary work among people in different fields and people may get some new ideas about their research. In the worst case scenario, a few people will practice their public speaking and the rest get together for a free lunch.

Guideline & Speaking Requirement Need-to-Know

Note: Step #1 below are applicable to all SSS speakers. You can schedule AT MOST THREE talks per semester.

SSS is an ideal forum for SCS students to give presentations that count toward fulfilling their speaking requirements. The specifics, though, vary with each department. For instance, students in CSD will need to be familiar with the notes in Section 8 of the Ph.D. document and follow the instructions outlined on the Speakers Club homepage. Roughly speaking, these are the steps:

  1. Schedule a talk with SSS by sending your talk title, abstract, additional info (like "Joint work with..." or "In Partial Fulfillment of the Speaking Requirement"), and a picture of yourself (preferably jpeg) to sss@cs at least TWO WEEKS before your scheduled talk.
  2. After you are confirmed with your SSS slot, go to the Speakers Club Calendar and schedule your talk at least THREE WEEKS in advance of the talk date.
  3. On the day of your talk, make sure you print Speakers Club evaluation forms for your evaluators to use.
Students outside of CSD will need to check with their respective departments regarding the procedure. As another example, ISRI students fulfill their speaking requirements by attending a semesterly Software Research Seminar and giving X number of presentations per school year. If you have experience with your department that might help others in your department, please feel free to contribute your knowledge by emailing us. Thank you!

SSS Coordinators

Armaghan Naik, Computational Biology
Lin Xiao, CSD


Web contact: sss+www@cs