Loading [MathJax]/jax/output/SVG/config.js
Sibirskii Zhurnal Industrial'noi Matematiki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. Zh. Ind. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Sibirskii Zhurnal Industrial'noi Matematiki, 2013, Volume 16, Number 1, Pages 29–41 (Mi sjim764)  
This article is cited in 8 scientific papers (total in 8 papers)

Constructing the compressed description of dataset by the function of rival similarity

N. G. Zagoruikoabc, I. A. Borisovaabc, O. A. Kutnenkobac, V. V. Dyubanovacb

a Novosibirsk State University, Novosibirsk, Russia
b Sobolev Institute of Mathematics of the SDRAS, Novosibirsk, Russia
c Design Technological Institute of Digital Techniques SD RAS, Novosibirsk, Russia
Full-text PDF (385 kB) Citations (8)
References:
PDF
HTML
Abstract: We argue that the general aim of data mining consists in constructing some simplified compressed description of information. The Function of rival similarity (FRiS-function) is proposed as a new ternary similarity measure between objects instead of a binary one. Quantitative estimation of the compactness of datasets, basing on FRiS-function, allows constructing new more effective compressing algorithms of data mining. Some examples are described of the algorithms testing on real and model tasks.
Keywords: data mining, function of rival similarity, pattern recognition, objects censoring, feature selection.
Received: 06.12.2012
English version:
Journal of Applied and Industrial Mathematics, 2013, Volume 7, Issue 2, Pages 275–286
DOI: https://doi.org/10.1134/S199047891302018X
Bibliographic databases:
Document Type: Article
UDC: 519.95
Language: Russian
Citation: N. G. Zagoruiko, I. A. Borisova, O. A. Kutnenko, V. V. Dyubanov, “Constructing the compressed description of dataset by the function of rival similarity”, Sib. Zh. Ind. Mat., 16:1 (2013), 29–41; J. Appl. Industr. Math., 7:2 (2013), 275–286
Citation in format AMSBIB
\Bibitem{ZagBorKut13}
\by N.~G.~Zagoruiko, I.~A.~Borisova, O.~A.~Kutnenko, V.~V.~Dyubanov
\paper Constructing the compressed description of dataset by the function of rival similarity
\jour Sib. Zh. Ind. Mat.
\yr 2013
\vol 16
\issue 1
\pages 29--41
\mathnet{http://mi.mathnet.ru/sjim764}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3203303}
\transl
\jour J. Appl. Industr. Math.
\yr 2013
\vol 7
\issue 2
\pages 275--286
\crossref{https://doi.org/10.1134/S199047891302018X}
Linking options:
  • https://www.mathnet.ru/eng/sjim764
  • https://www.mathnet.ru/eng/sjim/v16/i1/p29
    • This publication is cited in the following 8 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Сибирский журнал индустриальной математики
    Statistics & downloads:
    Abstract page:761
    Full-text PDF :378
    References:101
    First page:18
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025