REVIEW 2 cited by
An Improved Apriori Algorithm for Association Rules
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
There are several mining algorithms of association rules. One of the most popular algorithms is Apriori that is used to extract frequent itemsets from large database and getting the association rule for discovering the knowledge. Based on this algorithm, this paper indicates the limitation of the original Apriori algorithm of wasting time for scanning the whole database searching on the frequent itemsets, and presents an improvement on Apriori by reducing that wasted time depending on scanning only some transactions. The paper shows by experimental results with several groups of transactions, and with several values of minimum support that applied on the original Apriori and our implemented improved Apriori that our improved Apriori reduces the time consumed by 67.38% in comparison with the original Apriori, and makes the Apriori algorithm more efficient and less time consuming.
Forward citations
Cited by 2 Pith papers
-
BSODiag: A Global Diagnosis Framework for Batch Servers Outage in Large-scale Cloud Infrastructure Systems
BSODiag is an unsupervised framework that fuses alerts, incidents, and changes, mines historical failure correlations, and uses a random walk on an event graph to locate outage root causes and propagation paths.
-
Intelligent Spectrum Management in Satellite Communications
A survey of intelligent dynamic spectrum management for satellite networks, covering regulations, cognitive radio techniques, AI/ML methods, and performance metrics for Cognitive Satellite (CogSat) systems.
Discussion (0). Continue with ORCID to comment.