Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Mohamad Hatef

dblp:32/1847 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorArtificial intelligence and machine learning · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Kernel, tree and ensemble methods · 77% Learning theory · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods
classifier combination
0.011998
On Combining Classifiers · IEEE Trans. Pattern Anal. Mach. Intell. 1998
Machine learning › Learning theory › statistical estimation
error estimation
0.011998
On Combining Classifiers · IEEE Trans. Pattern Anal. Mach. Intell. 1998

Methods — techniques the papers use, named apart from their topics

sensitivity analysis · 0.0
YearPublicationVenuePosition
1998 On Combining Classifiers
abstract
We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental comparison of various classifier combination schemes demonstrates that the combination rule developed under the most restrictive assumptions-the sum rule-outperforms other classifier combinations schemes. A sensitivity analysis of the various schemes to estimation errors is carried out to show that this finding can be justified theoretically.
Josef Kittler, Mohamad Hatef, Robert P. W. Duin, Jiri Matas
IEEE Trans. Pattern Anal. Mach. Intell.2
1996 Combining classifiers
abstract
We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental comparison of various classifier combination schemes demonstrates that the combination rule developed under the most restrictive assumptions-the sum rule-and its derivatives consistently outperform other classifier combinations schemes. A sensitivity analysis of the various schemes to estimation errors is carried out to show that this finding can be justified theoretically.
Josef Kittler, Mohamad Hatef, Robert P. W. Duin
ICPR2
1995 Constraining Probabilistic Relaxation with Symbolic Attributes
Mohamad Hatef, Josef Kittler
CAIP1
1995 Combining symbolic with numeric attributes in multi-class object recognition problems
abstract
We present in this paper a shape representation that combines both structural and numerical information about each object. Each of these sources of information has its own advantages but in general they are not compatible with each other. In our work we show how it is often possible and beneficial to combine these two types of representation especially for complex objects that have some natural structure. The method is successfully applied to the problem of totally unconstrained handwritten character recognition. Combined with a simple classification scheme this representation yields a good performance both in speed and accuracy.
Mohamad Hatef, Josef Kittler
ICIP (3)1