Institutional Repository

Browsing by Subject "Data mining"

Browsing by Subject "Data mining"

Sort by: Order: Results:

  • Chaaya, Georges (Notre Dame University-Louaize, 2015-06)
    Anomaly detection is the process of finding outlying record from a given data set. This problem has been of increasing importance due to the increase in the size of the data and the need to efficiently extract those outlying records that can have important indications in real-life problems. Anomaly detection is applied in many different sectors. There are many approaches to solve the anomaly detection problem. However, those that are more widely applicable are unsupervised approaches as they do not require labeled data. The aim of this thesis is to study a well-known anomaly detection technique ...
  • Al Youssef, Jad (Notre Dame University-Louaize, 2019-05)
    The aim of this thesis is to study the impact of a three-year-study of computer science at Notre Dame University on the students’ academic performances. For this reason, the GPAs of the students after their first year of study were compared with their GPAs upon graduation. To perform this, a Decision Tree, as well as Neural Networks were used. These algorithms helped us to predict the final GPA based on the first two semesters’ GPA. In addition, the most decisive courses on the student GPA were identified. For this reason, Relief algorithm was used to identify the three most important courses ...
  • Aad, Elie (Notre Dame University-Louaize, 2002)
    Mining association rules has been an important topic in data mining research in recent years from the standpoint of supporting human-centered discovery of knowledge. The present day model of mining association rules suffers from the following shortcomings: (i) lack of user exploration and control, (ii) lack of focus, (iii) huge number of rules technically unreadable. All data mining researchers, have given a high importance on developing fast algorithms for rules discovery, and have applied different types of constraints in different algorithms to prune item sets, that do not occur frequently ...