Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Complexity of classification problems

From MaRDI portal
Publication:1369621
Jump to:navigation, search

DOI10.1007/BF02366774zbMath0902.62071OpenAlexW1995742115MaRDI QIDQ1369621

S. V. Pashko, Anatol M. Gupal, Ivan V. Sergienko

Publication date: 14 December 1998

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02366774



Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Complexity and performance of numerical algorithms (65Y20)


Related Items (6)

Design principles for inductive inference procedures ⋮ Optimal pattern recognition procedures and their application ⋮ Determination of risk groups for the COVID-19 underlying deseases ⋮ Influence of informativeness of monitoring features on the conditions of generating an integral criterion to determine their priority ⋮ Bayesian approach, theory of empirical risk minimization. Comparative analysis ⋮ Distributed Bayesian machine learning procedures




Cites Work

  • Unnamed Item
  • Efficiency of Bayesian classification procedure




This page was built for publication: Complexity of classification problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1369621&oldid=13511570"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki