Association Rule Mining for the QSAR Problem
Langdon, W. B. & Barrett, S. J. (2004). Genetic
Programming in Data Mining for Drug Discovery.
Evolutionary Computing in Data Mining, Springer,
2004, Ashish Ghosh and Lakhmi C. Jain, 163, Studies
in Fuzziness and Soft Computing, 10, ISBN 3-540-
22370-3, pp. 211--235.
Neagu, C.D., Benfenati, E., Gini, G., Mazzatorta, P.,
Roncaglioni, A., (2002). Neuro-Fuzzy Knowledge
Representation for Toxicity Prediction of Organic
Compounds. Proceedings of the 15th European Con-
ference on Artificial Intelligence, Frank van Harmelen
(Ed.):, ECAI’2002, Lyon, France, July 2002. IOS Press
2002: pp. 498-502.
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L.
(1999, January). Discovering frequent closed itemsets
for association rules. Database Theory International
Conference, ICDT’99, Jerusalem, Israel, 398-416.
Pei, J., Han, J., & Mao, R. (2000, May). CLOSET: An
efficient algorithm for mining frequent closed itemsets.
Data Mining and Knowledge Discovery Conference,
DMKD 2000, Dallas, Texas, 11-20.
Wang, Z., Durst, G., Eberhart, R., Boyd, D., & Ben-
Miled, Z., (2004). Particle Swarm Optimization and
Neural Network Application for QSAR. Proceedings
of the 18th International Parallel and Distributed
Processing Symposium (IPDPS 2004), 26-30 April
2004, Santa Fe, New Mexico, USA. IEEE Computer
Society 2004, ISBN 0-7695-2132-0.
Zaki, M. J., & Ogihara, M. (1998, June). Theoretical
foundations of association rules. In 3rd Research Issues
in Data Mining and Knowledge Discovery ACM SIG-
MOD Workshop, DMKD’98, Seattle, Washington.
Zaki, M. J., & Hsiao, C. J. (1999). CHARM: An Ef-
ficient Algorithm for Closed Association Rule Mining,
Technical Report 99-10, Department of Computer
Science, Rensselaer Polytechnic Institute.
KEY TERMS
Association Rule: Pair of frequent itemsets (A,
B), where the ratio between the support of A∪B and
A itemsets is greater than a predefined threshold, de-
noted minconf.

Closure Operator: Let S be a set and c: ℘(S) →
℘(S); c is a closure operator on S if ∀ X, Y ⊆ S, c
satisfies the following properties:
1. extension, X ⊆ c(X);
2. mononicity, if X⊆Y, then c(X) ⊆ c(Y);
3. idempotency, c(c(X)) = c(X).
Note: s◦t and t◦s are closure operators, when s and
t are the mappings in a Galois connection.
Concept: The Galois connection of the (T, I, D)
context, a concept is a pair (X, Y), X⊆ T, Y⊆ I, that
satisfies s(X)=Y and t(Y)=X. X is called the extent and
Y the intent of the concept (X,Y).
Context: A triple (T, I, D) where T and I are sets
and D ⊆T×I. The elements of T are called objects and
the elements of I are called attributes. For any t ∈T
and i ∈ I, we note tDi when t is related to i, i.e. ( t, i)
∈ D.
Frequent Itemset: Itemset with support higher than
a predefined threshold, denoted minsup.
Galois Connection: Let (T, I, D) be a context.
Then the mappings
s: ℘(T)→ ℘(I), s(X) = { i∈ I | (∀t ∈X) tDi }
t: ℘(I)→ ℘(T), s(Y) = { t∈ T | (∀i ∈Y) tDi }
define a Galois connection between ℘(T) and ℘(I),
the power sets of T and I, respectively.
Itemset: Set of items in a Boolean database D,
I={i1, i2, … in}.
Itemset Support: The ratio between the number of
transactions in D comprising all the items in I and the
total number of transactions in D (support(I) = |{Ti∈D|
(∀ij∈I) ij∈ Ti }| / |D|).
Pseudo-Intent: The set X is a pseudo-intent if X ≠
c(X), where c is a closure operator, and for all pseudo-
intents Q⊂ X, c(Q) ⊆X.