The principle of selecting adequate algorithms for the parallel implementation of the similarity method in the DSM system problem solver is described. The most advanced family of algorithms for parallel modifications is identified and its different representatives are considered. A number of algorithms and their parallel versions in C++ are experimentally implemented for overall optimization. The experimental results are used in assessing the paralleling method, and further advancements and lines of research are provided.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Finn, V.K., Inductive methods of J.S. Mill in artificial intelligence systems. Part I, Iskusstv. Intell. Prinyat. Reshenii, 2010, no. 3, pp. 3–21.
Finn, V.K., Inductive methods of J.S. Mill in artificial intelligence systems. Part II, Iskusstv. Intell. Prinyat. Reshenii, 2010, no. 3, pp. 14–40.
Finn, V.K., On determination of empirical regularities using the JSM-automatic method for generation of hypotheses, Iskusstv. Intell. Prinyat. Reshenii, 2010, no. 4.
Anshakov, O.M., The JSM method: A set-theoretical explanation, Autom. Doc. Math. Linguist., 2012, vol. 46, no. 5, pp. 202–220.
Kuznetsov, S.O. and Obiedkov, S.A., Comparing performance of algorithms for generating concept lattices, J. Exp. Theor. Artif. Intell., 2002, vol. 14, no. 2–3, pp. 189–216.
Norris, E.M., An algorithm for computing the maximal rectangles in a binary relation, Revue Roumaine de Mathematiques Pures et Appliquees, 1978, no. 23(2), pp. 243–250.
Ganter, B. and Wille, R., Formal Concept Analysis: Mathematical Foundations, Berlin: Springer-Verlag, 1999.
Chein, M., Algorithme de recherche des sous-matrices premieres d’une matrice, Bull. Math. Soc. Sci. Math. R.S. Roumanie, 1969, vol. 13, pp. 21–25.
Bordat, J.P., Calcul pratique du treillis de Galois d’une correspondence, Math. Sci. Hum., 1986, vol. 96, pp. 31–47.
Troy, A.D., Faster concept analysis, Proc. 15th Int. Conf. on Conceptual Structures (ICCS), 2007.
Sutter, H., The free lunch is over–A fundamental turn toward concurrency in software, Dr. Dobb’s J., 2005, vol. 30.
Krajca, P., Outrata, J., and Vychodil, V., Parallel recursive algorithm for FCA, Proc. CLA CEUR WS 433, 2008, pp. 71–82.
Krajca, P., Outrata, J., and Vychodil, V., Advances in algorithms based on CbO, Proc. CLA, 2010, pp. 325–337.
Andrews, S., A 'Best-of-Breed’ approach for designing a fast algorithm for computing fixpoints of galois connections, Inf. Sci., 2015, pp. 633–649.
Andrews, S., In-Close, a fast algorithm for computing formal concepts, Suppl. Proc. ICCS'09 CEUR WS 483, 2009.
Outrata J., Vychodil V. Fast algorithm for computing fixpoints of Galois connections induced by objectattribute relational data, Inf. Sci., 2012, pp. 114–127.
Original Russian Text © D.L. Ol’shanskii, 2015, published in Nauchno-Tekhnicheskaya Informatsiya, Seriya 2, 2015, No. 7, pp. 1–12.
About this article
Cite this article
Ol’shanskii, D.L. Selection of an algorithm for the parallel implementation of the similarity method in intelligent DSM systems. Autom. Doc. Math. Linguist. 49, 109–116 (2015). https://doi.org/10.3103/S0005105515040032