An efficient algorithm for fuzzy frequent itemset mining
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Association-rule mining (ARM) has concerned as an important and critical research issue in the field of data analytics and mining that aims at finding the correlations among the items in binary databases. However, the conventional algorithms considered the frequency of the item(set) in binary databases for ARM, which is not sufficient in real-life situations. Mining of useful information is not an easy task especially if the item(set) consists of the added values. Moreover, the discovered knowledge is not easy to understand if you are not the domain experts. For the past decades, several intelligent systems involved the fuzzy-set theory for many domains and applications due to it is interpretable for human reasoning. Before, the Apriori-based method for discovering fuzzy frequent itemsets (FFIs) based on the type-2 fuzzy-set theory was proposed, which requires the amount of computations with enormous candidates. In this study, we then first present a fast list-based multiple fuzzy frequent itemset mining (named as LFFT2)algorithm under type-2 fuzzy-set theory. It is developed by the type-2 membership functions to retrieve the multiple fuzzy frequent itemsets for presenting more useful and meaningful knowledge for making the efficient strategies or decisions. From the results shown in the experiments, it is clear to see that the developed LFFT2 outperforms the conventional Apriori-based approach regarding the execution time and the number of examined nodes in the search space.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it