Search

Nowadays some recommender system researchers have already been engaging multi-criteria that model possible attributes of the item to generate the improved recommendations. However, the statistical machine learning methods successful in the single-rating recommender system have not been investigated in the context of multi-criteria ratings. In this paper, we propose two types of multi-criteria probabilistic latent semantic analysis algorithms extended from the single-rating version. First, the mixture of multi-variate Gaussian distribution is assumed to be the underlying distribution of multi-criteria ratings of each user. Second, we further assume the mixture of the linear Gaussian regression model as the underlying distribution of multi-criteria ratings of each user, inspired by the Bayesian network and linear regression. The experiment results on the Yahoo!Movies ratings data set show that the full multi-variate Gaussian model and the linear Gaussian regression model achieve a stable performance gain over other tested methods. [ABSTRACT FROM AUTHOR]

Online interaction with 3D facial animation & an alternative way of face-to-face communication for distance education. 3D facial modeling is essential for virtual educational environments establishment. This article presents a novel 3D facial modeling solution that facilitates quasi-facial communication for online learning. Our algorithm builds 3D facial models from a single image, with support of a 3D face database. First from the image, we extract a set of feature points, which are then used to automatically estimate the head pose parameters using the 3D mean face in our database as a reference model. After the pose recovery, a similarity measurement function is proposed to locate the neighborhood for the given image in the 3D face database. The scope of neighborhood can be determined adaptively using our cross-validation algorithm. Furthermore, the individual 3D shape is synthesized by neighborhood interpolation. Texture mapping is achieved based on feature points. The experimental results show that our algorithm can robustly produce 3D facial models from images captured in various scenarios to enhance the lifelikeness in distant learning. [ABSTRACT FROM AUTHOR]

Chinese brush calligraphy is a valuable civilization legacy and a high art of scholarship. It is still popular in Chinese banners, newspaper mastheads, university names, and celebration gifts. There are Web sites that try to help people enjoy and learn Chinese calligraphy. However, there lacks advanced services such as content-based retrieval or vivid writing process simulation for calligraphy learning. This article proposes a novel Chinese calligraphy learning approach: First, the scanned calligraphy pages were segmented into individual calligraphy characters using minimum-bounding box. Second, the individual character's feature information was extracted and kept. Then, a corresponding database was built to serve as a map between the feature data and the original raw data. Finally, a retrieval engine was constructed and a dynamic writing process was simulated to help learners get the calligraphy character they were interested in and watch how it was generated step by step. [ABSTRACT FROM AUTHOR]

A preface for the January 2006 issue of the "International Journal of Image and Graphics" is presented.

Due to the visually polysemous barrier, videos and images may be annotated by multiple tags. Discovering the correlations among different tags can significantly help predicting precise labels for videos and images. Many of recent studies toward multi-label learning construct a linear subspace embedding with encoded multi-label information, such that data points sharing many common labels tend to be close to each other in the embedded subspace. Motivated by the advances of compressive sensing research, a sparse representation that selects a compact subset to describe the input data can be more discriminative. In this paper, we propose a sparse multi-label learning method to circumvent the visually polysemous barrier of multiple tags. Our approach learns a multi-label encoded sparse linear embedding space from a related dataset, and maps the target data into the learned new representation space to achieve better annotation performance. Instead of using l1-norm penalty (lasso) to induce sparse representation, we propose to formulate the multi-label learning as a penalized least squares optimization problem with elastic-net penalty. By casting the video concept detection and image annotation tasks into a sparse multi-label transfer learning framework in this paper, ridge regression, lasso, elastic net, and the multi-label extended sparse discriminant analysis methods are, respectively, well explored and compared. [ABSTRACT FROM AUTHOR]

A social recommendation system has attracted a lot of attention recently in the research communities of information retrieval, machine learning, and data mining. Traditional social recommendation algorithms are often based on batch machine learning methods which suffer from several critical limitations, e.g., extremely expensive model retraining cost whenever new user ratings arrive, unable to capture the change of user preferences over time. Therefore, it is important to make social recommendation system suitable for real-world online applications where data often arrives sequentially and user preferences may change dynamically and rapidly. In this paper, we present a new framework of online social recommendation from the viewpoint of online graph regularized user preference learning (OGRPL), which incorporates both collaborative user-item relationship as well as item content features into an unified preference learning process. We further develop an efficient iterative procedure, OGRPL-FW which utilizes the Frank-Wolfe algorithm, to solve the proposed online optimization problem. We conduct extensive experiments on several large-scale datasets, in which the encouraging results demonstrate that the proposed algorithms obtain significantly lower errors (in terms of both RMSE and MAE) than the state-of-the-art online recommendation methods when receiving the same amount of training data in the online learning process. [ABSTRACT FROM PUBLISHER]