Staff

When you look at a scenic mountain photo typically everything in the distance is in sharp focus. But this scene might be even more captivating if something striking were in the foreground, perhaps a field of wild flowers in peak bloom. The problem is if the flowers are close to the lens relative to the mountains it’s impossible for all elements in the photo to be in perfect focus — if the flowers are sharp, the distant mountains will be blurry and vice versa.

Professor Robin Cohen has received a Lifetime Achievement Award from the Canadian Artificial Intelligence Association. She is the first female recipient of the Association’s highest honour, an award that is conferred to individuals who have distinguished themselves through outstanding research excellence in artificial intelligence during the course of their academic career.

Speaker: Rejean Lau (University of Alberta)

Sentiment classification is a form of the text categorization problem where user sentiment is categorized as either positive or negative sentiment. It is generally accepted that sentiment analysis is a more challenging classification problem then topic categorization and here the bag of words approach does not perform as well. Using the IMDB sentiment dataset from Cornell University, we improve on their results by using a stacked classifier and web-mined features.

Friday, November 18, 2005 11:30 am - 11:30 am EST (GMT -05:00)

AI seminar: Dealing with word sense disambiguation in lexical chaining

Speaker: Mattt Enss

A lexical chain is a sequence of words in a document that are semantically related (i.e., related in meaning). Lexical chains indicate where certain topics or subjects are being discussed in a document. The chains therefore can provide context and be used to determine where topic changes occur.

Friday, November 11, 2005 11:30 am - 11:30 am EST (GMT -05:00)

AI seminar: Beyond integer domains: The all different and global cardinality constraints

Speaker: Claude-Guy Quimper

After giving a brief summary of general principles in constraint programming, we will present two constraints: the all different constraint and the global cardinality constraint.

Friday, November 4, 2005 11:30 am - 11:30 am EST (GMT -05:00)

AI seminar: Structuring interactive cluster analysis

Speaker: Wayne Oldford (Dir. of Computational Math, UW)

The problem of cluster analysis, or finding groups in data, is inherently ill-posed; hence the multitude of different methods which purport to solve "the'' problem. In this talk, a variety of examples illustrate this point and cast doubt on whether a single universally useful clustering method exists.

Friday, October 28, 2005 11:30 am - 11:30 am EDT (GMT -04:00)

AI seminar: Who's asking for help? A Bayesian approach to intelligent assistance

Speaker: Bowen Hui (University of Toronto)

Automated software customization is drawing increasing attention as a means to help users deal with the scope, complexity, potential intrusiveness, and ever-changing nature of modern software. The ability to automatically customize functionality, interfaces, and advice to specific users is made more difficult by the uncertainty about the needs of specific individuals and their preferences for interaction.