Jan Ramon

According to our database1, Jan Ramon
  • authored at least 91 papers between 1998 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Learning from Networked Examples.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016
Guest editors introduction: special issue on inductive logic programming.
Machine Learning, 2016

Bounds for Learning from Evolutionary-Related Data in the Realizable Case.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3.
TPLP, 2015

Learning relational dependency networks in hybrid domains.
Machine Learning, 2015

Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time.
J. UCS, 2015

A Note on Restricted Forms of LGG.
Proceedings of the Late Breaking Papers of the 25th International Conference on Inductive Logic Programming, 2015

Mine 'Em All: A Note on Mining All Graphs.
Proceedings of the Inductive Logic Programming - 25th International Conference, 2015

Predicting Protein Function and Protein-Ligand Interaction with the 3D Neighborhood Kernel.
Proceedings of the Discovery Science - 18th International Conference, 2015

2014
Learning from networked examples.
CoRR, 2014

U-statistics on network-structured data with kernels of degree larger than one.
Proceedings of the 1st ECML/PKDD Workshop on Statistically Sound Data Mining, 2014

Towards a Framework for Learning from Networked Data.
Proceedings of the Graph-Based Representation and Reasoning, 2014

Graph and Network Pattern Mining.
Proceedings of the Mining User Generated Content., 2014

2013
An efficiently computable subgraph pattern support measure: counting independent observations.
Data Min. Knowl. Discov., 2013

Nearly exact mining of frequent trees in large networks.
Data Min. Knowl. Discov., 2013

Learning from networked examples in a k-partite graph.
CoRR, 2013

Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3.
CoRR, 2013

PIUS: peptide identification by unbiased search.
Bioinformatics, 2013

A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics.
Ann. Math. Artif. Intell., 2013

Detecting Bicliques in GF[q].
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Guided Monte Carlo Tree Search for Planning in Learned Environments.
Proceedings of the Asian Conference on Machine Learning, 2013

2012
Open Problem: Learning Dynamic Network Models from a Static Snapshot.
Proceedings of the COLT 2012, 2012

An Efficiently Computable Support Measure for Frequent Subgraph Pattern Mining.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

Nearly Exact Mining of Frequent Trees in Large Networks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

Hybrid Logical Bayesian Networks.
Proceedings of the Late Breaking Papers of the 22nd International Conference on Inductive Logic Programming, 2012

Modeling Machine Learning and Data Mining Problems with FO(·).
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

2011
Effective feature construction by maximum common subgraph sampling.
Machine Learning, 2011

Computerized prediction of intensive care unit discharge after cardiac surgery: development and validation of a Gaussian processes model.
BMC Med. Inf. & Decision Making, 2011

Preface.
Fundam. Inform., 2011

All normalized anti-monotonic overlap graph measures are bounded.
Data Min. Knowl. Discov., 2011

Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs
CoRR, 2011

2010
Learning with Whom to Communicate Using Relational Reinforcement Learning.
Proceedings of the Interactive Collaborative Information Systems, 2010

Efficient frequent connected subgraph mining in graphs of bounded tree-width.
Theor. Comput. Sci., 2010

A comparison of pruning criteria for probability trees.
Machine Learning, 2010

Prediction of Clinical Conditions after Coronary Bypass Surgery using Dynamic Data Analysis.
J. Medical Systems, 2010

Frequent subgraph mining in outerplanar graphs.
Data Min. Knowl. Discov., 2010

Efficient frequent connected subgraph mining in graphs of bounded tree-width.
Proceedings of the LWA 2010, 2010

Inductive Queries for a Drug Designing Robot Scientist.
Proceedings of the Inductive Databases and Constraint-Based Data Mining., 2010

2009
StReBio'09: statistical relational learning and mining in bioinformatics.
SIGKDD Explorations, 2009

Deriving distance metrics from generality relations.
Pattern Recognition Letters, 2009

Polynomial-Delay Enumeration of Monotonic Graph Classes.
Journal of Machine Learning Research, 2009

An evolutionary game-theoretic analysis of poker strategies.
Entertainment Computing, 2009

Dynamic Data Analysis and Data Mining for Prediction of Clinical Stability.
Proceedings of the Medical Informatics in a United and Healthy Europe - Proceedings of MIE 2009, The XXIInd International Congress of the European Federation for Medical Informatics, Sarajevo, Bosnia and Herzegovina, Agust 30, 2009

Handling missing values and censored data in PCA of pharmacological matrices.
Proceedings of the ACM SIGKDD Workshop on Statistical and Relational Learning in Bioinformatics, 2009

Learning with whom to communicate using relational reinforcement learning.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

Monte-Carlo Tree Search in Poker Using Expected Reward Distributions.
Proceedings of the Advances in Machine Learning, 2009

2008
Generalized ordering-search for learning directed probabilistic logical models.
Machine Learning, 2008

