Role of Segment Progressive Filter in Dynamic Data mining

Naqvi, Mohsin; Hussain, Kashif; Asghar, Sohail; Fong, Simon
August 2011
Journal of Digital Information Management;Aug2011, Vol. 9 Issue 4, p171
Academic Journal
Association rule mining perhaps the most widely described technique among the minding paradigms. The temporal association rule mining in the association rule mining tries to find relations among items in datasets. The temporal association mining has strength in detecting the dynamic nature of databases. Unfortunately the current mining methods ignore the consideration of database content updates. In the current research we have introduced the Incremental Standing method for Segment Progressive Filter (ISPF). The proposed technique can support the database update and mine updated datasets. We prove that the proposed algorithm is an optimal way of mining. We have applied the scan reduction technique to generate all candidate k-item sets to form 2-candidate item sets directly. We also bring good experimentation to validate and document clearly the algorithm with good examples.


Related Articles

  • The novel approach for improving apriori algorithm for mining association rule. Patil, Suraj P.; Patil, U. M.; Borse, Sonali // World Journal of Science & Technology;2012, Vol. 2 Issue 3, p75 

    The efficiency of mining association rules is an important field of Knowledge Discovery in Databases. The Apriori algorithm is a classical algorithm in mining association rules. This paper presents an improved Apriori algorithm to increase the efficiency of generating association rules. This...

  • How to Buy Data Mining. King, Eric A. // DM Review;Oct2005, Vol. 15 Issue 10, p38 

    The article focuses on the implementation of an organizational data mining process. Data mining refers to computer-aided pattern discovery of previously unknown interrelationships and recurrences across seemingly unrelated attributes in order to predict actions, behaviors and outcomes. The five...

  • Sequential Pattern Mining in Multi-Databases via Multiple Alignment. Hye-Chung Kum; Joong Hyuk Chang; Wei Wang // Data Mining & Knowledge Discovery;May2006, Vol. 12 Issue 2/3, p151 

    To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized information is forwarded to the global mining process. However, conventional sequential pattern mining methods based on...

  • Visualizing Big Data Beyond the Warehouse.  // Database Trends & Applications;Apr/May2014, Vol. 28 Issue 2, p16 

    The article offers helpful information for enterprises when it comes to implementing big data services. It highlights the emergence of new software technologies as well as the new generation of dynamic data discovery visualization. Other critical topics such as databases, documents, and...

  • An Efficient Method for Mining Frequent Weighted Closed Itemsets from Weighted Item Transaction Databases. BAY VO // Journal of Information Science & Engineering;Jan2017, Vol. 33 Issue 1, p199 

    In this paper, a method for mining frequent weighed closed itemsets (FWCIs) from weighted item transaction databases is proposed. The motivation for FWCIs is that frequent weighted itemset mining, as frequent itemset (FI) mining, typically results in a substantial number of rules, which hinders...

  • Data Assurance Road Map, Part 1. Marco, David // DM Review;Dec2004, Vol. 14 Issue 12, p32 

    This article discusses factors to consider in a data assurance project. The state of data management and data assurance can best be classified as abysmal. Most organizations are overran with needless data redundancy, very poor data quality and minimal data understanding. Often, these same...

  • A Pipeline Model to Discover Frequent Itemsets in an Hierarchical Systems. Arour, Khedija // International Journal of Grid & Distributed Computing;Aug2013, Vol. 6 Issue 4, p19 

    Like all the other fields of data processing, the modern information systems have integrated the results of the advanced technologies of the last decades. These systems contain implicit data which it will be necessary to extract and exploit, by using data Mining techniques. Mining association...

  • Classification Rule Discovery with Ant Colony Optimization and Improved Quick Reduct Algorithm. Jaganathan, P.; Thangavel, K.; Pethalakshmi, A.; Karnan, M. // Recent Advances in Engineering & Computer Science;2007, Issue 62, p147 

    Ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. More recently, Parpinelli et al have applied ACO to data mining classification problems, where they introduced a classification algorithm called Ant Miner. In this paper, we present a...

  • Improved VSM for Incremental Text Classification. Zhen Yang; Jianjun Lei; Jian Wang; Xing Zhang; Jim Guo // AIP Conference Proceedings;11/6/2008, Vol. 1060 Issue 1, p369 

    As a simple classification method VSM has been widely applied in text information processing field. There are some problems for traditional VSM to select a refined vector model representation, which can make a good tradeoff between complexity and performance, especially for incremental text...


Read the Article


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

Try another library?
Sign out of this library

Other Topics