2017
DOI: 10.1155/2017/6978146
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Apriori Algorithm Based on an Evolution-Communication Tissue-Like P System with Promoters and Inhibitors

Abstract: Apriori algorithm, as a typical frequent itemsets mining method, can help researchers and practitioners discover implicit associations from large amounts of data. In this work, a fast Apriori algorithm, called ECTPPI-Apriori, for processing large datasets, is proposed, which is based on an evolution-communication tissue-like P system with promoters and inhibitors. The structure of the ECTPPI-Apriori algorithm is tissue-like and the evolution rules of the algorithm are object rewriting rules. The time complexit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 26 publications
(21 citation statements)
references
References 19 publications
0
21
0
Order By: Relevance
“…Vertical data is more efficient than horizontal data in the process of obtaining the support of items because an algorithm only needs to read the columns related to a query, but does not need to read other unnecessary columns. For instance, if the support of itemset {I 1 I 2 } is needed in Table 1, an algorithm just needs to read and intersect the TID_sets of I 1 and I 2 and find support (I 1 I 2 ) = Num[ (1,4,5,7,8,9)∩ (1,2,3,4,6,8,9)] = Num(1, 4, 8, 9) = 4, instead of scanning the entire database as using horizontal data. Table 1.…”
Section: The Eclat Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…Vertical data is more efficient than horizontal data in the process of obtaining the support of items because an algorithm only needs to read the columns related to a query, but does not need to read other unnecessary columns. For instance, if the support of itemset {I 1 I 2 } is needed in Table 1, an algorithm just needs to read and intersect the TID_sets of I 1 and I 2 and find support (I 1 I 2 ) = Num[ (1,4,5,7,8,9)∩ (1,2,3,4,6,8,9)] = Num(1, 4, 8, 9) = 4, instead of scanning the entire database as using horizontal data. Table 1.…”
Section: The Eclat Algorithmmentioning
confidence: 99%
“…To verify the efficiency of the two improvements introduced into the original Eclat algorithm, ETPAM with rules executed serially is used to compare with those of Apriori [7], Fp-growth [24], and the original Eclat algorithm [25]. The total running time is used as a metric to evaluate performance in experiments.…”
Section: Efficiency Of the Proposed Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The effectiveness and feasibility of the proposed method in ARM has been proved. Liu et al [12] proposed a fast Apriori algorithm, called ECTPPI-Apriori, for processing large datasets. The algorithm uses a parallel mechanism in the ECPI tissue-like P system.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Liu and Xue [31] proposed a new cluster splitting technique based on Hopfield neural networks and P systems. Liu et al [32] presented an improved Apriori algorithm, named ECTPPT-Apriori, based on evolution-communication tissue-like P systems with promoters and inhibitors. Peng et al [33] designed a tissue-like membrane system with a fully connected structure using an inherent mechanism to deal with automatic clustering problems.…”
Section: Introductionmentioning
confidence: 99%