Strategic health information management and forecast: the birdwatching approach
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part III
| Hi-index | 0.00 |
The main question we ask is how a common language might come about in complex adaptive language systems comprising many agents. Our primary objective is to analyze and design complex language models so that a group of agents can converge on a common language from their initially different languages by using reinforcement learning, a minimal information approach. Towards this end, we present a game-based self-organizing language framework, and study three important cases of reaching linguistic consensus: word consensus, coherent communication, and grammar consensus.The study of word consensus concerns how agents can converge to a common word to reliably express a single shared meaning, out of a number of different words. We have proposed a win-stay lose-shift learning model, and have shown by computer simulation and mathematical analysis the conditions under which the agents in the model can converge to a common word.The study of coherent communication concerns how agents can converge on a communication system in which the word used by a sender to represent some meaning can be interpreted correctly by a receiver to extract the same meaning. We have proposed a minimum reinforcement learning model comprising two agents (a sender and a receiver), and have shown by computer simulation and mathematical analysis the conditions under which agents in the model can converge to a coherent communication system.The study of grammar consensus concerns how agents can converge to a common grammar. In the converged state, the sentences generated by one agent using his grammar can be recognized by another agent using her grammar. We have proposed a mutual perceptron learning model in which grammars are modeled as Boolean functions that can be used to classify or recognize Boolean instances (sentences), and have shown by mathematical analysis the conditions under which agents in this model can converge to a common grammar (i.e., a common Boolean function).This work has important implications for many kinds of distributed semantic systems, such as shared web ontologies, agent communication protocols, collaborative tagging, database schema integration, and biological networks.