Loading [MathJax]/jax/output/SVG/config.js
Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.]:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics], 2024, Issue 1, Pages 94–107
DOI: https://doi.org/10.26456/vtpmk705
(Mi vtpmk705)
 

Mathematical Logic, Algebra, Number Theory and Discrete Mathematics

Building associative rules for a database with a target parameter

V. A. Billig

Tver State Technical University, Tver
References:
Abstract: A new efficient algorithm GoalApriori is proposed, which allows you to build associative rules for a special but important case when the original relational database has a target parameter. A classic example of such databases is medical databases, where the diagnosis made by doctors acts as a target parameter. Without loss of generality, we can assume that the target parameter is a discrete type parameter with a fixed set of values. The algorithm builds associative rules, the conclusion of which is the specific value of the target parameter. Premise of rules represents a set of properties of the database input parameters. The source database is reduced to a special format in which the resulting database record is specified as a single integer, regardless of the size of the source database record. In addition to saving memory, this format allows you to fully preserve information about the parameters representing the original record. More importantly, the computationally complex operations on records required to calculate the characteristics of rules are performed in this format almost instantly by a pair of logical operations on integers. The tasks and properties of the algorithm are considered. A number of statements regarding the properties of the algorithm are proved. The concept of a generalized criterion for the quality of rules is introduced, which allows for the ranking of rules.
Keywords: Association rules, Apriori algorithm, Data Mining, databases.
Received: 13.12.2023
Revised: 27.01.2024
Bibliographic databases:
Document Type: Article
UDC: 004.65
Language: Russian
Citation: V. A. Billig, “Building associative rules for a database with a target parameter”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2024, no. 1, 94–107
Citation in format AMSBIB
\Bibitem{Bil24}
\by V.~A.~Billig
\paper Building associative rules for a database with a target parameter
\jour Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.]
\yr 2024
\issue 1
\pages 94--107
\mathnet{http://mi.mathnet.ru/vtpmk705}
\crossref{https://doi.org/10.26456/vtpmk705}
\elib{https://elibrary.ru/item.asp?id=65645560}
Linking options:
  • https://www.mathnet.ru/eng/vtpmk705
  • https://www.mathnet.ru/eng/vtpmk/y2024/i1/p94
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
    Statistics & downloads:
    Abstract page:188
    Full-text PDF :35
    References:15
     
      Contact us:
    math-net2025_04@mi-ras.ru
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025