Results 31 to 40 of about 70,533 (290)
RESEARCH ON STUDENT BEHAVIOR INFERENCE METHOD BASED ON FP-GROWTH ALGORITHM [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 How to use modern information technology to efficiently and quickly obtain the personalized recommendation information required by students, and to provide high-quality intelligent services for schools, parents and students has become one of the hot ...
J. W. Li +7 more
doaj +1 more source
Rancang Bangun Aplikasi Data Mining Analisis Tingkat Kelulusan Menggunakan Algoritma Fp-growth (Studi Kasus di Politeknik Negeri Malang) [PDF]
, 2016 Kondisi kompetisi dan tuntutan oleh Direktorat Jenderal Pendidikan (Dikti) membuat perguruan tinggi harus memiliki keunggualan kompetitif dan kualitas agar dapat tetap bersaing dengan ...
Andoko, B. S. (Banni) +1 more
core +1 more source
Penerapan Algoritma FP-Growth dalam Penentuan Promosi Kampus
Journal of Computer System and Informatics (JoSYC), 2022 Campus or college is an institution as well as an institution that is included in the education sector. Now the campus is included in a business sector that is engaged in education. Therefore, the campus is also inseparable from the promotion process. The promotion carried out by the campus has the aim of making prospective new students register on the
Hany Maria Valentine +1 more
openaire +1 more source
Parallel FP-Growth Algorithm Based on Load Balance [PDF]
Jisuanji gongcheng, 2019 Aiming at the problem that the lookup operation of FP-Growth algorithm has a high time complexity,this paper proposes a new algorithm named LBPFP.The algorithm is based on PFP algorithm,which is added a hash table to the head table to achieve fast access
GAO Quan,WAN Xiaodong
doaj +1 more source
Implementation of the FP-Growth Algorithm on Spare Parts Supply Requests
Jurnal Riset InformatikaManufacturing companies rely on machines for operational activities to produce finished goods. Common factors constraining the demand and supply of spare parts are the high number of spare parts managed and irregular patterns of demand for spare parts ...
Fachri Amsury +3 more
doaj +1 more source
Fp-Growth Algoritmasi- Weka Uygulaması
SOCIAL MENTALITY AND RESEARCHER THINKERS JOURNAL, 2018 Data mining is a wide field for researchers because of their various approaches to information discovery in large volumes of data stored in different formats. By applying data mining techniques, the discovery of unknown patterns and the relationships between the data are discovered.
openaire +2 more sources
An implementation of the FP-growth algorithm [PDF]
Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, 2005 The FP-growth algorithm is currently one of the fastest approaches to frequent item set mining. In this paper I describe a C implementation of this algorithm, which contains two variants of the core operation of computing a projection of an FP-tree (the fundamental data structure of the FP-growth algorithm).
openaire +1 more source
Mining frequent biological sequences based on bitmap without candidate sequence generation [PDF]
, 2015 Biological sequences carry a lot of important genetic information of organisms. Furthermore, there is an inheritance law related to protein function and structure which is useful for applications such as disease prediction.
Davis, Darryl N. +2 more
core +1 more source
Pattern Mining on Stars with FP-Growth [PDF]
, 2010 Most existing data mining (DM) approaches look for patterns in a single table. Multi-relational DM approaches, on the other hand, look for patterns that involve multiple tables. In recent years, the most common DM techniques have been extended to the multirelational case, but there are few dedicated to star schemas.
Andreia Silva, Cláudia Antunes
openaire +1 more source
Improved Balanced Parallel FP-Growth with MapReduce
DEStech Transactions on Computer Science and Engineering, 2017 The existing parallel FP-Growth algorithm have solved the problems such as the partition of transaction dataset, which can guarantee that each transaction dataset is independent after the partition, but there are still many problems such as too many iterations in the process of FP-tree mining on single node and low efficiency.
Qing YANG +3 more
openaire +2 more sources