nach oben

Automatic Documentation and Mathematical Linguistics

Erschienen in:

01.09.2019 | INFORMATION ANALYSIS

A Probabilistic Algorithm for Calculating Similarities

verfasst von: D. V. Vinogradov

Erschienen in: Automatic Documentation and Mathematical Linguistics | Ausgabe 5/2019

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In this paper, we describe a new probabilistic algorithm for calculating hypotheses as the results of similarities between training examples for a machine learning problem based on a binary similarity operation. Unlike previously proposed probabilistic algorithms, the order of accounting for training examples is fixed for all hypotheses. This algorithm is useful for implementation using a GPGPU. The main result of this paper is the independence of the order of the appearance of training examples of the probabilities of each similarity in the sample.

Vorheriger Artikel Comparison of Data Representation Languages in the Structure–Activity Problem

Nächster Artikel Academies of Sciences in Western Europe: Analysis of Activities, Web Content, and Webometric Indicators

DSM-metod avtomaticheskogo porozhdeniya gipotez: Logicheskie i epistemologicheskie osnovaniya (JSM Method for Automatic Hypothesis Generation: Logical and Epistemological Foundations), Finn, V.K. and Anshakov, O.M., Eds., Moscow: Editorial-URSS, 2009.

Ganter, B. and Wille, R., Formal Concept Analysis, Berlin: Springer-Verlag, 1999.CrossRef

Vinogradov, D.V., The rate of convergence to the limit of the probability of encountering an accidental similarity in the presence of counter examples, Autom. Doc. Math. Linguist., 2018, vol. 52, no. 1, pp. 35–37.CrossRef

Vinogradov, D.V., Accidental formal concepts in the presence of counterexamples, Proceedings of International Workshop on Formal Concepts Analysis for Knowledge Discovery (FCA4KD 2017):CEUR Workshop Proceedings, 2017, vol. 1921, pp. 104–112.

Vinogradov, D.V., Random generation of hypotheses in the JSM method using simple Markov chains, Autom. Doc. Math. Linguist., 2012, vol. 46, no. 5, pp. 221–228.CrossRef

Vinogradov, D.V., Machine learning based on similarity operation, Commun. Comput. Inf. Sci., 2018, vol. 934, pp. 46–59.

Vinogradov, D.V., The reliability of analogy-based prediction, Autom. Doc. Math. Linguist., 2017, vol. 51, no. 4, pp. 191–195.CrossRef

Vapnik, V.N. and Chervonenkis, A.Ya., Teoriya raspoznavaniya obrazov (statisticheskie problemy obucheniya) (Pattern Recognition Theory (Statistical Learning Problems)), Moscow: Nauka, 1974.

Davey, B.A. and Priestley, H.A., Introduction to Lattices and Order, Cambridge: Cambridge University Press, 2002, 2nd ed.CrossRef

10.

Vinogradov, D.V., On object representation by bit strings for the VKF-method, Autom. Doc. Math. Linguist., 2018, vol. 52, no. 3, pp. 113–116.CrossRef

Titel: A Probabilistic Algorithm for Calculating Similarities
verfasst von: D. V. Vinogradov
Publikationsdatum: 01.09.2019
Verlag: Pleiades Publishing
Erschienen in: Automatic Documentation and Mathematical Linguistics / Ausgabe 5/2019
Print ISSN: 0005-1055
Elektronische ISSN: 1934-8371
DOI: https://doi.org/10.3103/S0005105519050042

Springer Professional

A Probabilistic Algorithm for Calculating Similarities

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 5/2019

On the Heuristics of JSM Research (Additions to Articles)

Intellectual Mining of Patient Data with Melanoma for Identification of Disease Markers and Critical Genes

Comparison of Data Representation Languages in the Structure–Activity Problem

An Intelligent System for Diagnostics of Pancreatic Diseases

Academies of Sciences in Western Europe: Analysis of Activities, Web Content, and Webometric Indicators

Premium Partner