Computational-Intelligence

News-Archiv

Fuzzy Systems Lecture

Winter 2009/10

News

The 9th slides for the last lecture on 2010/01/20 have been extended.

Christian Borgelt will give is annual lecture "Frequent Pattern Mining" from March 22nd to 26th.

The last assignment sheet is available online.


Overview


General Information

This page contains information about the lecture "Fuzzy Systems" that is read by Prof. Dr. Rudolf Kruse in the winter 2009/10. It is updated during the course.

Fuzzy set theory is an extension of the classical set theory that can model imprecise and vague expressions of natural language such as big, small, hot, cold, etc. Fuzzy logic allows to formalize rules that contain such expressions of natural language. These rules can be utilized to support decision processes. The lecture "Fuzzy Systems" offers an introduction to both fuzzy set theory and fuzzy logic. Moreover it deals with applications of control engineering, approximate inference and data analysis.

If there is enough time at the end of the lecture, an interesting topic in current research will be touched. The union of two soft computing methods, i.e., fuzzy systems and support vector machines (SVMs), is motivated and outlined. Therefore basic concepts of statistical learning theory, large-margin classification, and kernel methods are introduced.

Note that since "Fuzzy Systems" is a master course, both lecture and exercise will be given in English. There might be German assignment sheets on request.

back to top

Schedule and Rooms

 WeekdayTimeRoomBegin
LectureWednesday09:15-10:45G22A-12021.10.2009
ExerciseTuesdays13:15-14:45G22A-20820.10.2009

Every student that wants to participate in the exercise must register her-/himself via the FIN Registration Service for the exercise. The registration will be enabled starting on Monday, October 12th, 2009 at 08:00 am. It will end on Tuesday, November 3rd, 2009 at 10:00 am. While doing the registration, we kindly ask you to give an e-mail address of which incoming e-mail you check regularly.

back to top

Lecturers

If you have questions regarding the lecture or exercise, please contact (via e-mail if possible) one of the persons named below.

back to top

Conditions for Certificate ("Schein") and Exam

A new assignment sheet containing written and programming assignments is published on this web page every week. The written assignments must me ticked of at the beginning of every exercise. Ticking off an assignment you agree to be able to explain and present the assignment and your solution proposal (which need not to be completely correct. However, you should be prepared thoroughly in order to solve the assignment).

Programming assignments must be submitted in electronic form to Christian Moewes before 8 o'clock in the morning of the corresponding exercise day. Late assignments will not be accepted. The programs must run properly on the SUN pool machines in the faculty of computer science.

The certificate for this course is issued to students who

  • regularly contribute well in the exercises,
  • tick off at least two third of all written assignments,
  • present at least twice a solution to a written assignment during the exercise,
  • submit at least twice a running implementation of a programming assignment, and
  • finally pass a small colloquium (around 10 minutes) or a written test (if there are more than 20 students) after the course.

Students who want to finish the course with an exam or a marked certificate must

  • regularly contribute well in the exercises,
  • tick off at least half of all written assignments,
  • present at least twice a solution to a written assignment during the exercise,
  • find an examination appointment with Prof. Kruse,
  • officially announce the exam to the examination office two weeks before the exam, and
  • finally pass an oral exam (around 25 minutes) or a written exam (if there are more than 20 students) after the course.
back to top

Prerequisites

You do not need but should have background knowledge about

  • mathematics (especially algebra and convex optimization theory),
  • computer science (algorithms, data structures, etc.), and
  • machine learning or data mining.
back to top

Slides from the Lecture

The slides from the lecture will be published here incrementally as the course proceeds.

back top top

Assignments

The collection of assignment sheets will be updated weekly at this location.

back top top

Additional Material

Feel free to check out the following supplementary material that augment the lecture and exercise.

back to top

References

  • about fuzzy systems
    • C. Borgelt, F. Klawonn, R. Kruse, D. Nauck (2003). Neuro-Fuzzy-Systeme (3rd edition). Vieweg, Braunschweig/Wiesbaden, Germany.
    • G.J. Klir and B. Yuan (1995). Fuzzy Sets and Fuzzy Logic - Theory and Applications. Prentice Hall, Upper Saddle River, NJ, USA.
    • R. Kruse, J. Gebhardt, and F. Klawonn (1994). Fuzzy-Systeme (2nd edition). Teubner, Stuttgart, Germany.
    • R. Kruse, J. Gebhardt, and F. Klawonn (1994). Foundations of Fuzzy Systems. Wiley, Chichester, United Kingdom.
    • K. Michels, F. Klawonn, R. Kruse, and A. N├╝rnberger (2002). Fuzzy-Regelung. Springer-Verlag, Heidelberg, Germany.
  • about machine learning and data mining
    • D. Hand and M. Berthold (2002). Intelligent Data Analysis: An Introduction (2nd edition). Springer-Verlag, Berlin, Germany.
    • T. Mitchell (1997). Machine Learning. McGraw Hill, New York, NY, USA.
  • about SVM
    • S. Boyd and L. Vandenberghe (2004). Convex Optimization. Cambridge University Press, New York, NY, USA.
    • B. Schölkopf and A.J. Smola (2002). Learning with Kernels. MIT Press, Cambridge, MA, USA.
    • V. Vapnik (1995). The Nature of Statistical Learning Theory. Springer-Verlag, New York, NY, USA.
back to top

Links

back to top
en lang icon de lang icon Printable View - Recent Changes
Page last modified on January 21, 2010, at 05:44 PM by cmoewes