Intelligent diagnosis of sleep apnea syndrome.
Explore the source record for details and available documents.
Artificial Intelligence↗
SEARCH · Search PubMed
Results for “decision intelligence”
Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Association rule discovery with the train and test approach for heart disease prediction.
Association rules represent a promising technique to improve heart disease prediction. Unfortunately, when association rules are applied on a medical data set, they produce an extremely large number of rules. Most of such rules are medically irrelevant and the time required to find them can be impractical. A more important issue is that, in general, association rules are mined on the entire data set without validation on an independent sample. To solve these limitations, we introduce an algorithm that uses search constraints to reduce the number of rules, searches for association rules on a training set, and finally validates them on an independent test set. The medical significance of discovered rules is evaluated with support, confidence, and lift. Association rules are applied on a real data set containing medical records of patients with heart disease. In medical terms, association rules relate heart perfusion measurements and risk factors to the degree of disease in four specific arteries. Search constraints and test set validation significantly reduce the number of association rules and produce a set of rules with high predictive accuracy. We exhibit important rules with high confidence, high lift, or both, that remain valid on the test set on several runs. These rules represent valuable medical knowledge.
Algorithms↗
A model to predict accommodations needed by disabled persons.
In this paper, several approaches to assist employers in the accommodation process for disabled employees are discussed and a mathematical model is proposed to assist employers in predicting the accommodation level needed by an individual with a mobility-related disability. This study investigates the validity and reliability of this model in assessing the accommodation level needed by individuals utilizing data collected from twelve individuals with mobility-related disabilities. Based on the results of the statistical analyses, this proposed model produces a feasible preliminary measure for assessing the accommodation level needed for persons with mobility-related disabilities. Suggestions for practical application of this model in an industrial setting are addressed.
Adult↗
Incremental multiple objective genetic algorithms.
This paper presents a new genetic algorithm approach to multiobjective optimization problems--incremental multiple objective genetic algorithms (IMOGA). Different from conventional MOGA methods, it takes each objective into consideration incrementally. The whole evolution is divided into as many phases as the number of objectives, and one more objective is considered in each phase. Each phase is composed of two stages. First, an independent population is evolved to optimize one specific objective. Second, the better-performing individuals from the single-objecive population evolved in the above stage and the multiobjective population evolved in the last phase are joined together by the operation of integration. The resulting population then becomes an initial multiobjective population, to which a multiobjective evolution based on the incremented objective set is applied. The experiment results show that, in most problems, the performance of IMOGA is better than that of three other MOGAs, NSGA-II, SPEA, and PAES. IMOGA can find more solutions during the same time span, and the quality of solutions is better.
Algorithms↗
On a multimode test sequencing problem.
Test sequencing is a binary identification problem wherein one needs to develop a minimal expected cost test procedure to determine which one of a finite number of possible failure states, if any, is present. In this paper, we consider a multimode test sequencing (MMTS) problem, in which tests are distributed among multiple modes and additional transition costs will be incurred if a test sequence involves mode changes. The multimode test sequencing problem can be solved optimally via dynamic programming or AND/OR graph search methods. However, for large systems, the associated computation with dynamic programming or AND/OR graph search methods is substantial due to the rapidly increasing number of OR nodes (denoting ambiguity states and current modes) and AND nodes (denoting next modes and tests) in the search graph. In order to overcome the computational explosion, we propose to apply three heuristic algorithms based on information gain: information gain heuristic (IG), mode capability evaluation (MC), and mode capability evaluation with limited exploration of depth and degree of mode Isolation (MCLEI). We also propose to apply rollout strategies, which are guaranteed to improve the performance of heuristics, as long as the heuristics are sequentially improving. We show computational results, which suggest that the information-heuristic based rollout policies are significantly better than traditional information gain heuristic. We also show that among the three information heuristics proposed, MCLEI achieves the best tradeoff between optimality and computational complexity.
Algorithms↗
Handling interaction in fuzzy production rule reasoning.
When fuzzy production rules are used to approximate reasoning, interaction exists among rules that have the same consequent. Due to this interaction, the weighted average model frequently used in approximate reasoning does not work well in many real-world problems. In order to model and handle this interaction, this paper proposes to use a nonadditive nonnegative set function to replace the weights assigned to rules having the same consequent, and to draw the reasoning conclusion based on an integral with respect to the nonadditive nonnegative set function, rather than on the weighted average model. Handling interaction in fuzzy production rule reasoning in this way can lead to a good understanding of the rules base and an improvement of reasoning accuracy. This paper also investigates how to determine from data the nonadditive set function that cannot be specified by a domain expert.
Algorithms↗
Cumulative distribution functions from Dempster-Shafer belief structures.
We discuss the Dempster-Shafer belief structure. We introduce the idea of a cumulative distribution induced by a Dempster-Shafer belief structure. We call these belief-cumulative distribution (B-CDs) functions. We study the properties of these distribution functions and show that they are interval functions. We investigate the possibility of using these distribution functions as a tool for knowledge representation.
Algorithms↗
Diagnosis of complex systems: bridging the methodologies of the FDI and DX communities.
Explore the source record for details and available documents.
Artificial Intelligence↗
Conflicts versus analytical redundancy relations: a comparative analysis of the model based diagnosis approach from the artificial intelligence and automatic control perspectives.
Two distinct and parallel research communities have been working along the lines of the model-based diagnosis approach: the fault detection and isolation (FDI) community and the diagnostic (DX) community that have evolved in the fields of automatic control and artificial intelligence, respectively. This paper clarifies and links the concepts and assumptions that underlie the FDI analytical redundancy approach and the DX consistency-based logical approach. A formal framework is proposed in order to compare the two approaches and the theoretical proof of their equivalence together with the necessary and sufficient conditions is provided.
Algorithms↗
Boundary following and globally convergent path planning using instant goals.
In this paper, an Instant Goal approach is proposed for collision-free boundary following of obstacles of arbitrary shape and globally convergent path planning in unknown environments. Firstly, for effective knowledge representation and manipulation, a vector representation is presented, which not only saves much space but also conforms to the physical properties of range sensors. Secondly, the concept of Instant Goals is introduced enabling the robot to perform boundary following in a "natural" human-like manner, with additional measures taken to ensure that the robot is moving "forward" along the boundary, even if the obstacle is of arbitrary shape and disturbing obstacles are present. Collision checking is performed simultaneously and, when needed, collision avoidance is efficiently incorporated in. Based on the approach of boundary following, a realistic sensor-based path planner with global convergence property is designed for the robot capable of acquiring discrete and noisy range data. Realistic simulation experiments validate the effectiveness of the proposed approaches.
Algorithms↗
Line of sight robot navigation toward a moving goal.
In this paper, we consider the problem of robot tracking and navigation toward a moving goal. The goal's maneuvers are not a priori known to the robot. Thus, off-line strategies are not effective. To model the robot and the goal, we use geometric rules combined with kinematics equations expressed in a polar representation. The intent of the strategy is to keep the robot between a reference point, called the observer, and the goal. We prove under certain assumptions that the robot navigating using this strategy reaches the moving goal successfully. In the presence of obstacles, the method is combined with an obstacle avoidance algorithm. The robot then moves in two modes, the navigation mode and the obstacle avoidance mode. Simulation of various scenarios highlights the efficiency of the method and provides an instructive comparison between the paths obtained for different reference points.
Algorithms↗
Artificial intelligence in medicine: the challenges ahead.
The modern study of artificial intelligence in medicine (AIM) is 25 years old. Throughout this period, the field has attracted many of the best computer scientists, and their work represents a remarkable achievement. However, AIM has not been successful-if success is judged as making an impact on the practice of medicine. Much recent work in AIM has been focused inward, addressing problems that are at the crossroads of the parent disciplines of medicine and artificial intelligence. Now, AIM must move forward with the insights that it has gained and focus on finding solutions for problems at the heart of medical practice. The growing emphasis within medicine on evidence-based practice should provide the right environment for that change.
Artificial Intelligence↗
AIM: quo vadis?
Explore the source record for details and available documents.
Artificial Intelligence↗
From data to knowledge through concept-oriented terminologies: experience with the Medical Entities Dictionary.
Knowledge representation involves enumeration of conceptual symbols and arrangement of these symbols into some meaningful structure. Medical knowledge representation has traditionally focused more on the structure than the symbols. Several significant efforts are under way, at local, national, and international levels, to address the representation of the symbols though the creation of high-quality terminologies that are themselves knowledge based. This paper reviews these efforts, including the Medical Entities Dictionary (MED) in use at Columbia University and the New York Presbyterian Hospital. A decade's experience with the MED is summarized to serve as a proof-of-concept that knowledge-based terminologies can support the use of coded patient data for a variety of knowledge-based activities, including the improved understanding of patient data, the access of information sources relevant to specific patient care problems, the application of expert systems directly to the care of patients, and the discovery of new medical knowledge. The terminological knowledge in the MED has also been used successfully to support clinical application development and maintenance, including that of the MED itself. On the basis of this experience, current efforts to create standard knowledge-based terminologies appear to be justified.
Artificial Intelligence↗
Computerized extraction of coded findings from free-text radiologic reports. Work in progress.
A computerized data acquisition tool, the special purpose radiology understanding system (SPRUS), has been implemented as a module in the Health Evaluation through Logical Processing Hospital Information System. This tool uses semantic information from a diagnostic expert system to parse free-text radiology reports and to extract and encode both the findings and the radiologists' interpretations. These coded findings and interpretations are then stored in a clinical data base. The system recognizes both radiologic findings and diagnostic interpretations. Initial tests showed a true-positive rate of 87% for radiographic findings and a bad data rate of 5%. Diagnostic interpretations are recognized at a rate of 95% with a bad data rate of 6%. Testing suggests that these rates can be improved through enhancements to the system's thesaurus and the computerized medical knowledge that drives it. This system holds promise as a tool to obtain coded radiologic data for research, medical audit, and patient care.
Artificial Intelligence↗
On 'natural' learning and pruning in multi-layered perceptrons.
Several studies have shown that natural gradient descent for on-line learning is much more efficient than standard gradient descent. In this article, we derive natural gradients in a slightly different manner and discuss implications for batch-mode learning and pruning, linking them to existing algorithms such as Levenberg-Marquardt optimization and optimal brain surgeon. The Fisher matrix plays an important role in all these algorithms. The second half of the article discusses a layered approximation of the Fisher matrix specific to multilayered perceptrons. Using this approximation rather than the exact Fisher matrix, we arrive at much faster "natural" learning algorithms and more robust pruning procedures.
Algorithms↗
A new approach to the extraction of ANN rules and to their generalization capacity through GP.
Various techniques for the extraction of ANN rules have been used, but most of them have focused on certain types of networks and their training. There are very few methods that deal with ANN rule extraction as systems that are independent of their architecture, training, and internal distribution of weights, connections, and activation functions. This article proposes a methodology for the extraction of ANN rules, regardless of their architecture, and based on genetic programming. The strategy is based on the previous algorithm and aims at achieving the generalization capacity that is characteristic of ANNs by means of symbolic rules that are understandable to human beings.
Algorithms↗
Learning to solve planning problems efficiently by means of genetic programming.
Declarative problem solving, such as planning, poses interesting challenges for Genetic Programming (GP). There have been recent attempts to apply GP to planning that fit two approaches: (a) using GP to search in plan space or (b) to evolve a planner. In this article, we propose to evolve only the heuristics to make a particular planner more efficient. This approach is more feasible than (b) because it does not have to build a planner from scratch but can take advantage of already existing planning systems. It is also more efficient than (a) because once the heuristics have been evolved, they can be used to solve a whole class of different planning problems in a planning domain, instead of running GP for every new planning problem. Empirical results show that our approach (EvoCK) is able to evolve heuristics in two planning domains (the blocks world and the logistics domain) that improve PRODIGY4.0 performance. Additionally, we experiment with a new genetic operator --Instance-Based Crossover--that is able to use traces of the base planner as raw genetic material to be injected into the evolving population.
Algorithms↗