0000000000828070
AUTHOR
Nicandro Cruz-ramírez
An Agents and Artifacts Approach to Distributed Data Mining
This paper proposes a novel Distributed Data Mining (DDM) approach based on the Agents and Artifacts paradigm, as implemented in CArtAgO [9], where artifacts encapsulate data mining tools, inherited from Weka, that agents can use while engaged in collaborative, distributed learning processes. Target hypothesis are currently constrained to decision trees built with J48, but the approach is flexible enough to allow different kinds of learning models. The twofold contribution of this work includes: i) JaCA-DDM: an extensible tool implemented in the agent oriented programming language Jason [2] and CArtAgO [10,9] to experiment DDM agent-based approaches on different, well known training sets. A…
Towards an Agent-Based Model for the Analysis of Macroeconomic Signals
This work introduces an agent-based model for the analysis of macroeconomic signals. The Bottom-up Adaptive Model (BAM) deploys a closed Walrasian economy where three types of agents (households, firms and banks) interact in three markets (goods, labor and credit) producing some signals of interest, e.g., unemployment rate, GDP, inflation, wealth distribution, etc. Agents are bounded rational, i.e., their behavior is defined in terms of simple rules finitely searching for the best salary, the best price, and the lowest interest rate in the corresponding markets, under incomplete information. The markets define fixed protocols of interaction adopted by the agents. The observed signals are em…
A Windowing strategy for Distributed Data Mining optimized through GPUs
Abstract This paper introduces an optimized Windowing based strategy for inducing decision trees in Distributed Data Mining scenarios. Windowing consists in selecting a sample of the available training examples (the window) to induce a decision tree with an usual algorithm, e.g., J48; finding instances not covered by this tree (counter examples) in the remaining training examples, adding them to the window to induce a new tree; and repeating until a termination criterion is met. In this way, the number of training examples required to induce the tree is reduced considerably, while maintaining the expected accuracy levels; which is paid in terms of time performance. Our proposed enhancements…