On the complexity of inducing categorical and quantitative association rules

Details On the complexity of inducing categorical and quantitative association rules On the complexity of inducing categorical and quantitative association rules

2001-11-06

arxiv.org/abs/cs/0111009v1

Computer Science

Computational Complexity

Scientific paper

Inducing association rules is one of the central tasks in data mining applications. Quantitative association rules induced from databases describe rich and hidden relationships holding within data that can prove useful for various application purposes (e.g., market basket analysis, customer profiling, and others). Even though such association rules are quite widely used in practice, a thorough analysis of the computational complexity of inducing them is missing. This paper intends to provide a contribution in this setting. To this end, we first formally define quantitative association rule mining problems, which entail boolean association rules as a special case, and then analyze their computational complexities, by considering both the standard cases, and a some special interesting case, that is, association rule induction over databases with null values, fixed-size attribute set databases, sparse databases, fixed threshold problems.

Affiliated with

Also associated with

No associations

Rating

On the complexity of inducing categorical and quantitative association rules 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 On the complexity of inducing categorical and quantitative association rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of inducing categorical and quantitative association rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-433739