TITLE

Efficient Mining Algorithms of Finding Frequent Datasets

AUTHOR(S)
Lijuan Zhou; Zhang Zhang
PUB. DATE
April 2012
SOURCE
Journal of Software (1796217X);Apr2012, Vol. 7 Issue 4, p727
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This work proposes an efficient mining algorithm to find maximal frequent item sets from relational database. It adapts to large datasets.Itemset is stored in list with special structure. The two main lists called itemset list and Frequent itemset list are created by scanning database once for dividing maximal itemsets into two categories depending on whether the itemsets to achieve minimum support number. Sub itemsets whose superset is in itemset list are generated by recursion to make sure that each sub itemsets appeared before its superset. As current sub itemsets being joined to frequent itemset list, its sub itemsets are pruned from the itemset list. At last, all sub itemsets whose nearest superset is in frequent itemset list are pruned from the frequent itemset list to hold all maximal frequent itemsets.We compare our algorithms and FP-Growth by two sets of time-consuming experiments to prove the superiority of our efficient algorithm both not only with increasing datasets but also with changing mini-support.
ACCESSION #
76109675

 

Related Articles

  • Parallel Algorithms for the Generalized Same Generation Query in Deductive Databases. Arman, Nabil // Journal of Digital Information Management;Sep2006, Vol. 4 Issue 3, p192 

    The intelligence of traditional database systems can be improved by recursion. Using recursion, relational database systems are extended into knowledgebase systems (deductive database systems). Linear recursion is the most frequently found type of recursion in deductive databases. Deductive...

  • Study and Analysis of Data mining Algorithms for Healthcare Decision Support System. Dey, Monali; Swarup Rautaray, Siddharth // International Journal of Computer Science & Information Technolo;2014, Vol. 5 Issue 1, p470 

    Data mining technology provides a user oriented approach to novel and hidden information in the data. Valuable knowledge can be discovered from application of data mining techniques in healthcare system. Data mining in healthcare medicine deals with learning models to predict patients' disease....

  • Software Specifications Mining using Transaction Mapping Algorithm.  // International Journal of Computer Applications;Dec2010, Vol. 12, p26 

    The article presents a study on software specification mining using a transaction mapping algorithm. It offers information on specification mining which aims to automatically infer suggested specifications of a computer program from its execution traces. It discusses the TM-TraceMiner algorithm...

  • Static Specification Mining Using Automata-Based Abstractions. Shoham, Sharon; Yahav, Eran; Fink, Stephen J.; Pistoia, Marco // IEEE Transactions on Software Engineering;Sep/Oct2008, Vol. 34 Issue 5, p651 

    We present a novel approach to client-side mining of temporal API specifications based on static analysis. Specifically, we present an interprocedural analysis over a combined domain that abstracts both aliasing and event sequences for individual objects. The analysis uses a new family of...

  • MINING POSITIVE AND NEGATIVE ASSOCIATION RULES. Sumalatha, R.; Ramasubbareddy, B. // International Journal on Computer Science & Engineering;2010, p2916 

    Association rule mining is one of the most popular data mining techniques to find associations among items in a set by mining necessary patterns in a large database. Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association...

  • Header Table Recursion Algorithm for Mining Frequent Patterns. Tianjun LU; Si TIAN; Shui WANG // Advances in Information Sciences & Service Sciences;Jan2013, Vol. 5 Issue 2, p769 

    FP-Growth is a classical and important algorithm for frequent itemsets mining in data mining; it employs the recursive mining method for the mining process; with each recursion, a new FP-tree and the corresponding header table are built. So its time and memory space performance decreases with...

  • U-Compare: share and compare text mining tools with UIMA. Yoshinobu Kano; William A. Baumgartner; Luke McCrohon; Sophia Ananiadou; K. Bretonnel Cohen; Lawrence Hunter; Junichi Tsujii // Bioinformatics;Aug2009, Vol. 25 Issue 15, p1997 

    Summary: Due to the increasing number of text mining resources (tools and corpora) available to biologists, interoperability issues between these resources are becoming significant obstacles to using them effectively. UIMA, the Unstructured Information Management Architecture, is an open...

  • Guest Editorial: Special Section on the International Symposium on Software Testing and Analysis 2010. Orso, Alessandro; Tonella, Paolo // IEEE Transactions on Software Engineering;Feb2012, Vol. 38 Issue 2, p241 

    An introduction is presented in which the editor discusses various papers within the issue on topics including dynamic specification mining, code vulnerabilities leading to loading of malicious content, and fault-localization algorithms used on web applications.

  • jCompoundMapper: An open source Java library and command-line tool for chemical fingerprints. Hinselmann, Georg; Rosenbaum, Lars; Jahn, Andreas; Fechner, Nikolas; Zell, Andreas // Journal of Cheminformatics;2011, Vol. 3 Issue 1, p1 

    Background: The decomposition of a chemical graph is a convenient approach to encode information of the corresponding organic compound. While several commercial toolkits exist to encode molecules as so-called fingerprints, only a few open source implementations are available. The aim of this...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics