Skip to main content

Algorithm for Information and Data Science

KMUTNB

About This Course

Course Overview: 070147815 Algorithm for Information and Data Science

  • Course Code: 070147815

  • Credits: 3(3-0-6)

  • Prerequisites: None

This course explores the planning and application of complex algorithms. Learners will cover material ranging from fundamental concepts to advanced, nature-inspired metaheuristics for solving complex optimization problems. The syllabus aims to provide students with both the necessary theoretical knowledge and the required practical skills for implementing and evaluating the latest algorithmic solutions in the field of data science.

Key Topics

  • Algorithmic Foundations: The course covers foundational methods, including recursive, deterministic, and approximation algorithms.

  • Optimization Techniques: A core focus is on techniques for solving optimization problems. This includes an in-depth study of:

    • Genetic Algorithms

    • Evolutionary Programming

    • Particle Swarm Optimization (PSO)

    • Ant Colony Optimization (ACO)

  • AI and Data Science Applications: The course explicitly links these advanced algorithms to practical applications in data science, exploring the role of artificial intelligence algorithms in the field.

Requirements

None.

Course Staff

Course Staff Image #1

Associate Professor Dr. Phayung Meesad

Biography
Associate Professor Dr. Phayung Meesad is a Computer Scientist and Data Scientist who focuses his work on the development of optimization and learning algorithms. Besides teaching the Algorithm for Information and Data Science course, Dr. Meesad also holds the position of Director of a Smart Digital Library project. His career is quite diverse, covering system engineering, database design, software development, testing, auditing, and applied machine learning.

The teaching of Dr. Meesad is very much focused on Outcome-Based Education (OBE), clearly defining the problem and conducting experiments that can be repeated. As per his teachings, students learn the theory and then directly apply it in the practical part, which enables them to transition from complexity analysis to metaheuristics and responsible AI. They then write the results in the form of code, logs, and reports.

Expertise and interests

  • Algorithm design: recursive, deterministic, approximation, and metaheuristics (GA, DE/ES, PSO, ACO).

  • Machine learning for feature selection, clustering, and hyperparameter optimization.

  • Reproducible research, fairness constraints, and privacy-aware modeling.

  • System design, data wrangling, and visualization for decision support.

Course Staff Image #2

Staff Member #2

Biography of instructor/staff member #2

Frequently Asked Questions

What web browser should I use?

The Open edX platform works best with current versions of Chrome, Edge, Firefox, or Safari.

See our list of supported browsers for the most up-to-date information.

Question #2

Your answer would be displayed here.

Enroll