Sciweavers

1772 search results - page 5 / 355
» Classifying Problems into Complexity Classes
Sort
View
JMLR
2006
107views more  JMLR 2006»
13 years 7 months ago
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
Magnus Ekdahl, Timo Koski
PAKDD
2009
ACM
126views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Tree-Based Method for Classifying Websites Using Extended Hidden Markov Models
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
Majid Yazdani, Milad Eftekhar, Hassan Abolhassani
PAA
2002
13 years 7 months ago
Combining Discriminant Models with New Multi-Class SVMs
: The idea of performing model combination, instead of model selection, has a long theoretical background in statistics. However, making use of theoretical results is ordinarily su...
Yann Guermeur
MATES
2009
Springer
14 years 2 months ago
Towards a Taxonomy of Decision Making Problems in Multi-Agent Systems
Abstract. Taxonomies in the area of Multi-Agent Systems (MAS) classify problems according to the underlying principles and assumptions of the agents’ abilities, rationality and i...
Christian Guttmann