A Novel Approach for Enhancing Direct Hashing and Pruning for Association Rule Mining

著者

  • K. Purna Chand J N T U Kakinada
  • Nallam Krishnaiah JNTU HYD
  • G. Uday Kiran JNTU HYD
  • Dr.G. Narsimha JNTU HYD

キーワード:

Association rule mining、 direct hashing and pruning、 frequent pattern tree mining

要旨

 Data Mining has been considered as a promising field in the intersection of databases, artificial intelligence and machine learning. Association rule mining has been one of the most popular data mining subjects, which can be simply defined as finding interesting rules from large collections of data. This paper introduces an enhanced hashing approach in discovering associations for large itemsets. The proposed hashing approach scans the entire database only once using the improved version of Apriori Algorithm termed as Direct Hashing and Pruning (DHP) algorithm. The algorithm determines the frequency of each k-itemset and discovers set of rules from frequent k-itemsets. The application uses the minimum support provided by the domain expert and frequent itemsets are discovered. Later the numbers of k-itemsets are reduced in the pruning phase after scanning the database completely. The proposed approach is not prone to collisions yielding high accuracy.Keywords: Association rule mining, direct hashing and pruning, frequent pattern tree mining 

著者略歴

  • K. Purna Chand、 J N T U Kakinada
    N.Krishnaiah Associate Professor B V C Engineering College Odalarevu EG(dist)-533210 Email;[email protected] ,9490786240
  • Nallam Krishnaiah、 JNTU HYD
    K.Purna Chand Assistant Professor Department of CSE Padamasri Dr.B.V.Raju Institue of Technology Narasapur, Medak Dist. e-mail: [email protected]
  • G. Uday Kiran、 JNTU HYD
    Dr.G.Narsimha Assistant Professor Department of IT JNTU College of Engg. Jagityal e-mail: [email protected]
  • Dr.G. Narsimha、 JNTU HYD
    Dr.G.NarsimhaAssistant ProfessorDepartment of ITJNTU College of Engg. Jagityale-mail:[email protected]

発行日

2012-04-10

巻号

セクション

Research Articles