Geodesic
On the non-redundant representation of the minimax basis of strong associations
Prikladnaâ diskretnaâ matematika, no. 2 (2017), pp. 113-126.

Voir la notice de l'article provenant de la source Math-Net.Ru

Associative rules are the type of dependencies between data that reflect which features or events occur together and how often this happens. Strong associative rules are of interest for those applications where a high degree of confidence of dependencies is required. For example, they are used in information security, computer network analysis and medicine. Excessively large number of identified rules significantly complicates their expert analysis and application. To reduce the severity of this problem, we propose the MClose algorithm, which extends the capabilities of the well-known algorithm Close. The Close algorithm forms a minimax basis in which each strong associative rule has a minimum premise and a maximal consequence. However, in the minimax basis, some redundant strong associative rules remain. The MClose algorithm recognizes and eliminates them in the process of constructing a minimax basis. The proposed algorithm is based on the properties of closed sets. Its correctness is proved by proving the reflexivity, additivity, projectivity, and transitivity properties of strong associative rules.
Mots-clés : Galois connection
Keywords: closed sets, strong association rules, non-redundant, minimax basis. 
@article{PDM_2017_2_a8,
     author = {V. V. Bykova and A. V. Kataeva},
     title = {On the non-redundant representation of the minimax basis of strong associations},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {113--126},
     publisher = {mathdoc},
     number = {2},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2017_2_a8/}
}
TY  - JOUR
AU  - V. V. Bykova
AU  - A. V. Kataeva
TI  - On the non-redundant representation of the minimax basis of strong associations
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2017
SP  - 113
EP  - 126
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2017_2_a8/
LA  - ru
ID  - PDM_2017_2_a8
ER  - 
%0 Journal Article
%A V. V. Bykova
%A A. V. Kataeva
%T On the non-redundant representation of the minimax basis of strong associations
%J Prikladnaâ diskretnaâ matematika
%D 2017
%P 113-126
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2017_2_a8/
%G ru
%F PDM_2017_2_a8
V. V. Bykova; A. V. Kataeva. On the non-redundant representation of the minimax basis of strong associations. Prikladnaâ diskretnaâ matematika, no. 2 (2017), pp. 113-126. http://geodesic.mathdoc.fr/item/PDM_2017_2_a8/

[1] Vityaev E. E., Demin A. V., Ponomaryov D. K., “Probabilistic generalization of formal concepts”, Programming and Computer Software, 2012, no. 5, 219–230 | DOI | MR | Zbl

[2] Gorodetskiy V. I., Samoylov V. V., “Association and Casual rule mining using associative Bayesian networks”, Tr. SPIIRAN, 2009, no. 9, 13–65 (in Russian)

[3] Kuznetsov S. O., “Machine learning on the basis of formal concept analysis”, Automation and Remote Control, 62:10 (2001), 1543–1564 | DOI | MR | Zbl

[4] Birkhoff G., Bartee T. C., Modern Applied Algebra, McGraw-Hill, N.Y., 1970, 431 pp. | MR | Zbl

[5] Gurov S. I., Boolean Algebras, Ordered Sets, Lattices: Definitions, Properties, Examples, LIBROKOM Publ., Moscow, 2013, 352 pp. (in Russian)

[6] Ganter B., Wille R., Formal Concept Analyses: Mathematical Foundations, Springer Science and Business Media, 2012, 314 pp. | MR

[7] Pasquier N., Bastide Y., Taoui R., Lakhal L., “Generating a condensed representation for association rules”, J. Intelligent Inform. Systems, 24:1 (2005), 29–60 | DOI | Zbl

[8] Maier D., Theory of Relational Databases, Computer Science Pr., 1983, 640 pp. | MR | Zbl

[9] Batura T. V., “Social networks analysis models and methods”, Programmnye Produkty i Sistemy, 2013, no. 3, 130–137 (in Russian)

[10] Platonov V. V., Semenov P. O., “Dimension reduction in network attacks detection systems”, Information Security Problems. Computer Systems, 2012, no. 3, 40–45 (in Russian)

[11] Ilayaraja M., Meyyappan T., “Mining medical data to identify frequent diseases using Apriori algorithm”, Pattern Recognition, Informatics and Mobile Engineering, PRIME, IEEE, 2013, 194–199

[12] Duquenne V., Obiedkov S. A., “Attribute-incremental construction of the canonical implication basis”, Ann. Math. Artif. Intelligence, 49:1 (2007), 77–99 | MR | Zbl

[13] Rudolph S., “Some notes on pseudo-closed sets”, LNCS, 4390, 2007, 151–165 | Zbl

[14] Zaki M. J., Hsiao C.-J., “Efficient algorithms for mining closed itemsets and their lattice structure”, IEEE Trans. Knowledge Data Eng., 17:4 (2005), 462–478 | DOI

[15] Uno T., Asai T., Uchida Y., Arimura H., “An efficient algorithm for enumerating closed patterns in transaction databases”, LNCS, 3245, 2004, 16–31 | Zbl

[16] Zhang C., Zhang S., Association Rules Mining, Springer, 2002, 240 pp.

[17] Geng L., Hamilton H. J., “Interestingness measures for data mining: a survey”, ACM Computing Surveys, 38:3 (2006), Article 9 | DOI