On Two Apriori-Based Rule Generators: Apriori in Prolog and Apriori in SQL | Zendy

Hiroshi Sakai | Zendy; Kao-Yi Shen | Zendy; Michinori Nakata | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On Two Apriori-Based Rule Generators: Apriori in Prolog and Apriori in SQL

Author(s) -

Hiroshi Sakai,

Kao-Yi Shen,

Michinori Nakata

Publication year - 2018

Publication title -

journal of advanced computational intelligence and intelligent informatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.172

H-Index - 20

eISSN - 1343-0130

pISSN - 1883-8014

DOI - 10.20965/jaciii.2018.p0394

Subject(s) - apriori algorithm , computer science , prolog , sql , association rule learning , generator (circuit theory) , a priori and a posteriori , equivalence (formal languages) , data mining , rule based system , programming language , mathematics , philosophy , epistemology , power (physics) , physics , discrete mathematics , quantum mechanics

This paper focuses on two Apriori-based rule generators. The first is the rule generator in Prolog and C, and the second is the one in SQL. They are named Apriori in Prolog and Apriori in SQL , respectively. Each rule generator is based on the Apriori algorithm. However, each rule generator has its own properties. Apriori in Prolog employs the equivalence classes defined by table data sets and follows the framework of rough sets. On the other hand, Apriori in SQL employs a search for rule generation and does not make use of equivalence classes. This paper clarifies the properties of these two rule generators and considers effective applications of each to existing data sets.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research