Rule-Based Reasoning
An AI Framework for the Automatic Assessment of e-Government Forms
Chun, Andy Hon Wai (City University of Hong Kong)
This article describes the architecture and AI technology behind an XML-based AI framework designed to streamline e-government form processing. The framework performs several crucial assessment and decision support functions, including workflow case assignment, automatic assessment, follow-up action generation, precedent case retrieval, and learning of current practices. To implement these services, several AI techniques were used, including rule-based processing, schema-based reasoning, AI clustering, case-based reasoning, data mining, and machine learning. The primary objective of using AI for e-government form processing is of course to provide faster and higher quality service as well as ensure that all forms are processed fairly and accurately. With AI, all relevant laws and regulations as well as current practices are guaranteed to be considered and followed. An AI framework has been used to implement an AI module for one of the busiest immigration agencies in the world.
Custom DU: A Web-Based Business User-Driven Automated Underwriting System
Krovvidy, Srinivas (Fannie Mae)
Custom DU is an automated underwriting system that enables mortgage lenders to build their own business rules that facilitate assessing borrower eligibility for different mortgage products. Developed by Fannie Mae, Custom DU has been used since 2004 by several lenders to automate the underwriting of numerous mortgage products. Custom DU uses rule specification language techniques and a web-based, user-friendly interface for implementing business rules that represent business policy. By means of the user interface, lenders can also customize their underwriting findings reports, test the rules that they have defined, and publish changes to business rules on a real-time basis, all without any software modifications. The user interface enforces structure and consistency, enabling business users to focus on their underwriting guidelines when converting their business policy to rules. Once lenders have created their rules, loans are routed to the appropriate rule sets, and customized, but consistent, results are always returned to the lender. Using Custom DU, lenders can create different rule sets for their products and assign them to different channels of the business, allowing for centralized control of underwriting policies and proceduresโeven if lenders have decentralized operations.
New probabilistic interest measures for association rules
Hahsler, Michael, Hornik, Kurt
Mining association rules is an important technique for discovering meaningful patterns in transaction databases. Many different measures of interestingness have been proposed for association rules. However, these measures fail to take the probabilistic properties of the mined data into account. In this paper, we start with presenting a simple probabilistic framework for transaction data which can be used to simulate transaction data when no associations are present. We use such data and a real-world database from a grocery outlet to explore the behavior of confidence and lift, two popular interest measures used for rule mining. The results show that confidence is systematically influenced by the frequency of the items in the left hand side of rules and that lift performs poorly to filter random noise in transaction data. Based on the probabilistic framework we develop two new interest measures, hyper-lift and hyper-confidence, which can be used to filter or order mined association rules. The new measures show significantly better performance than lift for applications where spurious rules are problematic.
Learning to Play Using Low-Complexity Rule-Based Policies: Illustrations through Ms. Pac-Man
In this article we propose a method that can deal with certain combinatorial reinforcement learning tasks. We demonstrate the approach in the popular Ms. Pac-Man game. We define a set of high-level observation and action modules, from which rule-based policies are constructed automatically. In these policies, actions are temporally extended, and may work concurrently. The policy of the agent is encoded by a compact decision list. The components of the list are selected from a large pool of rules, which can be either hand-crafted or generated automatically. A suitable selection of rules is learnt by the cross-entropy method, a recent global optimization algorithm that fits our framework smoothly. Cross-entropy-optimized policies perform better than our hand-crafted policy, and reach the score of average human players. We argue that learning is successful mainly because (i) policies may apply concurrent actions and thus the policy space is sufficiently rich, (ii) the search is biased towards low-complexity policies and therefore, solutions with a compact description can be found quickly if they exist.
Practical Approach to Knowledge-based Question Answering with Natural Language Understanding and Advanced Reasoning
This research hypothesized that a practical approach in the form of a solution framework known as Natural Language Understanding and Reasoning for Intelligence (NaLURI), which combines full-discourse natural language understanding, powerful representation formalism capable of exploiting ontological information and reasoning approach with advanced features, will solve the following problems without compromising practicality factors: 1) restriction on the nature of question and response, and 2) limitation to scale across domains and to real-life natural language text.
Learning Symbolic Models of Stochastic Domains
Pasula, H. M., Zettlemoyer, L. S., Kaelbling, L. P.
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a probabilistic, relational planning rule representation that compactly models noisy, nondeterministic action effects, and show how such rules can be effectively learned. Through experiments in simple planning domains and a 3D simulated blocks world with realistic physics, we demonstrate that this learning algorithm allows agents to effectively model world dynamics.
What Do We Know about Knowledge?
What Do We Know about Knowledge? In this article, I will examine the first of these questions. AI has been slow to embrace this principle. Programs demonstrating research ideas in AI are often too large and not well enough documented to allow replication or sharing. What I would like to in diverse conditions. I wish to clarify the knowledge example, it was pretty clearly articulated in Biblical principle and try to increase our understanding times: "A man of knowledge increaseth of what programmers and program strength" (Proverbs 24: 5). Greek philosophers based their lives on acquiring The "knowledge is power" principle is most and transferring knowledge. In the course closely associated with Francis Bacon, from his of teaching, they sought to understand the 1597 tract on heresies: "Nam et ipsa scientia nature of knowledge and how we can establish potestas est." ("In and of itself, knowledge is knowledge of the natural world. B," along with quantification, "All A's are B's," Euclid's geometry firmly established the concept In the intervening several centuries before Plato, Socrates's pupil and Aristotle's mentor, was the first to pose the question in writing of the Middle Ages and the rise of modern science what we mean when we say that a person in the West, He was distinguishing empirical knowledge, church to make new knowledge fit with established lacking complete certainty, from the certain dogma.
The Reaction RuleML Classification of the Event / Action / State Processing and Reasoning Space
Reaction RuleML is a general, practical, compact and user-friendly XML-serialized language for the family of reaction rules. In this white paper we give a review of the history of event / action /state processing and reaction rule approaches and systems in different domains, define basic concepts and give a classification of the event, action, state processing and reasoning space as well as a discussion of relevant / related work
Automating the Underwriting of Insurance Applications
Aggour, Kareem S., Bonissone, Piero P., Cheetham, William E., Messmer, Richard P.
An end-to-end system was created at Genworth Financial to automate the underwriting of long-term care (LTC) and life insurance applications. Relying heavily on artificial intelligence techniques, the system has been in production since December 2002 and in 2004 completely automates the underwriting of 19 percent of the LTC applications. A fuzzy logic rules engine encodes the underwriter guidelines and an evolutionary algorithm optimizes the engine's performance. Finally, a natural language parser is used to improve the coverage of the underwriting system.
NESTA: NASA Engineering Shuttle Telemetry Agent
Semmel, Glenn S., Davis, Steven R., Leucht, Kurt W., Rowe, Dan A., Smith, Kevin E., O', Farrel, Ryan l, Boloni, Ladislau
The Electrical Systems Division at the NASA Kennedy Space Center has developed and deployed an agent-based tool to monitor the space shuttle's ground processing telemetry stream. The application, the NASA Engineering Shuttle Telemetry Agent (NESTA), increases situational awareness for system and hardware engineers during ground processing of the shuttle's subsystems. The agent provides autonomous monitoring of the telemetry stream and automatically alerts system engineers when predefined criteria have been met. Efficiency and safety are improved through increased automation. Sandia National Labs' Java Expert System Shell is employed as the rule engine. The shell's predicate logic lends itself well to capturing the heuristics and specifying the engineering rules of this spaceport domain. The declarative paradigm of the rule- based agent yields a highly modular and scalable design spanning multiple subsystems of the shuttle. Several hundred monitoring rules have been written thus far with corresponding notifications sent to shuttle engineers. This article discusses the rule-based telemetry agent used for space shuttle ground processing and explains the problem domain, development of the agent software, benefits of AI technology, and deployment and sustaining engineering of the product.