ConferenceProceedings of Machine Learning Research · January 1, 2025
Adverse drug events (ADEs) cost society lives and an estimated $30 billion per year in the USA alone. Their prevalence has led to the public losing trust in the safety of drugs, especially generics (e.g., Eban, 2019). These concerns have motivated the wide ...
Cite
ConferenceProceedings IEEE Conference on Safe and Trustworthy Machine Learning Satml 2024 · January 1, 2024
Patient privacy is a major barrier to healthcare AI. For confidentiality reasons, most patient data remains in silo in separate hospitals, preventing the design of data-driven healthcare AI systems that need large volumes of patient data to make effective ...
Full textCite
ConferenceProceedings of Machine Learning Research · January 1, 2024
In the era of Large Language Models (LLMs), given their remarkable text understanding and generation abilities, there is an unprecedented opportunity to develop new, LLM-based methods for trustworthy medical knowledge synthesis, extraction, and summarizati ...
Cite
ConferenceAdv Neural Inf Process Syst · 2024
Deep neural networks (DNNs) lack the precise semantics and definitive probabilistic interpretation of probabilistic graphical models (PGMs). In this paper, we propose an innovative solution by constructing infinite tree-structured PGMs that correspond exac ...
Link to itemCite
ConferenceProceedings of Machine Learning Research · January 1, 2023
Our goal is to produce methods for observational causal inference that are auditable, easy to troubleshoot, accurate for treatment effect estimation, and scalable to high-dimensional data. We describe a general framework called Model-to-Match that achieves ...
Cite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2021
Most approaches for predicting drug-drug interactions (DDIs) have focused on text. We present the first work that uses multiple drug structure data - images, string representations and relationship representations. We exploit the recent advances in deep ne ...
Full textCite
ConferenceProc ACM Conf Health Inference Learn (2020) · April 2020
Adverse drug reactions (ADRs) are detrimental and unexpected clinical incidents caused by drug intake. The increasing availability of massive quantities of longitudinal event data such as electronic health records (EHRs) has redefined ADR discovery as a bi ...
Full textLink to itemCite
ConferenceWsdm 2020 Proceedings of the 13th International Conference on Web Search and Data Mining · January 20, 2020
Entity matching seeks to identify data records over one or multiple data sources that refer to the same real-world entity. Virtually every entity matching task on large datasets requires blocking, a step that reduces the number of record pairs to be matche ...
Full textCite
Conference37th International Conference on Machine Learning Icml 2020 · January 1, 2020
We study the problem of learning Granger causality between event types from asynchronous, interdependent, multi-Type event sequences. Existing work suffers from either limited model flexibility or poor model explainability and thus fails to uncover Granger ...
Cite
Conference · July 1, 2019
The area under the receiver operating characteristic curve (AUC) is arguably the most common metric in machine learning for assessing the quality of a two-class classification model. As the number and complexity of machine learning applications grows, so t ...
Link to itemCite
Conference36th International Conference on Machine Learning Icml 2019 · January 1, 2019
The area under the receiver operating characteristic curve (AUC) is arguably the most common metric in machine learning for assessing the quality of a two-class classification model. As the number and complexity of machine learning applications grows, so t ...
Cite
ConferenceProc Int Conf Mach Learn Appl · December 2018
There is great interest in methods to improve human insight into trained non-linear models. Leading approaches include producing a ranking of the most relevant features, a non-trivial task for non-linear models. We show theoretically and empirically the be ...
Full textLink to itemCite
ConferenceUncertain Artif Intell · August 2018
We study the L 1-regularized maximum likelihood estimator/estimation (MLE) problemfor discrete Markov random fields (MRFs), where efficient and scalable learning requires both sparse regularization and approximate inference. To address these challenges, we ...
Link to itemCite
ConferenceProc SPIE Int Soc Opt Eng · February 2018
Improved prediction of the "most harmful" breast cancers that cause the most substantive morbidity and mortality would enable physicians to target more intense screening and preventive measures at those women who have the highest risk; however, such predic ...
Full textLink to itemCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2018
Linear regression with 2-norm regularization (i.e., ridge regression) is an important statistical technique that models the relationship between some explanatory values and an outcome value using a linear function. In many applications (e.g., predictive mo ...
Full textCite
ConferenceProceedings of Machine Learning Research · January 1, 2018
Learning the structure of a dynamic Bayesian network (DBN) is a common way of discovering causal relationships in time series data. However, the combinatorial nature of DBN structure learning limits the accuracy and scalability of DBN modeling. We propose ...
Cite
ConferenceProceedings of Machine Learning Research · January 1, 2018
We propose temporal Poisson square root graphical models (TPSQRs), a generalization of Poisson square root graphical models (PSQRs) specifically designed for modeling longitudinal event data. By estimating the temporal relationships for all possible pairs ...
Cite
ConferenceProceedings 2017 IEEE International Conference on Healthcare Informatics Ichi 2017 · September 8, 2017
Electronic health records (EHRs) represent an underused data source that has great research and clinical potential. Our goal was to quantify the value of EHRs in breast cancer risk prediction. We conducted a retrospective case-control study, gathering pati ...
Full textCite
ConferenceKDD · August 2017
Several prominent public health hazards [29] that occurred at the beginning of this century due to adverse drug events (ADEs) have raised international awareness of governments and industries about pharmacovigilance (PhV) [6,7], the science and activities ...
Full textLink to itemCite
ConferenceProceedings 2017 IEEE International Conference on Big Data Big Data 2017 · July 1, 2017
Every single day, a massive amount of text data is generated by different medical data sources, such as scientific literature, medical web pages, health-related social media, clinical notes, and drug reviews. Processing this wealth of data is indeed a daun ...
Full textCite
ConferenceArtif Intell Med Conf Artif Intell Med (2005-) · June 2017
Parkinson's, a progressive neural disorder, is difficult to identify due to the hidden nature of the symptoms associated. We present a machine learning approach that uses a definite set of features obtained from the Parkinsons Progression Markers Initiativ ...
Full textLink to itemCite
ConferenceAdvances in Neural Information Processing Systems · January 1, 2017
We discover a screening rule for â„“1-regularized Ising model estimation. The simple closed-form screening rule is a necessary and sufficient condition for exactly recovering the blockwise structure of a solution under any given regularization par ...
Cite
ConferenceKDD · August 2016
Computational Drug Repositioning (CDR) is the task of discovering potential new indications for existing drugs by mining large-scale heterogeneous drug-related data sources. Leveraging the patient-level temporal ordering information between numeric physiol ...
Full textLink to itemCite
ConferenceIJCAI (U S) · July 2016
Computational Drug Repositioning (CDR) is the knowledge discovery process of finding new indications for existing drugs leveraging heterogeneous drug-related data. Longitudinal observational data such as Electronic Health Records (EHRs) have become an emer ...
Link to itemCite
ConferenceAisec 2015 Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security Co Located with Ccs 2015 · October 16, 2015
In the last several years, differential privacy has become the leading framework for private data analysis. It provides bounds on the amount that a randomized function can change as the result of a modification to one record of a database. This requirement ...
Full textCite
ConferenceAisec 2015 Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security Co Located with Ccs 2015 · October 16, 2015
Differential privacy provides powerful guarantees that individuals incur minimal additional risk by including their personal data in a database. Most work in differential privacy has focused on differentially private algorithms that produce models, counts, ...
Full textCite
ConferenceProceedings of the National Conference on Artificial Intelligence · June 1, 2015
Applications of graphical models often require the use of approximate inference, such as sequential importance sampling (SIS), for estimation of the model distribution given partial evidence, i.e., the target distribution. However, when SIS proposal and ta ...
Cite
ConferenceArtif Intell Med Conf Artif Intell Med (2005-) · 2015
Adverse drug events (ADEs) are a major concern and point of emphasis for the medical profession, government, and society in general. When methods extract ADEs from observational data, there is a necessity to evaluate these methods. More precisely, it is im ...
Full textLink to itemCite
ConferenceProgress in Biomedical Optics and Imaging Proceedings of SPIE · January 1, 2015
Combining imaging and genetic information to predict disease presence and behavior is being codified into an emerging discipline called "radiogenomics." Optimal evaluation methodologies for radiogenomics techniques have not been established. We aim to deve ...
Full textCite
ConferenceProceedings of the VLDB Endowment · November 1, 2014
learning technique that learns first-order rules from relationalstructured data. However, to-date most ILP systems can only be applied to small datasets (tens of thousands of examples). A long-standing challenge in the field is to scale ILP methods to larg ...
Full textCite
ConferenceJMLR Workshop Conf Proc · 2014
Hidden Markov random fields (HMRFs) are conventionally assumed to be homogeneous in the sense that the potential functions are invariant across different sites. However in some biological applications, it is desirable to make HMRFs heterogeneous, especiall ...
Link to itemCite
Conference31st International Conference on Machine Learning Icml 2014 · January 1, 2014
It has been shown that graphical models can be used to leverage the dependence in large- scale multiple testing problems with significantly improved performance (Sun & Cai, 2009; Liu et al., 2012). These graphical models are fully parametric and require th ...
Cite
ConferenceMach Learn Knowl Discov Databases · 2014
Machine learning is continually being applied to a growing set of fields, including the social sciences, business, and medicine. Some fields present problems that are not easily addressed using standard machine learning approaches and, in particular, there ...
Full textLink to itemCite
ConferenceProceedings of the 23rd Usenix Security Symposium · January 1, 2014
We initiate the study of privacy in pharmacogenetics, wherein machine learning models are used to guide medical treatments based on a patient's genotype and background. Performing an in-depth case study on privacy in personalized warfarin dosing, we show t ...
Cite
ConferenceAdv Neural Inf Process Syst · December 5, 2013
In large-scale applications of undirected graphical models, such as social networks and biological networks, similar patterns occur frequently and give rise to similar parameters. In this situation, it is beneficial to group the parameters for more efficie ...
Link to itemCite
ConferenceAaai Workshop Technical Report · January 1, 2013
Adverse drug events are a leading cause of danger and cost in health care. We could reduce both the danger and the cost if we had accurate models to predict, at prescription time for each drug, which patients are most at risk for known adverse reactions to ...
Cite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2013
Accurate prediction of future onset of disease from Electronic Health Records (EHRs) has important clinical and economic implications. In this domain the arrival of data comes at semi-irregular intervals and makes the prediction task challenging. We propos ...
Full textCite
ConferenceMach Learn Knowl Discov Databases · 2013
We introduce Score As You Lift (SAYL), a novel Statistical Relational Learning (SRL) algorithm, and apply it to an important task in the diagnosis of breast cancer. SAYL combines SRL with the marketing concept of uplift modeling, uses the area under the up ...
Full textLink to itemCite
ConferenceAaai Workshop Technical Report · January 1, 2013
When observations are incomplete or data are missing, approximate inference methods based on importance sampling are often used. Unfortunately, when the target and proposal distributions are dissimilar, the sampling procedure leads to biased estimates or r ...
Cite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2013
The area under the precision-recall curve (AUCPR) is a single number summary of the information in the precision-recall (PR) curve. Similar to the receiver operating characteristic curve, the PR curve has its own unique properties that make estimating its ...
Full textCite
ConferenceAdvances in Neural Information Processing Systems · December 1, 2012
Learning temporal dependencies between variables over continuous time is an important and challenging task. Continuous-time Bayesian networks effectively model such processes but are limited by the number of conditional intensity matrices, which grows expo ...
Cite
Conference2012 ACM Conference on Bioinformatics Computational Biology and Biomedicine Bcb 2012 · November 26, 2012
Genome-wide association studies (GWAS) analyze genetic variation (SNPs) across the entire human genome, searching for SNPs that are associated with certain phenotypes, most often diseases, such as breast cancer. In GWAS, we seek a ranking of SNPs in terms ...
Full textCite
ConferenceProceedings of the National Conference on Artificial Intelligence · November 7, 2012
The pharmaceutical industry, consumer protection groups, users of medications and government oversight agencies are all strongly interested in identifying adverse reactions to drugs. While a clinical trial of a drug may use only a thousand patients, once a ...
Cite
ConferenceProceedings of the 29th International Conference on Machine Learning Icml 2012 · October 10, 2012
Precision-recall (PR) curves and the areas under them are widely used to summarize machine learning results, especially for data sets exhibiting class skew. They are often used analogously to ROC curves and the area under ROC curves. It is known that PR cu ...
Cite
ConferenceJMLR Workshop Conf Proc · 2012
Feature screening is a useful feature selection approach for high-dimensional data when the goal is to identify all the features relevant to the response variable. However, common feature screening methods do not take into account the correlation structure ...
Link to itemCite
ConferenceUncertain Artif Intell · 2012
Large-scale multiple testing tasks often exhibit dependence, and leveraging the dependence between individual tests is still one challenging and important problem in statistics. With recent advances in graphical models, it is feasible to use them to perfor ...
Link to itemCite
ConferenceProc Innov Appl Artif Intell Conf · 2012
Electronic health records (EHRs) are an emerging relational domain with large potential to improve clinical outcomes. We apply two statistical relational learning (SRL) algorithms to the task of predicting primary myocardial infarction. We show that one SR ...
Link to itemCite
ConferenceProc Int Conf Mach Learn · 2012
Learning from electronic medical records (EMR) is challenging due to their relational nature and the uncertain dependence between a patient's past and future health status. Statistical relational learning is a natural fit for analyzing EMRs but is less ade ...
Link to itemCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2012
A typical classification problem involves building a model to correctly segregate instances of two or more classes. Such a model exhibits differential prediction with respect to given data subsets when its performance is significantly different over these ...
Full textCite
ConferenceAnnu Int Conf IEEE Eng Med Biol Soc · 2012
Electronic Health Records (EHR) contain large amounts of useful information that could potentially be used for building models for predicting onset of diseases. In this study, we have investigated the use of free-text and coded data in Marshfield Clinic's ...
Full textLink to itemCite
ConferenceProceedings of the 26th Aaai Conference on Artificial Intelligence Aaai 2012 · January 1, 2012
The pharmaceutical industry, consumer protection groups, users of medications and government oversight agencies are all strongly interested in identifying adverse reactions to drugs. While a clinical trial of a drug may use only a thousand patients, once a ...
Cite
ConferenceKcap 2011 Proceedings of the 2011 Knowledge Capture Conference · June 26, 2011
Some supervised-learning algorithms can make effective use of domain knowledge in addition to the input-output pairs commonly used in machine learning. However, formulating this additional information often requires an in-depth understanding of the specifi ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2011
Inductive Logic Programming (ILP) provides an effective method of learning logical theories given a set of positive examples, a set of negative examples, a corpus of background knowledge, and specification of a search space (e.g., via mode definitions) fro ...
Full textCite
ConferenceIhi 10 Proceedings of the 1st ACM International Health Informatics Symposium · December 1, 2010
Breast cancer is the most common type of cancer among women. Current clinical breast cancer diagnosis involves a biopsy, which is a costly, invasive and potentially painful procedure. Some researchers proposed models, based on mammography features and pers ...
Full textCite
ConferenceInductive Log Program · 2010
Hexoses are simple sugars that play a key role in many cellular pathways, and in the regulation of development and disease mechanisms. Current protein-sugar computational models are based, at least partially, on prior biochemical findings and knowledge. Th ...
Full textLink to itemCite
ConferenceProc IEEE Int Conf Data Min · 2009
Breast cancer is the leading cause of cancer mortality in women between the ages of 15 and 54. During mammography screening, radiologists use a strict lexicon (BI-RADS) to describe and report their findings. Mammography records are then stored in a well-de ...
Full textLink to itemCite
ConferenceIjcai International Joint Conference on Artificial Intelligence · December 1, 2007
Statistical relational learning (SRL) algorithms learn statistical models from relational data, such as that stored in a relational database. We previously introduced view learning for SRL, in which the view of a relational database can be automatically mo ...
Cite
ConferenceProceedings of the 23rd Conference on Uncertainty in Artificial Intelligence Uai 2007 · December 1, 2007
Searching the complete space of possible Bayesian networks is intractable for problems of interesting size, so Bayesian network structure learning algorithms, such as the commonly used Sparse Candidate algorithm, employ heuristics. However, these heuristic ...
Cite
ConferenceACM International Conference Proceeding Series · August 23, 2007
We present a new machine learning approach for 3D-QSAR, the task of predicting binding affinities of molecules to target proteins based on 3D structure. Our approach predicts binding affinity by using regression on substructures discovered by relational le ...
Full textCite
ConferenceBioinformatics · July 1, 2007
MOTIVATION: This article presents a method to identify the isotopic distributions within a mass spectrum using a probabilistic classifier supplemented with dynamic programming. Such a system is needed for a variety of purposes, including generating robust ...
Full textLink to itemCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2007
One promising family of search strategies to alleviate runtime and storage requirements of ILP systems is that of stochastic local search methods, which have been successfully applied to hard propositional tasks such as satisfiability. Stochastic local sea ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2007
Determining the underlying regulatory mechanism of genetic networks is one of the central challenges of computational biology. Numerous methods have been developed and applied to the important but complex task of reverse engineering regulatory networks fro ...
Full textCite
ConferenceMachine Learning · September 1, 2006
Three-dimensional models, or pharmacophores, describing Euclidean constraints on the location on small molecules of functional groups (like hydrophobic groups, hydrogen acceptors and donors, etc.), are often used in drug design to describe the medicinal ac ...
Full textCite
ConferenceMachine Learning · September 1, 2006
Recent statistical performance studies of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. Specifically, it has been found that if the search cost distribution of the n ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2006
Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search misses useful refinements that yield a significant gain only in conjunction with other co ...
Full textCite
ConferencePac Symp Biocomput · 2006
Bayesian networks (BNs) and dynamic Bayesian networks (DBNs) are becoming more widely used as a way to learn various types of networks, including cellular signaling networks, from high-throughput data. Due to the high cost of performing experiments, we are ...
Link to itemCite
ConferenceIjcai International Joint Conference on Artificial Intelligence · December 1, 2005
Statistical relational learning (SRL) constructs probabilistic models from relational databases. A key capability of SRL is the learning of arcs (in the Bayes net sense) connecting entries in different rows of a relational table, or in different tables. Ne ...
Cite
ConferenceProceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · December 1, 2005
This paper asks whether susceptibility to early-onset (diagnosis before age '10) of a particularly deadly form of cancer, Multiple Myeloma, can be predicted from single-nucleotide polymorphism (SNP) profiles with an accuracy greater than chance. Specifical ...
Full textCite
ConferenceIcml 2005 Proceedings of the 22nd International Conference on Machine Learning · December 1, 2005
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the presence of irrelevant variables. We prove that, in an idealized setting, for any func ...
Cite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2005
Inductive Logic Programming (ILP) is a popular approach for learning rules for classification tasks. An important question is how to combine the individual rules to obtain a useful classifier. In some instances, converting each learned rule into a binary f ...
Full textCite
ConferenceLecture Notes in Artificial Intelligence Subseries of Lecture Notes in Computer Science · January 1, 2005
We propose a new approach to Inductive Logic Programming i that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computation, is more amenable to the use of set-oriented generation and evaluation o ...
Full textCite
ConferenceIcml 2005 Proceedings of the 22nd International Conference on Machine Learning · January 1, 2005
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary variables. In this paper, we extend skewing to directly handle functions of co ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2005
Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbing heuristics in learning first-order concepts, have been a dominating force in the ar ...
Full textCite
ConferenceProceedings Twenty First International Conference on Machine Learning Icml 2004 · December 1, 2004
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions with a lower run-time penalty than Lookahead. A deficiency of the ...
Cite
ConferenceJournal of Machine Learning Research · May 15, 2004
Inductive logic programming (ILP) is built on a foundation laid by research in machine learning and computational logic. Armed with this strong foundation, ILP has been applied to important and interesting problems in the life sciences, engineering and the ...
Full textCite
ConferenceLecture Notes in Artificial Intelligence Subseries of Lecture Notes in Computer Science · January 1, 2004
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomizing and restarting the search procedure. It has been found that if the search cost distribution (SCD) of the non-resta ...
Full textCite
ConferenceIjcai International Joint Conference on Artificial Intelligence · December 1, 2003
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the standard approach to addressing difficult functions for greedy decision tree le ...
Cite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2003
Recent empirical studies show that runtime distributions of backtrack procedures for solving hard combinatorial problems often have intriguing properties. Unlike standard distributions (such as the normal), such distributions decay slower than exponentiall ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2003
Ensembles have proven useful for a variety of applications, with a variety of machine learning approaches. While Quinlan has applied boosting to FOIL, the widely-used approach of bagging has never been employed in ILP. Bagging has the advantage over boosti ...
Full textCite
ConferenceProceedings of the 2003 IEEE Bioinformatics Conference Csb 2003 · January 1, 2003
This paper presents a new system for parallel inductive logic search for pharmacophores which can potentially accelerate the chemical evaluation phase of the drug design process. This system has been tested on a Beowulf cluster and an IBM SP2 supercomputer ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2002
Biological and biomedical databases have become a primary application area for data mining. Such databases commonly involve multiple relational tables and a variety of data types, as in the biological databases that formed the basis for the KDD Cup 2001 an ...
Cite
ConferenceBioinformatics · 2002
MOTIVATION: Cells continuously reprogram their gene expression network as they move through the cell cycle or sense changes in their environment. In order to understand the regulation of cells, time series expression profiles provide a more complete pictur ...
Full textLink to itemCite
Conference10th Golden West International Conference on Intelligent Systems 2001 Icis 2001 · January 1, 2001
Rapid and efficient design of new drugs is a key challenge for the medical industry. Current drug design methodologies can take several years just in the initial chemical evaluation stages before compounds can be created for animal and human testing. This ...
Cite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2000
Inductive logic programming (ILP) is built on a foundation laid by research in other areas of computational logic. But in spite of this strong foundation, at 10 years of age ILP now faces a number of new challenges brought on by exciting application opport ...
Full textCite
ConferenceLecture Notes in Artificial Intelligence Subseries of Lecture Notes in Computer Science · January 1, 2000
Inductive logic programming (ILP) is built on a foundation laid by research in other areas of computational logic. But in spite of this strong foundation, at 10 years of age ILP now faces a number of new challenges brought on by exciting application opport ...
Full textCite
ConferenceProceedings of the IEEE International Conference on Systems Man and Cybernetics · January 1, 2000
Rapid and effective design of new drugs to combat new strains of antibiotic resistant organisms, more effectively treat chronic conditions, and provide other life sustaining treatment is a key challenge for the medical industry. Current drug design methodo ...
Full textCite
ConferenceProceedings of the 8th International Conference on Intelligent Systems for Molecular Biology Ismb 2000 · January 1, 2000
We present a computational approach to predicting operons in the genomes of prokaryotic organisms. Our approach uses machine learning methods to induce predictive models for this task from a rich variety of data types including sequence data, gene expressi ...
Cite
ConferenceLecture Notes in Computer Science · January 1, 1997
Previous applications of Inductive Logic Programming to drug design have not addressed stereochemistry, or the three-dimensional aspects of molecules. While some success is possible without consideration of stereochemistry, researchers within the pharmaceu ...
Full textCite
ConferenceProceedings of the National Conference on Artificial Intelligence · December 1, 1993
Inductive logic programming is a rapidly growing area of research that centers on the development of inductive learning algorithms for first-order definite clause theories. An obvious framework for inductive logic programming research is the study of the p ...
Cite
ConferenceProceedings of the 8th International Workshop on Machine Learning Icml 1991 · January 1, 1991
This paper studies the generalization of atomic formulas, or atoms, that are augmented with constraints on or among their terms. The atoms may also be viewed as definite clauses whose antecedents express the constraints. Atoms are generalized relative to a ...
Full textCite
ConferenceProceedings of the International Conference on Knowledge Representation and Reasoning · January 1, 1991
This paper studies the generalization of atomic formulas, or atoms, that are augmented with constraints on or among their terms. The atoms may also be viewed as definite clauses whose antecedents express the constraints. Atoms are generalized relative to a ...
Cite
ConferenceProceedings of the 8th National Conference on Artificial Intelligence Aaai 1990 · January 1, 1990
This paper studies sorted generalization-the generalization, with respect to an arbitrary taxonomic theory, of atomic formulas containing sorted variables. It develops an algorithm for the task, discusses the algorithm and task complexity, and presents sem ...
Cite