Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In context of data mining, what does it mean for an association rule measure to be maximal?

I cannot understand the term maximal in this context.

I know of maximal independent sets in algorithms but cannot make out this term.

share|cite|improve this question
can you be more precise ? where did you read this ? – AJed Jan 13 '13 at 5:49
but usually, a maximal subset $S$ with certain charatestics is a subset such that there is no other subset $S'$ with the same characteristics and $S \subset S$. That is, cannot extended anymore. – AJed Jan 13 '13 at 5:52
I read it in the following paper . If you search for "conviction is truly a measure of implication because it is directional, it is maximal for perfect implications". This is the statement I cannot make out – user1008 Jan 13 '13 at 6:20

I believe that in the context of that paper (PS), you can read "maximal" as "maximized". That is to say, the conviction function $P(A)P(\neg B)/P(A, \neg B)$ attains its greatest value when $A \implies B$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.