Learning directed probabilistic logical models: ordering-search versus structure-search.
Ann. Math. Artif. Intell., 2008

Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008

Anti-monotonic Overlap-Graph Support Measures.
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

Using Decision Trees as the Answer Networks in Temporal Difference-Networks.
Proceedings of the ECAI 2008, 2008

An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules.
Proceedings of the Discovery Science, 11th International Conference, 2008

Active Learning for High Throughput Screening.
Proceedings of the Discovery Science, 11th International Conference, 2008

Bayes-Relational Learning of Opponent Models from Incomplete Information in No-Limit Poker.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Mining data from intensive care patients.
Advanced Engineering Informatics, 2007

A Polynomial-time Metric for Outerplanar Graphs.
Proceedings of the Mining and Learning with Graphs, 2007

General Graph Refinement with Polynomial Delay.
Proceedings of the Mining and Learning with Graphs, 2007

Learning Directed Probabilistic Logical Models Using Ordering-Search.
Proceedings of the Inductive Logic Programming, 17th International Conference, 2007

Online Learning and Exploiting Relational Models in Reinforcement Learning.
Proceedings of the IJCAI 2007, 2007

Transfer Learning in Reinforcement Learning Problems Through Partial Policy Recycling.
Proceedings of the Machine Learning: ECML 2007, 2007

Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search.
Proceedings of the Machine Learning: ECML 2007, 2007

On Policy Learning in Restricted Policy Spaces.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Graph kernels and Gaussian processes for relational reinforcement learning.
Machine Learning, 2006

Refining Aggregate Conditions in Relational Learning.
Proceedings of the Knowledge Discovery in Databases: PKDD 2006, 2006

Frequent Subgraph Mining in Outerplanar Graphs.
Proceedings of the LWA 2006: Lernen - Wissensentdeckung - Adaptivität, Hildesheim, October 9th-11th 2006, joint workshop event of several interest groups of the German Society for Informatics (GI) - 14th Workshop on Adaptivity and User Modeling in Interactive Systems (ABIS 2006) - Workshop Information Retrieval 2006 of the Special Interest Group Information Retrieval (FGIR 2006) - Workshop on Knowledge and Experience Management (FGWM 2006), 2006

Frequent subgraph mining in outerplanar graphs.
Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006

ReMauve: A Relational Model Tree Learner.
Proceedings of the Inductive Logic Programming, 16th International Conference, 2006

Generalized Ordering-Search for Learning Directed Probabilistic Logical Models.
Proceedings of the Inductive Logic Programming, 16th International Conference, 2006

2005
Multi-agent Relational Reinforcement Learning.
Proceedings of the Learning and Adaption in Multi-Agent Systems, 2005

Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models.
Proceedings of the Inductive Logic Programming, 15th International Conference, 2005

A Comparison of Approaches for Learning Probability Trees.
Proceedings of the Machine Learning: ECML 2005, 2005

Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models.
Proceedings of the BNAIC 2005, 2005

2004
Compact Representation of Knowledge Bases in Inductive Logic Programming.
Machine Learning, 2004

Condensed Representations for Inductive Logic Programming.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

Searching for Compound Goals Using Relevancy Zones in the Game of Go.
Proceedings of the Computers and Games, 4th International Conference, 2004

2003
Graph Kernels and Gaussian Processes for Relational Reinforcement Learning.
Proceedings of the Inductive Logic Programming: 13th International Conference, 2003

Relational Instance Based Regression for Relational Reinforcement Learning.
Proceedings of the Machine Learning, 2003

2002
Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs.
J. Artif. Intell. Res., 2002

Clustering and instance based learning in first order logic.
AI Commun., 2002

Compact Representation of Knowledge Bases in ILP.
Proceedings of the Inductive Logic Programming, 12th International Conference, 2002

2001
A polynomial time computable metric between point sets.
Acta Inf., 2001

Speeding Up Relational Reinforcement Learning through the Use of an Incremental First Order Decision Tree Learner.
Proceedings of the Machine Learning: EMCL 2001, 2001

2000
Top-down induction of clustering trees
CoRR, 2000

Using Belief Networks to Neutralize Known Dependencies in Conceptual Clustering.
Proceedings of the Inductive Logic Programming, 10th International Conference, 2000

Executing Query Packs in ILP.
Proceedings of the Inductive Logic Programming, 10th International Conference, 2000

Learning a Go Heuristic with TILDE.
Proceedings of the Computers and Games, Second International Conference, 2000

1999
Instance Based Function Learning.
Proceedings of the Inductive Logic Programming, 9th International Workshop, 1999

Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms.
Proceedings of the Inductive Logic Programming, 9th International Workshop, 1999

1998
A Framework for Defining Distances Between First-Order Logic Objects.
Proceedings of the Inductive Logic Programming, 8th International Workshop, 1998

Top-Down Induction of Clustering Trees.
Proceedings of the Fifteenth International Conference on Machine Learning (ICML 1998), 1998


  Loading...