Skip to main content

Acquiring Graphic Design Knowledge with Nonmonotonic Inductive Learning

  • Conference paper
  • First Online:
  • 471 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1634))

Abstract

In this paper, we present a new method based on nonmonotonic learning where the Inductive Logic Programming (ILP) algorithm is used twice and apply our method to acquire graphic design knowledge. Acquiring design knowledge is a challenging task because such knowledge is complex and vast. We thus focus on principles of layout and constraints that layouts must satisfy to realize automatic layout generation. Although we do not have negative examples in this case, we can generate them randomly by considering that a page with just one element moved is always wrong. Our nonmonotonic learning method introduces a new predicate for exceptions. In our method, the ILP algorithm is executed twice, exchanging positive and negative examples. From our experiments using magazine advertisements, we obtained rules characterizing good layouts and containing relationships between elements. Moreover, the experiments show that our method can learn more accurate rules than normal ILP can.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bain and S. Muggleton. Non-monotonic learning. In D. Michie, editor, Machine Intelligence 12:105–120. Oxford University Press, 1991.

    Google Scholar 

  2. A. Borning, R. Duisberg, B. Freeman-Benson, A. Kramer, and M. Woolf. Constraint Hierarchies. ACM OOPSLA, Oct. 1987, pp. 48–60.

    Google Scholar 

  3. BYTE, 22(12), McGraw-Hill, 1997.

    Google Scholar 

    Google Scholar 

  4. L. De Raedt and M. Bruynooghe, A theory of clausal discovery. in Proceedings of the 13th International Joint Conference on Artificial Intelligence, pp. 1058–1063, Morgan Kaufmann, 1993.

    Google Scholar 

  5. F. Esposito, D. Malerba and G. Semeraro. Multistrategy Learning for Document recognition. Applied Artificial Intelligence: An International Journal, 8(1):33–84, 1994.

    Article  Google Scholar 

  6. K. Honda, C. Kato, H. Ohwada, N. Ichihara and F. Mizoguchi. A Floor Planning System Using Constraint Logic Programming. In Proc. of The 2nd International Conference on the Practical Applications of Prolog,1994.

    Google Scholar 

  7. M. Ishiba et al. A Document Generation System using the Kansei Model. IPSJ SIG Report, 97-HI-70, pp. 71–78, 1997. (In Japanese)

    Google Scholar 

  8. H. Lieberman. Mondrian: A Teachable Graphical Editor. in Watch What I Do: Programming by Demonstration, Allen Cypher, ed., MIT Press, 1993.

    Google Scholar 

  9. H. Lieberman. The Visual Language of Experts in Graphic Design. IEEE Symposium on Visual Languages, Darmstadt, Germany, September 1995.

    Google Scholar 

  10. H. Lieberman. Intelligent Graphics. Communications of the ACM, 39(8):38–48, 1996.

    Article  Google Scholar 

  11. S. Muggleton. Inductive logic programming. New Generation Computing, 8(4):295–318, 1991.

    Article  MATH  Google Scholar 

  12. S. Muggleton. Inverse entailment and Progol. New Generation Computing, 13:245–286, 1995.

    Google Scholar 

  13. C. J. van Rijsbergen. Information Retrieval. chapter 7. Butterworths, 1979.

    Google Scholar 

  14. S. Slattery and M. Craven. Combining Statistical and Relational Methods for Learning in Hypertext Domains. Proceedings of the 8th International Conference on Inductive Logic Programming, Springer-Verlag, 1998.

    Google Scholar 

  15. A. Srinivasan, S. Muggleton, and M. Bain. Distinguishing exceptions from noise in non-monotonic learning. In Proceedings of the Second Inductive Logic Programming Workshop, pp. 97–107, Tokyo, 1992.

    Google Scholar 

  16. S. Wrobel. Concept Formation During Interactive Theory Revision. Machine Learning, 14:169–191, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chiba, K., Ohwada, H., Mizoguchi, F. (1999). Acquiring Graphic Design Knowledge with Nonmonotonic Inductive Learning. In: Džeroski, S., Flach, P. (eds) Inductive Logic Programming. ILP 1999. Lecture Notes in Computer Science(), vol 1634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48751-4_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48751-4_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66109-2

  • Online ISBN: 978-3-540-48751-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics