article · 2013

An improved apriori algorithm

Cited by 1Abstract and details only

Abstract

Apriori algorithm is a classical algorithm in data mining association rules.However the algorithm scans the database so many times causes that it runs too slowly.A new Apriori algorithm is proposed after Apriori is analyzed.The main idea of the new Apriori algorithm is that transaction database is converted to corresponding 0-1 matrix,whose each vector and subsequent vector does inner product operation to get support.Comparing with the given minsupport,it deletes the rows and columns if they are less than the minsupport to reducing the size of the rating matrix.It makes the computing more efficient paper It runs slowly as it scans the database frequently.The improved algorithm only needs to scan the database once so that it runs quickly.The experiment results prove that it is efficient and feasible for the improved algorithm.

Cite this paper

APA 7

Bai, D. (2013). An improved apriori algorithm.

MLA 9

Bai, Dongling. “An improved apriori algorithm.” 2013.

Chicago

Bai, Dongling. 2013. “An improved apriori algorithm.”

Harvard

Bai, D. (2013) ‘An improved apriori algorithm’.

BibTeX

@article{bai2013improved,
  title = {{An improved apriori algorithm}},
  author = {Bai, Dongling},
  year = {2013}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.