Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

Data Mining - Concepts and Techniques.

An important part of our information-gathering behavior has always been to find out what other people think. With the growing availability and popularity of opinion-rich resources such as online review sites and personal blogs, new opportunities and challenges arise as people now can, and do, actively use information technologies to seek out and understand the opinions of others. The sudden eruption of activity in the area of opinion mining and sentiment analysis, which deals with the computational treatment of opinion, sentiment, and subjectivity in text, has thus occurred at least in part as a direct response to the surge of interest in new systems that deal directly with opinions as a first-class object.

This survey covers techniques and approaches that promise to directly enable opinion-oriented information-seeking systems. Our focus is on methods that seek to address the new challenges raised by sentiment-aware applications, as compared to those that are already present in more traditional fact-based analysis. We include material on summarization of evaluative text and on broader issues regarding privacy, manipulation, and economic impact that the development of opinion-oriented information-access services gives rise to. To facilitate future work, a discussion of available resources, benchmark datasets, and evaluation campaigns is also provided.

/pdf/opinion-mining-and-sentiment-analysis-3v5ya3qqiw.pdf

Opinion Mining and Sentiment Analysis

From the Publisher: 
The accessible presentation of this book gives both a general view of the entire computer vision enterprise and also offers sufficient detail to be able to build useful applications. Users learn techniques that have proven to be useful by first-hand experience and a wide range of mathematical methods. A CD-ROM with every copy of the text contains source code for programming practice, color images, and illustrative movies. Comprehensive and up-to-date, this book includes essential topics that either reflect practical significance or are of theoretical importance. Topics are discussed in substantial and increasing depth. Application surveys describe numerous important application areas such as image based rendering and digital libraries. Many important algorithms broken down and illustrated in pseudo code. Appropriate for use by engineers as a comprehensive reference to the computer vision enterprise.

Computer vision : a modern approach = 计算机视觉 : 一种现代的方法

We present a system for interactively browsing and exploring large unstructured collections of photographs of a scene using a novel 3D interface. Our system consists of an image-based modeling front end that automatically computes the viewpoint of each photograph as well as a sparse 3D model of the scene and image to model correspondences. Our photo explorer uses image-based rendering techniques to smoothly transition between photographs, while also enabling full 3D navigation and exploration of the set of images and world geometry, along with auxiliary information such as overhead maps. Our system also makes it easy to construct photo tours of scenic or historic locations, and to annotate image details, which are automatically transferred to other relevant images. We demonstrate our system on several large personal photo collections as well as images gathered from Internet photo sharing sites.

Photo tourism: exploring photo collections in 3D

We propose a system that automatically transforms web content into TV-like video content for ubiquitous environments. We call this system the ubiquitous/universal passive viewer (u-PaV). The u-PaV consists mainly of audio and visual components. The audio component uses synthesized speech to read out titles and lines extracted from the target web content. Simultaneously, the visual component of the u- PaV presents the titles and lines to a user display through a ticker. Keywords and images extracted from the web content are animated on the display. A suitable background color is determined based on the overall impression of the content. The u-PaV synchronizes the ticker, animation, and speech. We introduce the u-PaV and explain how the keywords are extracted and how the impression value of the web content is determined. A test with 50 users showed that the u-PaV is easier to use and understand than browsing web content alone.

u-PaV: Automatic Transformation of Web Content into TV-like Video Content for Ubiquitous Environment

A method is described for learning a distance metric for use in object identification that does not require human supervision. It is based on two assumptions. One is that pairs of different names refer to different objects. The other is that names are arbitrary. These two assumptions justify using pairs of data items for objects with different names as “cannot-be-linked” example pairs for learning a distance metric for use in clustering ambiguous names. The metric learning is formulated using only dissimilar example pairs as a convex quadratic programming problem that can be solved much faster than a semi-definite programming problem, which generally must be solved to learn a distance metric matrix. Experiments on author identification using a bibliographic database showed that the learned metric improves identification F-measure.

https://link.springer.com/content/pdf/10.1007/11871637_62.pdf

Learning a distance metric for object identification without human supervision

In this paper, we present a new search index generation technique that collects fields of office documents which are previously mapped to XML schema elements, and generate an XML-based search index including document types, file locations and fields collected from the documents and their semantic notations. The search index allows users to effectively find the target documents by specifying the document type and field values collected from the documents. In order to allow the search index to be securely shared by many users, access control policy is unified into the search index. We also propose an algorithm that computes the answer of search query corresponding to access permission of the user.

An Effective and Secure Search of Office Documents

A method of automatically indexing broadcast content using live chat on the Web is proposed. The live chat is a Web bulletin board where the viewers post messages in sync with a TV program. Statistical analysis and pattern recognition of these messages can effectively extract metadata related to viewer's viewpoints such as important scenes in the program or responses by a particular viewer. Preliminary experiments indicate that the proposed method can efficiently extract metadata such as the intensity of viewers' responses and degree of emotional delight or depression. They also indicate that a prototype TV viewing system using the extracted metadata enables a new way of viewing TV content from different perspectives reflecting viewers' viewpoints.

Automatic indexing of broadcast content using its live chat on the Web

We propose a method to generate effective query suggestions aiming to help struggling search, where users experience difficulty in locating information that is relevant to their information need in the search session. The core is identifying struggling component of an on-going struggling session and mining the effective representations of it. The struggling component is the semantic component of information need for which the user struggled to find an effective representation during the struggling session. The proposed method identifies the struggling component of given on-going struggling session and mines the sessions containing the identified struggling component from a query log to build a struggling flow graph. The struggling flow graph records users' reformulation behaviors for the terms of the struggling component, through struggling flow graph we can mine effective representations of the struggling component. The experimental results demonstrate that the proposed method outperforms the baseline methods when it can use two or more queries in a struggling session.

Katsumi Tanaka

Papers

u-PaV: Automatic Transformation of Web Content into TV-like Video Content for Ubiquitous Environment

Learning a distance metric for object identification without human supervision

An Effective and Secure Search of Office Documents

Automatic indexing of broadcast content using its live chat on the Web

Query Suggestion for Struggling Search by Struggling Flow Graph