ASSOCIATION RULE MINING USING NEW FP-LINKED LIST ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SOHRABI MOHAMMAD KARIM; HASANNEJAD MARZOONI HAMIDREZA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER RESEARCH Year:2016 | Volume:7 | Issue:1 (23) Page(s): 23-34

Download Full-Text

View:

375

Download:

380

Cites:

Information Journal Paper

Title

ASSOCIATION RULE MINING USING NEW FP-LINKED LIST ALGORITHM

Author(s)

SOHRABI MOHAMMAD KARIM | HASANNEJAD MARZOONI HAMIDREZA | Issue Writer Certificate

Keywords

ASSOCIATION RULE MINING

SUPPORT

FREQUENT PATTERN

FP-GROWTH ALGORITHM

ITEMSET

Abstract

Finding FREQUENT PATTERNs plays a key role in exploring association patterns, correlation, and many other interesting relationships that are applicable in TDB. Several ASSOCIATION RULE MINING algorithms such as Apriori, FP-Growth, and Eclat have been proposed in the literature. FP-GROWTH ALGORITHM construct a tree structure from transaction database and recursively traverse this tree to extract FREQUENT PATTERNs which satisfies the minimum SUPPORT in a depth first search manner. Because of its high efficiency, several FREQUENT PATTERN mining methods and algorithms have used FP-Growth’s depth first exploration idea to mine FREQUENT PATTERNs. These algorithms change the FP-tree structure to improve efficiency. In this paper, we propose a new FREQUENT PATTERN mining algorithm based on FP-Growth idea which is using a bit matrix and a linked list structure to extract FREQUENT PATTERNs. The bit matrix transforms the dataset and prepares it to construct as a linked list which is used by our new FPBitLink Algorithm. Our performance study and experimental results show that this algorithm outperformed the former algorithms.

Cites

No record.

References

No record.

Cite

APA: Copy

SOHRABI, MOHAMMAD KARIM, & HASANNEJAD MARZOONI, HAMIDREZA. (2016). ASSOCIATION RULE MINING USING NEW FP-LINKED LIST ALGORITHM. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 7(1 (23)), 23-34. SID. https://sid.ir/paper/328822/en

Vancouver: Copy

SOHRABI MOHAMMAD KARIM, HASANNEJAD MARZOONI HAMIDREZA. ASSOCIATION RULE MINING USING NEW FP-LINKED LIST ALGORITHM. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2016;7(1 (23)):23-34. Available from: https://sid.ir/paper/328822/en

IEEE: Copy

MOHAMMAD KARIM SOHRABI, and HAMIDREZA HASANNEJAD MARZOONI, “ASSOCIATION RULE MINING USING NEW FP-LINKED LIST ALGORITHM,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 7, no. 1 (23), pp. 23–34, 2016, [Online]. Available: https://sid.ir/paper/328822/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops