Skip to main content

Use of the FRiS-Function for Taxonomy, Attribute Selection and Decision Rule Construction

  • Conference paper
Knowledge Processing and Data Analysis (KPP 2007, KONT 2007)

Abstract

The task of simultaneous taxonomy (task S), decision rule construction (task D) and most informative attributes selection (task X) is the combined-type task SDX. We offer a way to solve this type of task with a function of rival similarity (FRiS-function). As a result the set of analyzed objects is divided into K classes (clusters) in the selected subspace of informative attributes according to principles of natural classification. Every cluster is described by a necessary and sufficient set of typical representatives (stolps), which provide maximal similarity of all objects of the training dataset with the nearest stolps. In this paper advantages of the criterion based on the FRiS-function for solving SDX task and other combined-type problems in data mining are shown.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zagoruiko, N.G.: Pattern Recognition methods and their using. Soviet Radio, Moskow (1972) (in Russian)

    Google Scholar 

  2. Voronin, J.A.: Beginning of Theory of Similarity. Computer Centre SD RAS, Novosibirsk (1989) (in Russian)

    MATH  Google Scholar 

  3. Zagoruiko, N.G., Borisova, I.A., Dyubanov, V.V., Kutnenko, O.A.: Methods of Recognition Based on the Function of Rival Similarity. Pattern Recognition and Image Analysis 18, 1–6 (2008)

    Article  MATH  Google Scholar 

  4. Borisova, I.A., Zagoruiko, N.G., Kutnenko, O.A.: The Criterion of Informativeness and Suitability Subset of Attributes Based on Function of Similarity. Zavodskaja Laboratorija 74, 68–75 (2008) (in Russian)

    Google Scholar 

  5. Kira, K., Rendell, L.: The Feature Selection Problem: Traditional Methods and a New Algorithm. In: 10th National Conference Artificial Intelligence (AAAI 1992), pp. 129–134 (1992)

    Google Scholar 

  6. Zagoruiko, N.G.: Applied Methods of Data and Knowledge Analysis. In: Institute of Mathematics SD RAS, Novosibirsk (1999) (in Russian)

    Google Scholar 

  7. Borisova, I.A.: Clustering algorithm FRiS-Tax. Scientific bulletin of NGTU 3, 3–12 (2007) (in Russian)

    Google Scholar 

  8. Vityaev, E.E.: Algorithm of Natural Classification. Computer Systems 99, 44–50 (1983) (in Russian)

    MathSciNet  MATH  Google Scholar 

  9. Zagoruiko, N.G., Borisova, I.A.: Principles of natural classification. Pattern Recognition and Image Analysis 15, 27–29 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borisova, I.A., Dyubanov, V.V., Kutnenko, O.A., Zagoruiko, N.G. (2011). Use of the FRiS-Function for Taxonomy, Attribute Selection and Decision Rule Construction. In: Wolff, K.E., Palchunov, D.E., Zagoruiko, N.G., Andelfinger, U. (eds) Knowledge Processing and Data Analysis. KPP KONT 2007 2007. Lecture Notes in Computer Science(), vol 6581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22140-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22140-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22139-2

  • Online ISBN: 978-3-642-22140-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics