Mining single pass weighted pattern tree

Olivia Castelino, Preetham Kumar, Srivatsa Maddodi

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Weighted tree mining has become an important research topic in Data mining. There are several algorithms for mining Frequent Pattern trees. FP growth algorithm using FP tree has been considered for frequent pattern mining because of its enormous performance and development compared to the candidate generation model of Apriori. The purpose of our work is to provide a tree structure for incremental and interactive weighted pattern mining by only one database scan. It is applied to existing Compact pattern (CP) tree. CP tree dynamically achieves frequency-descending prefix tree structure with a single-pass by applying tree restructuring technique and considerably reducing the mining time. It is competent of using prior tree structures and acquires mining outcomes to decrease the computation by incredible amount. Performance analysis show that our tree structure is very efficient for incremental and interactive weighted pattern mining.

Original languageEnglish
Title of host publicationData Engineering and Management - Second International Conference, ICDEM 2010, Revised Selected Papers
Number of pages8
Publication statusPublished - 15-03-2012
Event2nd International Conference on Data Engineering and Management, ICDEM 2010 - Tiruchirappalli, India
Duration: 29-07-201031-07-2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6411 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd International Conference on Data Engineering and Management, ICDEM 2010

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Theoretical Computer Science


Dive into the research topics of 'Mining single pass weighted pattern tree'. Together they form a unique fingerprint.

Cite this