The major limitation to standard classification techniques is that the classifiers have to be trained on objects for which the ground truth, ACT-R contains a robust declarative memory module, which in terms of either a pre-assigned label or an error signal, is stores information as "chunks." A chunk in ACT-R may contain known. This limitation prevents the classifiers from dynamically any number of slots and values for those slots; slot values developing their own categories of classification based may be other chunks, numbers, strings, lists, or generally on information obtained from the environment. Previous attempts any data type allowed in Lisp (the base language for to overcome these limitations have been based on ACT-R). Retrieval from declarative memory is handled by a classical machine learning algorithms (Modayil and Kuipers request to the retrieval module; the request specifies the conditions 2007) (Kuipers et al. 2006). Here we present an alternative to be met in order for a chunk to be retrieved from approach to this problem, and develop the beginnings of declarative memory, and the module either returns a chunk a framework within which a classifier can evolve its own matching those specifications or generates a failure signal if representations based on dynamical information from the a retrieval cannot be made.

Versatile agents situated in rich, dynamic environments must It is not necessarily possible to select the source knowledge be capable of continually learning and refining their knowledge to transfer to a new target task by examining only the surface through experience. These agents will face a variety of similarities between the tasks. The selection must support learning tasks, and can transfer knowledge between tasks to the process of knowledge transfer by choosing source improve performance and accelerate learning. In this context, knowledge based on whether it will transfer well to the target a learning task can be as simple as discovering the effects task. In our previous work, we developed methods that of an operator on the environment, or as complex as accomplishing identify the source knowledge to transfer based on this concept a specific goal -- anything that can be learned of transferability to the target task. Intuitively, transferability can be considered a task. As the agent experiences and learns is the amount that the transferred information is a model for each task, it gains access to new data and knowledge.

Quality assurance remains a key topic in human computation research field. Prior work indicates independent agreement is effective for low difficulty tasks, but has limitations. This paper addresses this problem by proposing a tournament selection based quality control process. The experimental results from this paper show that the human are better at identifying the correct answers than producing them themselves.

Continual learning is the unending process of learning new things on top of what has already been learned (Ring, 1994).Temporal Transition Hierarchies (TTHs) were developed to allow prediction of Markov-k sequences in a way that was consistent with the needs of a continual-learning agent (Ring, 1993).However, the algorithm could not learn arbitrary temporal contingencies.This paper describes Recurrent Transition Hierarchies (RTH), a learning method that combines several properties desirable for agents that must learn as they go.In particular, it learns online and incrementally, autonomously discovering new features as learning progresses.It requires no reset or episodes.It has a simple learning rule with update complexity linear in the number of parameters.

In fact, goal-driven hierarchical structure to concatenate simple human behavior is mostly constituted by goal-directed motor acts. This hierarchical goal structure as well as the actions based on the synergic composition of simpler rules, which connect individual motor elements, might be motor constituents chained together according to a precise paralleled to the syntactic organization of language.

While microblogging has gained popularity on the Internet, analyzing and processing short messages has become a challenging task in natural language processing. This paper analyzes the differences between Internet short messages (or “microtext”) and general articles by comparing the Plurk Corpus and the Sinica Balanced Corpus. Likelihood ratio and the tóngyìcícílín thesaurus are adopted to analyze the lexical semantics of frequent terms in each corpus. Furthermore, the NTUSD sentiment dictionary is used to compare the sentiment distribution of the two corpora. The result is also applied to sentiment transition analysis.

Recognizing human activities from wearable sensor data is an important problem, particularly for health and eldercare applications. However, collecting sufficient labeled training data is challenging, especially since interpreting IMU traces is difficult for human annotators. Recently, crowdsourcing through services such as Amazon's Mechanical Turk has emerged as a promising alternative for annotating such data, with active learning serving as a natural method for affordably selecting an appropriate subset of instances to label. Unfortunately, since most active learning strategies are greedy methods that select the most uncertain sample, they are very sensitive to annotation errors (which corrupt a significant fraction of crowdsourced labels). This paper proposes methods for robust active learning under these conditions. Specifically, we make three contributions: 1) we obtain better initial labels by asking labelers to solve a related task; 2) we propose a new principled method for selecting instances in active learning that is more robust to annotation noise; 3) we estimate confidence scores for labels acquired from MTurk and ask workers to relabel samples that receive low scores under this metric. The proposed method is shown to significantly outperform existing techniques both under controlled noise conditions and in real active learning scenarios. The resulting method trains classifiers that are close in accuracy to those trained using ground-truth data.

In this paper, we study a time-critical facet of context-awareness: context transitions, which we model as changes in specific context types over time, e.g., activity or location. We present results from a user-centred field study involving participant interviews and motion data capture from two mobile device sensors: the accelerometer and magnetic field sensor. The results show how the participants subjectively interpret their daily context transitions with variable granularity, and a comparison of these context transitions with mobile device motion data shows how the motion data poorly reflect the identified transitions. The results imply that care should be taken when representing and modelling users’ subjective interpretations of context, as well as the objective nature of context sensors. Furthermore, processing and usability trade-offs should be made if real-time on-device transition detection is to be implemented.

Systems that find music recordings based on hummed or sung, melodic input are called Query-By-Humming (QBH) systems. Such systems employ search keys that are more similar to a cappella singing than the original recordings. Successful deployed systems use human computation to create these search keys: hand-entered MIDI melodies or recordings of a cappella singing. Tunebot is one such system. In this paper, we compare search results using keys built from two automated melody extraction system to those gathered using two populations of humans: local paid singers and Amazon Turk workers.

In this paper, we propose an innovative approach for the development of social collaboration argumentation systems. These systems enable a community to collaboratively create answers to questions where many possible answers, or nuanced perspectives on a single answer, can be posited. We examine the emergence of critical reasoning via crowdsourced structured discussions, which are built upon a graph-theoretic framework populated by atomic argumentation components. Finally, we address the design of the online community to best facilitate this interaction. Our main contribution is the rationale and design of the system, which can easily be extended to build a general eLearning framework.