<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">INF3408</article-id><article-id pub-id-type="doi">10.3233/INF-1992-3408</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Max-min and max-Δ transitive resemblance matrices in classification problems</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Vatlin</surname><given-names>Sergey</given-names></name><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><contrib contrib-type="Author"><name><surname>Krasnoproshin</surname><given-names>Viktor</given-names></name><xref ref-type="aff" rid="j_INFORMATICA_aff_001"/></contrib><aff id="j_INFORMATICA_aff_000">Minsk Radioengineering Institute, 220600 Minsk, P.Brovka St. 6, Belorussian Republic</aff><aff id="j_INFORMATICA_aff_001">Belorussian State University, 220080 Minsk, Skorina Av. 4, Belorussian Republic</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>1992</year></pub-date><volume>3</volume><issue>4</issue><fpage>582</fpage><lpage>591</lpage><abstract><p>The basic properties and methods of developing max-min and max-Δ transitive approximations of resemblance matrices of observed objects are reviewed. A new algorithm of constructing max-Δ transitive closure of such matrices is presented. The conditions of applications of the max-min and max-Δ transitive measures of similarity are considered.</p></abstract><kwd-group><label>Keywords</label><kwd>classification problems</kwd><kwd>measure of similarity</kwd><kwd>max-min and max-Δ transitivity</kwd><kwd>transitive closure</kwd></kwd-group></article-meta></front></article>