Irreducible Frequent Patterns in Transactional Databases

Details Irreducible Frequent Patterns in Transactional Databases Irreducible Frequent Patterns in Transactional Databases

2005-12-13

arxiv.org/abs/cs/0512054v1

Computer Science

Data Structures and Algorithms

30 pages, 18 figures

Scientific paper

Irreducible frequent patters (IFPs) are introduced for transactional databases. An IFP is such a frequent pattern (FP),(x1,x2,...xn), the probability of which, P(x1,x2,...xn), cannot be represented as a product of the probabilities of two (or more) other FPs of the smaller lengths. We have developed an algorithm for searching IFPs in transactional databases. We argue that IFPs represent useful tools for characterizing the transactional databases and may have important applications to bio-systems including the immune systems and for improving vaccination strategies. The effectiveness of the IFPs approach has been illustrated in application to a classification problem.

Affiliated with

Also associated with

No associations

Rating

Irreducible Frequent Patterns in Transactional Databases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Irreducible Frequent Patterns in Transactional Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Irreducible Frequent Patterns in Transactional Databases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-81334