An Adjunct Quick Mining in Closed Persistent Patterns (AQCPP)

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 8, Issue 5

Abstract

 Closed persistent patterns in data mining is biggest challenge in these days. The existing models find these patterns from traditional and transactional databases. This paper approach a novel model to mine closed persistent patterns using the invert matrix for any given traditional data file or for any raw sequential data and adjunct closed persistent element matrix which reduces the consumption of number of iterations or search space for retrieving various persistent patterns of deferent elements. We approach adjunct quick mining in closed persistent patterns (AQCPP) matrix to reduce the iterate levels i.e. the l and l+1 levels in mining conditions. Iteration time improvement is the clear output over the ancestors work in this process. Our experiments resulted efficient quick mining process throughout our analysis the algorithms performed efficiently with less computations. As a case study we also implemented our inline mechanism over Service Patterns to analyze the performance of the proposed AQCPP algorithm over lightweight directories and our results are satisfactory

Authors and Affiliations

K. V Subbaraju

Keywords

Related Articles

 Optimal Content Downloading in Vehicular Networks

 Abstract: We consider a system where users aboardcommunication-enabled vehicles are interested in downloading different contents from Internet-based servers. This scenario captures many of the infotainment services...

 Knowledge Management in Software Enterprise

 Knowledge management is expected to be integral part any software development and services companies. Knowledge has become an important capital for many organizations in the international competition. So knowle...

 Cloud Computing –Its Prospects and Challenges

 Abstract: The extensive use of information and communication technology has transformed manufacturing organizations and economies into information centric and customer focused organizations. In present times, the i...

 Detection of Replica Nodes in Wireless Sensor Network: A Survey

 Abstract: Network security has become a challenging area, historically only tackled by well qualified andfamiliar experts. Although more pupils are becoming wired, an increasing number of pupils need to understandb...

 Processing of Top-k Selection Queries in Relational Database System

 Abstract: In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typically a rank of the top-k tu...

Download PDF file
  • EP ID EP93398
  • DOI -
  • Views 97
  • Downloads 0

How To Cite

K. V Subbaraju (2013).  An Adjunct Quick Mining in Closed Persistent Patterns (AQCPP). IOSR Journals (IOSR Journal of Computer Engineering), 8(5), 79-84. https://europub.co.uk/articles/-A-93398