Pascal Jappy

According to our database, Pascal Jappy authored at least 9 papers between 1994 and 1999.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1999

Decision tree based induction of decision lists.

Richard Nock, Pascal Jappy

Intell. Data Anal., 1999

Experiments on a Representation-Independent "Top-Down and Prune" Induction Scheme.

Richard Nock, Marc Sebban, Pascal Jappy

Proceedings of the Principles of Data Mining and Knowledge Discovery, 1999

A "Top-Down and Prune" Induction Scheme for Constrained Decision Committees.

Richard Nock, Pascal Jappy

Proceedings of the Advances in Intelligent Data Analysis, Third International Symposium, 1999

1998

Generalized Graph Colorability and Compressibility of Boolean Formulae.

Richard Nock, Pascal Jappy, Jean Sallantin

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Function-Free Horn Clauses Are Hard to Approximate.

Richard Nock, Pascal Jappy

Proceedings of the Inductive Logic Programming, 8th International Workshop, 1998

On the Power of Decision Lists.

Richard Nock, Pascal Jappy

Proceedings of the Fifteenth International Conference on Machine Learning (ICML 1998), 1998

PAC Learning Conceptual Graphs.

Pascal Jappy, Richard Nock

Proceedings of the Conceptual Structures: Theory, 1998

1996

Negative Robust Learning Results from Horn Claus Programs.

Pascal Jappy, Richard Nock, Olivier Gascuel

Proceedings of the Machine Learning, 1996

1994

Learning from Recursive, Tree Structured Examples.

Pascal Jappy, Marie-Catherine Daniel-Vatonne, Olivier Gascuel, Colin de la Higuera

Proceedings of the Machine Learning: ECML-94, 1994