scholarly journals Design of Multi-level Teaching System Based on Association Rule Mining

Author(s):  
Hong-yan He ◽  
Hui-ping, Zhang ◽  
Hong-fang Luo

In order to improve the overall performance for the multi-level teaching system, a system with Multi-strata teaching is designed. It divides the whole class into smaller parts based on their knowledge level and learning ability and teach students in accordance with their aptitude. The system used the model of C/S, and applies ASP in the interactive user interface. The data mining algorithm is also presented in the study. The system was tested with practical data. The results show that with the teaching system teachers can separate students into different parts and get a very good idea about how much students can learn.

Author(s):  
Reshu Agarwal ◽  
Sarla Pareek ◽  
Biswajit Sarkar ◽  
Mandeep Mittal

In this article, an inventory model for a retailer's ordering policy is studied. Multi-level association rule mining is used to find frequent item-sets at each level by applying different threshold at different levels. During order quantity estimation, category, content, and brand of the items are considered, which leads to the discovery of more specific and concrete knowledge of the required order quantity. At each level, optimum order quantity of frequent items is determined. This assists inventory manager to order optimal quantity of items as per the actual requirement of the item with respect to their category, content and brand. An example is devised to explain the new approach. Further, to understand the effect of above approach in the real scenario, experiments are conducted on the exiting dataset.


2014 ◽  
Vol 998-999 ◽  
pp. 899-902 ◽  
Author(s):  
Cheng Luo ◽  
Ying Chen

Existing data miming algorithms have mostly implemented data mining under centralized environment, but the large-scale database exists in the distributed form. According to the existing problem of the distributed data mining algorithm FDM and its improved algorithms, which exist the problem that the frequent itemsets are lost and network communication cost too much. This paper proposes a association rule mining algorithm based on distributed data (ARADD). The mapping marks the array mechanism is included in the ARADD algorithm, which can not only keep the integrity of the frequent itemsets, but also reduces the cost of network communication. The efficiency of algorithm is proved in the experiment.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
You Wu ◽  
Zheng Wang ◽  
Shengqi Wang

Data mining is currently a frontier research topic in the field of information and database technology. It is recognized as one of the most promising key technologies. Data mining involves multiple technologies, such as mathematical statistics, fuzzy theory, neural networks, and artificial intelligence, with relatively high technical content. The realization is also difficult. In this article, we have studied the basic concepts, processes, and algorithms of association rule mining technology. Aiming at large-scale database applications, in order to improve the efficiency of data mining, we proposed an incremental association rule mining algorithm based on clustering, that is, using fast clustering. First, the feasibility of realizing performance appraisal data mining is studied; then, the business process needed to realize the information system is analyzed, the business process-related links and the corresponding data input interface are designed, and then the data process to realize the data processing is designed, including data foundation and database model. Aiming at the high efficiency of large-scale database mining, database development tools are used to implement the specific system settings and program design of this algorithm. Incorporated into the human resource management system of colleges and universities, they carried out successful association broadcasting, realized visualization, and finally discovered valuable information.


Sign in / Sign up

Export Citation Format

Share Document