Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






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


Prikladnaya Diskretnaya Matematika. Supplement, 2017, Issue 10, Pages 160–162
DOI: https://doi.org/10.17223/2226308X/10/62
(Mi pdma321)
 

Computational methods in discrete mathematics

Based on the relative similarity coefficients ranking characteristics forming the cluster partition

S. V. Dronova, E. A. Evdokimovb

a Altai State University, Barnaul
b Altai State University, Faculty of Mathematics and Information Technologies, Barnaul
References:
Abstract: Assume that cluster partition of the finite set of objects is carried out by the establishing the proximity degree for some numerical characteristics that we call forming ones. We study the problem of estimating a relative informative value of the forming characteristics for the clusterization process. To range them, we introduce a coefficient of the relative cluster strength by which we can estimate a relative value of each of the characteristics in the cluster constructing with the respect to the arbitrary collective of the others. Also another two coefficients are proposed for estimating the degree of so-called cluster connection between any two of the forming characteristics. This connection is understood as the possibility of one characteristic to replace the other without any major changes in the cluster partition. The proposed coefficients represent two different approaches to estimating the strength of the cluster connection. An algorithm for the dimension reduction which allows minimal distortion of the cluster structure based on these coefficients and their modifications is discussed. A distortion degree is considered with the respect to some cluster metric proposed earlier by one of the authors. More confident detection of computer security threats while lowering the total load on the system can be achieved through the implementation of this algorithm.
Keywords: cluster partition, dimension reduction, cluster connection, strength degree coefficients.
Document Type: Article
UDC: 519.14+519.25
Language: Russian
Citation: S. V. Dronov, E. A. Evdokimov, “Based on the relative similarity coefficients ranking characteristics forming the cluster partition”, Prikl. Diskr. Mat. Suppl., 2017, no. 10, 160–162
Citation in format AMSBIB
\Bibitem{DroEvd17}
\by S.~V.~Dronov, E.~A.~Evdokimov
\paper Based on the relative similarity coefficients ranking characteristics forming the cluster partition
\jour Prikl. Diskr. Mat. Suppl.
\yr 2017
\issue 10
\pages 160--162
\mathnet{http://mi.mathnet.ru/pdma321}
\crossref{https://doi.org/10.17223/2226308X/10/62}
Linking options:
  • https://www.mathnet.ru/eng/pdma321
  • https://www.mathnet.ru/eng/pdma/y2017/i10/p160
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025