Dialogue systems intend to facilitate the interaction between humans and computers. A key element in a dialogue system is the conceptual model which represents a domain. Folksonomies are very simple forms of knowledge representation which may be used to specify the conceptual model. However, folksonomies suffer by nature from issues related to ambiguity. In this paper, we present a method which uses linguistic context for learning folksonomies from task-oriented dialogues. The linguistic context can be useful for reducing ambiguity, for instance, when using the folksonomies for interpreting utterances. Experiments show that the learned folksonomies increase the accuracy of the interpretation compared when not using the contextual information.

We propose a concept map based approach to assessing freely generated student responses. The proposed approach is based on a novel automated tuple extraction system, DT-OpenIE, for automatically extracting concept maps from student responses. The DT-OpenIE system is significantly better in terms of concept map quality for assessment purposes than state-of-the-art open information extraction (IE) systems such as Ollie or Stanford as evidenced by our experimental results. The concept map based approach can significantly improve tracking student's mastery level in an automated tutoring environment such as DeepTutor where students interact with the automated tutor using natural language because the concept maps can be used not only to generate a holistic score assessing the accuracy of a student response but also enable diagnostic feedback.

In this paper we adapt the semi-supervised deep learning architecture known as Convolutional Ladder Networks, from the domain of computer vision, and explore how well it works for a semi-supervised Named Entity Recognition and Classification task with legal data. The idea of exploring a semi-supervised technique is to asses the impact of large amounts of unsupervised data (cheap to obtain) in specific tasks that have little annotated data, in order to develop robust models that are less prone to overfitting. In order to achieve this, first we must check the impact on a task that is easier to measure. We are presenting some preliminary results, however, the experiments carried out show some very interesting insights that foster further research in the topic.

Increasing urban concentration raises operational challenges that can benefit from integrated monitoring and decision support. Such complex systems need to leverage the full stack of analytical methods, from state estimation using multi-sensor fusion for situational awareness, to prediction and computation of optimal responses. The FASTER platform that we describe in this work, deployed at nation scale and handling 1.5 billion public transport trips a year, offers such a full stack of techniques for this large-scale, real-time problem. FASTER provides fine-grained situational awareness and real-time decision support with the objective of improving the public transport commuter experience. The methods employed range from statistical machine learning to agent-based simulation and mixed-integer optimization. In this work we present an overview of the challenges and methods involved, with details of the commuter movement prediction module, as well as a discussion of open problems.

A voting center is in charge of collecting and aggregating voter preferences. In an iterative process, the center sends comparison queries to voters, requesting them to submit their preference between two items. Voters might discuss the candidates among themselves, figuring out during the elicitation process which candidates stand a chance of winning and which do not. Consequently, strategic voters might attempt to manipulate by deviating from their true preferences and instead submit a different response in order to attempt to maximize their profit. We provide a practical algorithm for strategic voters which computes the best manipulative vote and maximizes the voter's selfish outcome when such a vote exists. We also provide a careful voting center which is aware of the possible manipulations and avoids manipulative queries when possible. In an empirical study on four real-world domains, we show that in practice manipulation occurs in a low percentage of settings and has a low impact on the final outcome. The careful voting center reduces manipulation even further, thus allowing for a non-distorted group decision process to take place. We thus provide a core technology study of a voting process that can be adopted in opinion or information aggregation systems and in crowdsourcing applications, e.g., peer grading in Massive Open Online Courses (MOOCs).

As natural language uses a diverse and often vague way to express ideas, identifying a norm conflict and its causes While most social norms are informal, they are often in contracts is a challenging task. An ever larger number of formalized by companies in contracts to regulate contracts being currently generated necessitates a fast and reliable trades of goods and services. When poorly process to identify norm conflicts. However, since such written, contracts may contain normative conflicts contracts are written in natural language, traditional revision resulting from opposing deontic meanings or contradict methods involve contract makers reading the contract and specifications. As contracts tend to be identifying conflicting points between norms. Such a method long and contain many norms, manually identifying requires huge human-effort and may not guarantee a revision such conflicts requires human-effort, which is that eliminates all conflicts. In response, we provide three time-consuming and error-prone. Automating such contributions towards automatically identifying and classifying task benefits contract makers increasing productivity potential conflicts between norms in contracts.

Graphs are useful structures that can model several important real-world problems. Recently, learning graphs have drawn considerable attention, leading to the proposal of new methods for learning these data structures. One of these studies produced NetGAN, a new approach for generating graphs via random walks. Although NetGAN has shown promising results in terms of accuracy in the tasks of generating graphs and link prediction, the choice of vertices from which it starts random walks can lead to inconsistent and highly variable results, especially when the length of walks is short. As an alternative to random starting, this study aims to establish a new method for initializing random walks from a set of dense vertices. We purpose estimating the importance of a node based on the inverse of its influence over the whole vertices of its neighborhood through random walks of different sizes. The proposed method manages to achieve significantly better accuracy, less variance and lesser outliers.

Which Data Science / Machine Learning methods and algorithms did you use in 2018/2019 for a real-world application? This, in turn, mirrors the results of the 2017 poll, which found that the top 10 methods remained unchanged from the 2016 poll (although, again, they were in a different order). The average respondent used 7.4 methods/algorithms, which is in-line with both the 2017 and 2016 results. Below is a comparison of the top methods and algorithms in this year's poll with their 2017 shares. The most notable increases this year were found in the usage of various neural network technologies, including GANs, RNNs, CNNs, reinforcement learning, and vanilla deep neural networks.

There is a resurgent interest in developing intelligent open-domain dialog systems due to the availability of large amounts of conversational data and the recent progress on neural approaches to conversational AI. Unlike traditional task-oriented bots, an open-domain dialog system aims to establish long-term connections with users by satisfying the human need for communication, affection, and social belonging. This paper reviews the recent works on neural approaches that are devoted to addressing three challenges in developing such systems: semantics, consistency, and interactiveness. Semantics requires a dialog system to not only understand the content of the dialog but also identify user's social needs during the conversation. Consistency requires the system to demonstrate a consistent personality to win users trust and gain their long-term confidence. Interactiveness refers to the system's ability to generate interpersonal responses to achieve particular social goals such as entertainment, conforming, and task completion. The works we select to present here is based on our unique views and are by no means complete. Nevertheless, we hope that the discussion will inspire new research in developing more intelligent dialog systems.

Federated Learning is introduced to protect privacy by distributing training data into multiple parties. Each party trains its own model and a meta-model is constructed from the sub models. In this way the details of the data are not disclosed in between each party. In this paper we investigate the model interpretation methods for Federated Learning, specifically on the measurement of feature importance of vertical Federated Learning where feature space of the data is divided into two parties, namely host and guest. For host party to interpret a single prediction of vertical Federated Learning model, the interpretation results, namely the feature importance, are very likely to reveal the protected data from guest party. We propose a method to balance the model interpretability and data privacy in vertical Federated Learning by using Shapley values to reveal detailed feature importance for host features and a unified importance value for federated guest features. Our experiments indicate robust and informative results for interpreting Federated Learning models.