scholarly journals Designing web-based data mining applications to analyze the association rules tracer study at university using a FOLD-growth method

2016 ◽  
Vol 6 (27) ◽  
pp. 215-221 ◽  
Author(s):  
Herman Yuliansyah ◽  
Lisna Zahrotun
2015 ◽  
Vol 6 (2) ◽  
pp. 18-30 ◽  
Author(s):  
Marijana Zekić-Sušac ◽  
Adela Has

Abstract Background: Previous research has shown success of data mining methods in marketing. However, their integration in a knowledge management system is still not investigated enough. Objectives: The purpose of this paper is to suggest an integration of two data mining techniques: neural networks and association rules in marketing modeling that could serve as an input to knowledge management and produce better marketing decisions. Methods/Approach: Association rules and artificial neural networks are combined in a data mining component to discover patterns and customers’ profiles in frequent item purchases. The results of data mining are used in a web-based knowledge management component to trigger ideas for new marketing strategies. The model is tested by an experimental research. Results: The results show that the suggested model could be efficiently used to recognize patterns in shopping behaviour and generate new marketing strategies. Conclusions: The scientific contribution lies in proposing an integrative data mining approach that could present support to knowledge management. The research could be useful to marketing and retail managers in improving the process of their decision making, as well as to researchers in the area of marketing modelling. Future studies should include more samples and other data mining techniques in order to test the model generalization ability.


2017 ◽  
Author(s):  
Andysah Putera Utama Siahaan ◽  
Mesran Mesran ◽  
Andre Hasudungan Lubis ◽  
Ali Ikhwan ◽  
Supiyandi

Sales transaction data on a company will continue to increase day by day. Large amounts of data can be problematic for a company if it is not managed properly. Data mining is a field of science that unifies techniques from machine learning, pattern processing, statistics, databases, and visualization to handle the problem of retrieving information from large databases. The relationship sought in data mining can be a relationship between two or more in one dimension. The algorithm included in association rules in data mining is the Frequent Pattern Growth (FP-Growth) algorithm is one of the alternatives that can be used to determine the most frequent itemset in a data set.


2014 ◽  
Vol 1 (1) ◽  
pp. 339-342
Author(s):  
Mirela Danubianu ◽  
Dragos Mircea Danubianu

AbstractSpeech therapy can be viewed as a business in logopaedic area that aims to offer services for correcting language. A proper treatment of speech impairments ensures improved efficiency of therapy, so, in order to do that, a therapist must continuously learn how to adjust its therapy methods to patient's characteristics. Using Information and Communication Technology in this area allowed collecting a lot of data regarding various aspects of treatment. These data can be used for a data mining process in order to find useful and usable patterns and models which help therapists to improve its specific education. Clustering, classification or association rules can provide unexpected information which help to complete therapist's knowledge and to adapt the therapy to patient's needs.


2011 ◽  
Vol 145 ◽  
pp. 292-296
Author(s):  
Lee Wen Huang

Data Mining means a process of nontrivial extraction of implicit, previously and potentially useful information from data in databases. Mining closed large itemsets is a further work of mining association rules, which aims to find the set of necessary subsets of large itemsets that could be representative of all large itemsets. In this paper, we design a hybrid approach, considering the character of data, to mine the closed large itemsets efficiently. Two features of market basket analysis are considered – the number of items is large; the number of associated items for each item is small. Combining the cut-point method and the hash concept, the new algorithm can find the closed large itemsets efficiently. The simulation results show that the new algorithm outperforms the FP-CLOSE algorithm in the execution time and the space of storage.


Sign in / Sign up

Export Citation Format

Share Document