Industry
The Scaffolded Sound Beehive
Maes, AnneMarie (OKNO – Brussels Urban Bee Lab)
The Scaffolded Sound Beehive is an immersive multi-media installation which provides viewers an artistic visual and audio experience of activities in a beehive. Data were recorded in urban beehives and processed using sophisticated pattern recognition, AI technologies, and sonification and computer graphics software. The installation includes an experiment in using Deep Learning to interpret the activities in the hive based on sound and microclimate recording.
Pseudo-Supervised Training Improves Unsupervised Melody Segmentation
Lattner, Stefan (Austrian Research Institute for Artificial Intelligence) | Chacón, Carlos Eduardo Cancino (Austrian Research Institute for Artificial Intelligence) | Grachten, Maarten (Austrian Research Institute for Artificial Intelligence)
An important aspect of music perception in humans is the ability to segment streams of musical events into structural units such as motifs and phrases.A promising approach to the computational modeling of music segmentation employs the statistical and information-theoretic properties of musical data, based on the hypothesis that these properties can (at least partly) account for music segmentation in humans. Prior work has shown that in particular the information content of music events, as estimated from a generative probabilistic model of those events, is a good indicator for segment boundaries.In this paper we demonstrate that, remarkably, a substantial increase in segmentation accuracy can be obtained by not using information content estimates directly, but rather in a bootstrapping fashion. More specifically, we use information content estimates computed from a generative model of the data as a target for a feed-forward neural network that is trained to estimate the information content directly from the data. We hypothesize that the improved segmentation accuracy of this bootstrapping approach may be evidence that the generative model provides noisy estimates of the information content, which are smoothed by the feed-forward neural network, yielding more accurate information content estimates.
Slogans Are Not Forever: Adapting Linguistic Expressions to the News
Gatti, Lorenzo (FBK-IRST) | Özbal, Gözde (FBK-IRST) | Guerini, Marco (Trento RISE) | Stock, Oliviero (FBK-IRST) | Strapparava, Carlo (FBK-IRST)
Artistic creation is often based on the concept of blending. Linguistic creativity is no exception, as demonstrated for instance by the importance of metaphors in poetry. Blending can also be used to evoke a secondary concept while playing with an already given piece of language, either with the intention of making the secondary concept well perceivable to the reader, or instead, to subtly evoke something additional. Current language technology can do a lot in this connection, and automated language creativity can be useful in cases where input or target are to change continuously, making human production not feasible. In this work we present a system that takes existing well-known expressions and innovates them by bringing in a novel concept coming from evolving news. The technology is composed of several steps concerned with the selection of the sortable concepts and the production of novel expressions, largely relying on state of the art corpus-based methods. Proposed applications include: i) producing catchy news headlines by "parasitically" exploiting well known successful expressions and adapting them to the news at hand; ii) generating adaptive slogans that allude to news of the day and give life to the concept evoked by the slogan; iii) providing artists with an application for boosting their creativity.
Computational Invention of Cadences and Chord Progressions by Conceptual Chord-Blending
Eppe, Manfred (IIIA-CSIC, ICSI) | Confalonieri, Roberto (IIIA-CSIC) | MacLean, Ewen (University of Edinburgh) | Kaliakatsos, Maximos (Uniersity of Thessaloniki) | Cambouropoulos, Emilios (University of Thessaloniki) | Schorlemmer, Marco (IIIA-CSIC) | Codescu, Mihai (University of Magdeburg) | Kühnberger, Kai-Uwe (University of Osnabrück)
We present a computational framework for chord invention based on a cognitive-theoretic perspective on conceptual blending. The framework builds on algebraic specifications, and solves two musicological problems. It automatically finds transitions between chord progressions of different keys or idioms, and it substitutes chords in a chord progression by other chords of a similar function, as a means to create novel variations. The approach is demonstrated with several examples where jazz cadences are invented by blending chords in cadences from earlier idioms, and where novel chord progressions are generated by inventing transition chords.
Artificial Intelligence in the Concertgebouw
Arzt, Andreas (Johannes Kepler University Linz) | Frostel, Harald (Johannes Kepler University Linz) | Gadermaier, Thassilo (Austrian Research Institute for Artificial Intelligence) | Gasser, Martin (Austrian Research Institute for Artificial Intelligence) | Grachten, Maarten (Austrian Research Institute for Artificial Intelligence) | Widmer, Gerhard (Johannes Kepler University Linz)
In this paper we present a real-world application (the first of its kind) of machine listening in the context of a live concert in a world-famous concert hall - the Concertgebouw in Amsterdam. A real-time music tracking algorithm listens to the Royal Concertgebouw Orchestra performing Richard Strauss' Alpensinfonie and follows the progress in the sheet music, i.e., continuously tracks the most likely position of the live music in the printed score. This information, in turn, is used to enrich the concert experience for members of the audience by streaming synchronised visual content (the sheet music, explanatory text and videos) onto tablet computers in the concert hall. The main focus of this paper is on the challenges involved in tracking live orchestral music, i.e., how to deal with heavily polyphonic music, how to prepare the data needed, and how to achieve the necessary robustness and precision.
Tackling Data Sparseness in Recommendation using Social Media based Topic Hierarchy Modeling
Zhu, Xingwei (Tsinghua University) | Ming, Zhao-Yan (DigiPen Institute of Technology) | Hao, Yu (Tsinghua University) | Zhu, Xiaoyan (Tsinghua University)
Recommendation systems play an important role in E-Commerce. However, their potential usefulness in real world applications is greatly limited by the availability of historical rating records from the customers. This paper presents a novel method to tackle the problem of data sparseness in user ratings with rich and timely domain information from social media. We first extract multiple side information for products from their relevant social media contents. Next, we convert the information into weighted topic-item ratings and inject them into an extended latent factor based recommendation model in an optimized approach. Our evaluation on two real world datasets demonstrates the superiority of our method over state-of-the-art methods.
Catch the Black Sheep: Unified Framework for Shilling Attack Detection Based on Fraudulent Action Propagation
Zhang, Yongfeng (Tsinghua University) | Tan, Yunzhi (Tsinghua University) | Zhang, Min (Tsinghua University) | Liu, Yiqun (Tsinghua University) | Chua, Tat-Seng (National University of Singapore) | Ma, Shaoping (Tsinghua University)
Many e-commerce systems allow users to express their opinions towards products through user reviews systems. The user generated reviews not only help other users to gain a more insightful view of the products, but also help online businesses to make targeted improvements on the products or services. Besides, they compose the key component of various personalized recommender systems. However, the existence of spam user accounts in the review systems introduce unfavourable disturbances into personalized recommendation by promoting or degrading targeted items intentionally through fraudulent reviews. Previous shilling attack detection algorithms usually deal with a specific kind of attacking strategy, and are exhausted to handle with the continuously emerging new cheating methods. In this work, we propose to conduct shilling attack detection for more informed recommendation by fraudulent action propagation on the reviews themselves, without caring about the specific underlying cheating strategy, which allows us a unified and flexible framework to detect the spam users.
A Unified Probabilistic Model of User Activities and Relations on Social Networking Sites
Yu, Xiaofeng (HP Labs China) | Xie, Junqing (HP Labs China) | Wang, Shuai (HP Labs China)
In this work, we investigate the bidirectional mutual interactions (BMI) between users' activities and user-user relationships on social networking sites. We analyze and study the fundamental mechanism that drives the characteristics and dynamics of BMI is the underlying social influence. We make an attempt at a unified probabilistic approach, called joint activity and relation (JAR), for modeling and predicting users' activities and user-user relationships simultaneously in a single coherent framework. Instead of incorporating social influence in an ad hoc manner, we show that social influence can be captured quantitatively. Based on JAR, we learn social influence between users and users' personal preferences for both user activity prediction and user-user relation discovery through statistical inference. To address the challenges of the introduced multiple layers of hidden variables in JAR, we propose a new learning algorithm based on expectation maximization (EM) and we further propose a powerful and efficient generalization of the EM based algorithm for model fitting.We show that JAR exploits mutual interactions and benefits, by taking advantage of the learned social influence and users' personal preferences, for enhanced user activity prediction and user-user relation discovery. We further experiment with real world dataset to verify the claimed advantages achieving substantial performance gains.
Unsupervised Sentiment Analysis for Social Media Images
Wang, Yilin (Arizona State University) | Wang, Suhang (Arizona State University) | Tang, Jiliang (Arizona State University) | Liu, Huan (Arizona State University) | Li, Baoxin (Arizona State University)
Current methods of sentiment analysis for social media images include low-level visual feature based approaches [Jia et Recently text-based sentiment prediction has been al., 2012; Yang et al., 2014], mid-level visual feature based extensively studied, while image-centric sentiment approaches [Borth et al., 2013; Yuan et al., 2013] and deep analysis receives much less attention. In this paper, learning based approaches [You et al., 2015]. The vast majority we study the problem of understanding human of existing methods are supervised, relying on labeled images sentiments from large-scale social media images, to train sentiment classifiers. Unfortunately, sentiment considering both visual content and contextual information, labels are in general unavailable for social media images, and such as comments on the images, captions, it is too labor-and time-intensive to obtain labeled sets large etc. The challenge of this problem lies in enough for robust training. In order to utilize the vast amount the "semantic gap" between low-level visual features of unlabeled social media images, an unsupervised approach and higher-level image sentiments. Moreover, would be much more desirable.
Interest Inference via Structure-Constrained Multi-Source Multi-Task Learning
Song, Xuemeng (National University of Singapore) | Nie, Liqiang (National University of Singapore) | Zhang, Luming (National University of Singapore) | Liu, Maofu (Wuhan University of Science and Technology) | Chua, Tat-Seng (National University of Singapore)
User interest inference from social networks is a fundamental problem to many applications. It usually exhibits dual-heterogeneities: a user's interests are complementarily and comprehensively reflected by multiple social networks; interests are inter-correlated in a nonuniform way rather than independent to each other. Although great success has been achieved by previous approaches, few of them consider these dual-heterogeneities simultaneously. In this work, we propose a structure-constrained multi-source multi-task learning scheme to co-regularize the source consistency and the tree-guided task relatedness. Meanwhile, it is able to jointly learn the task-sharing and task-specific features. Comprehensive experiments on a real-world dataset validated our scheme. In addition, we have released our dataset to facilitate the research communities.