Sciweavers

FLAIRS
2010
13 years 10 months ago
CsMTL MLP For WEKA: Neural Network Learning with Inductive Transfer
We present context-sensitive Multiple Task Learning, or csMTL as a method of inductive transfer. It uses additional contextual inputs along with other input features when learning ...
Liangliang Tu, Benjamin Fowler, Daniel L. Silver
FLAIRS
2010
13 years 10 months ago
Correlating Shape and Functional Properties Using Decomposition Approaches
In this paper, we propose the application of standard decomposition approaches to find local correlations in multimodal data. In a test scenario, we apply these methods to correla...
Daniel Dornbusch, Robert Haschke, Stefan Menzel, H...
FLAIRS
2010
13 years 10 months ago
The Readability of Helpful Product Reviews
Consumers frequently rely on user-generated product reviews to guide purchasing decisions. Given the everincreasing volume of such reviews and variations in review quality, consum...
Michael P. O'Mahony, Barry Smyth
FLAIRS
2010
13 years 10 months ago
Grounded Event-Based and Modal Representations for Objects, Relations, Beliefs, Etc.
Intelligent software agents (agents) adhering to the action selection paradigm have only one primary task that they need accomplish at any given time: to choose their next action....
Ryan James McCall, Stan Franklin, David Friedlande...
FLAIRS
2010
13 years 10 months ago
Commonsense Inference in Dynamic Spatial Systems: Epistemological Requirements
We demonstrate the role of commonsense inference toward the modeling of qualitative notions of space and spatial change within a dynamic setup. The inference patterns are connecte...
Mehul Bhatt
FLAIRS
2010
13 years 10 months ago
Using a Graph-Based Approach for Discovering Cybercrime
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
William Eberle, Lawrence B. Holder, Jeffrey Graves
AIPS
2010
13 years 10 months ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
AIPS
2010
13 years 10 months ago
Computing Applicability Conditions for Plans with Loops
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
AIPS
2010
13 years 10 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill