Filters








153,612 Hits in 5.9 sec

Incremental mining of sequential patterns: Progress and challenges

Bhawna Mallick, Deepak Garg, P.S. Grover
2013 Intelligent Data Analysis  
This article investigates the need for incremental mining of sequential patterns.  ...  But modern day databases are being continuously updated and are dynamic in nature. So, incremental mining of sequential patterns has become the norm.  ...  IncSP (Incremental Sequential Pattern Update) [29] algorithm is based on combined approaches of effective implicit merging, early candidate pruning and efficient separate counting.  ... 
doi:10.3233/ida-130591 fatcat:ituubtk5ujca3bxmrxyl44zgdm

Incremental Sequential Pattern Tree Mining

Ashin Ara Bithi, Z.M. Tarek Shahriar, Abu Ahmed Ferdaus
2014 IOSR Journal of Computer Engineering  
In this paper, we have proposed an Incremental Sequential Pattern Tree mining algorithm to retrieve new updated frequent sequential patterns from dynamic sequence database.  ...  So that, our proposed algorithm updates the old Sequential Pattern Tree by scanning only the new sequences, does not require to scan the whole updated database (old + new) that reduces the execution time  ...  PrefixSpan Algorithm PrefixSpan [5] is a projection-based, sequential pattern-growth approach for efficient and scalable mining of sequential patterns, which is an extension of FP-growth [9] .  ... 
doi:10.9790/0661-1618110116 fatcat:epw2dqbx7zeqtbnlh27r4rgp4e

Tree Based Incremental Sequential Pattern Mining

Solaiman Mia
2015 Zenodo  
While the new sequences are updated, the already existing tree is revised for the updated sequences and then, mines the updated tree for the new frequent subsequences.  ...  This algorithm builds a Sequential Pattern Tree for both frequent and non-frequent items.  ...  Because, the sequential patterns for the old database may become invalid on the updated database and it is not efficient to mine the updated databases from scratch by scanning the whole updated database  ... 
doi:10.5281/zenodo.3930173 fatcat:ijuckkk5tfg3jhue7ehcl3r5uy

Progressive CFM-Miner: An Algorithm to Mine CFM – Sequential Patterns from a Progressive Database

Bhawna Mallick, Deepak Garg, P. S. Grover
2013 International Journal of Computational Intelligence Systems  
Acknowledgement The authors would like to thank the Editor and anonymous referees for providing valuable comments and constructive suggestions.  ...  We express our gratitude towards the Galgotias College of Engineering and Technology, Greater Noida for the support being provided to complete this research work.  ...  In recent times, developing approaches for incremental mining of sequential patterns has gained immense importance in real life applications.  ... 
doi:10.1080/18756891.2013.768432 fatcat:evdm3rinojdctgipmbqnwvheuy

Revised Plwap Tree With Non-Frequent Items For Mining Sequential Pattern

R. Vishnu Priya, A. Vadivel
2011 Zenodo  
Sequential pattern mining is a challenging task in data mining area with large applications. One among those applications is mining patterns from weblog.  ...  While mining sequential patterns, the links related to the nonfrequent items are not considered.  ...  Among various approaches, tree based approaches are found to be well-known and extracts sequential pattern efficiently.  ... 
doi:10.5281/zenodo.1073589 fatcat:wvw6jwttnvb6roerlo6ur2h7ne

Sequential Mining: Patterns and Algorithms Analysis [article]

Thabet Slimani, Amor Lazzez
2013 arXiv   pre-print
This study gives an enhancement in the understanding of the approaches of sequential pattern mining.  ...  This paper presents and analysis the common existing sequential pattern mining algorithms. It presents a classifying study of sequential pattern-mining algorithms into five extensive classes.  ...  .  IncSP: Proposed in [26] as an efficient incremental updating algorithm used for sequential patterns maintenance after a nontrivial number of data sequences are added to the sequence database.  ... 
arXiv:1311.0350v1 fatcat:dv3eabd3o5gpjarsw62d2ymv4y

Incremental Mining of Sequential Patterns Using Weights

Archana Kollu
2013 IOSR Journal of Computer Engineering  
It would be better if we can use the knowledge of already mined sequential patterns to find the complete set of sequential patterns for updated database.  ...  So after every update a frequent pattern may no longer remains frequent while some infrequent patterns may appear as frequent in updated database.  ...  If we set very high, we will have fewer patterns in SFS, and then the support update for sequences in SFS on LDB will be more efficient.  ... 
doi:10.9790/0661-1457073 fatcat:frgryxz2afdd3dlcjt5p7nxbou

Anonymizing Multiple K-anonymous Shortest Paths for Social Graphs

Shyue-Liang Wang, Zheng-Ze Tsai, Tzung-Pei Hong, I-Hsien Ting, Yu-Chuan Tsai
2011 2011 Second International Conference on Innovations in Bio-inspired Computing and Applications  
In the past, pre-large fast-updated sequential pattern trees (pre-large FUSP tree) were proposed for efficiently mining large sequences for record insertion and deletion, respectively.  ...  In this paper, we thus proposed a maintenance approach for efficiently maintaining pre-large FUSP trees and effectively deriving desired large sequences when data in databases are modified.  ...  proposed the IncSpan (Incremental mining of sequential patterns) algorithm for efficiently mining sequential patterns from a tree structure [4] .  ... 
doi:10.1109/ibica.2011.53 dblp:conf/ibica/WangTHTT11 fatcat:zeggaucvlbbxne7vvryuwsbzra

Efficient Updating of Discovered Patterns for Text Mining: A Survey

Anisha Radhakrishnan, Mathew Kurian
2012 International Journal of Computer Applications  
Researchers are still going in efficient updating of discovered pattern. Polysemy and synonymy are the problem faced in term based approach.  ...  Phrase based approach also did not provide the efficient results.  ...  This algorithm gives the better result and efficient updating of discovered pattern which is extracted from the text document.  ... 
doi:10.5120/9248-3412 fatcat:at5yg5umyzgdllhko5xc773d64

Incremental update on sequential patterns in large databases by implicit merging and efficient counting

Ming-Yen Lin, Suh-Yin Lee
2004 Information Systems  
Current approaches for sequential pattern mining usually assume that the mining is performed in a static sequence database.  ...  Instead of re-mining, the proposed IncSP (Incremental Sequential Pattern Update) algorithm solves the maintenance problem through effective implicit merging and efficient separate counting over appended  ...  Acknowledgements The authors thank the referees for their valuable comments and suggestions.  ... 
doi:10.1016/s0306-4379(03)00036-x fatcat:nrjnoxrffvc73po7rao7fvw3tm

Mining Positive and Negative Sequential Pattern in Incremental Transaction Databases

Vinay KumarKhare, Vedant Rastogi
2013 International Journal of Computer Applications  
Implementation of this approach, construct tree for appended transactions (new upcoming data) and will merge this tree with existing tree (tree of existing transactions) to get the Updated tree.  ...  This approach will reduce the mining time for incremental database if the Existing database has lots of transactions and Appended database having few transactions.  ...  To mine Positive and Negative Sequential patterns in incremental transaction database in this Approach we can update, existing transaction database with appended transaction database by the use of Updated  ... 
doi:10.5120/12322-8539 fatcat:kxcupouuprgt7ml65b2kwcp2ou

An FTL-Agnostic Layer to Improve Random Write on Flash Memory [chapter]

Brice Chardin, Olivier Pasteur, Jean-Marc Petit
2011 Lecture Notes in Computer Science  
In this paper, we propose a simple data placement algorithm designed for flash memories, to reorganize inefficient random writes in a quasi-sequential access pattern.  ...  Database management systems could potentially benefit from flash memories as they provide fast random access for read operations although random writes are generally not as efficient as sequential writes  ...  A frequent design avoids in place updates with log-based methods. The In-Page Logging Approach [8] allocates a portion of each bloc to write updates of its pages.  ... 
doi:10.1007/978-3-642-20244-5_21 fatcat:5ufiectqunfb7oq5sjhcoix3ky

Incremental mining of sequential patterns in large databases

Florent Masseglia, Pascal Poncelet, Maguelonne Teisseire
2003 Data & Knowledge Engineering  
We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database  ...  The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a  ...  To reflect the current state of the database where previous sequential patterns would become irrelevant and new sequential patterns might appear, there is a need for efficient algorithms to update, maintain  ... 
doi:10.1016/s0169-023x(02)00209-4 fatcat:6qkgrhyn3ra7bi32nvj55et5u4

EFFICIENT SUPPORT COUPLED FREQUENT PATTERN MINING OVER PROGRESSIVE DATABASES

Keshavamurthy B.N, Mitesh Sharma, Durga Toshniwal
2010 International Journal of Database Management Systems  
Our proposed novel approach efficiently mines frequent sequential pattern coupled with support using progressive mining tree.  ...  There have been many recent studies on sequential pattern mining.  ...  (i) Apriori based horizontal partitioning methods such as Generalized Sequential Pattern mining [4] , which adopts multiple-pass candidate generation and test approach in sequential pattern mining.  ... 
doi:10.5121/ijdms.2010.2205 fatcat:rcd3usqzvrbhbltd7fewqfd47i

LAST

Sungjin Lee, Dongkun Shin, Young-Jin Kim, Jihong Kim
2008 ACM SIGOPS Operating Systems Review  
Most existing flash translation layer (FTL) schemes are, however, ill-suited for such systems because they were optimized for storage write patterns of embedded systems only.  ...  By exploiting the locality of storage access patterns, LAST reduces the garbage collection overhead significantly, thus increasing the I/O performance of flash-based storage devices.  ...  The ICT at Seoul National University provides research facilities for this study.  ... 
doi:10.1145/1453775.1453783 fatcat:426x55x4fre7ncuudxb2mxh4pq
« Previous Showing results 1 — 15 out of 153,612 results