Demo Data from EDBT 2026 / reviewers in the wild / expert
Abdelhamid Djouadi
dblp:83/2764
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 1998
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-author
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
3 papers |
Learning theory · 90% Probabilistic and Bayesian machine learning · 10% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › similarity search
nearest neighbor search |
0.0 | 1 | 1997 | A Fast Algorithm for the Nearest-Neighbor Classifier · IEEE Trans. Pattern Anal. Mach. Intell. 1997 |
Algorithms and data structures
search algorithms |
0.0 | 1 | 1997 | A Fast Algorithm for the Nearest-Neighbor Classifier · IEEE Trans. Pattern Anal. Mach. Intell. 1997 |
Machine learning › Learning theory › statistical learning theory
bias-variance tradeoff |
0.0 | 1 | 1990 | The Quality of Training Sample Estimates of the Bhattacharyya Coefficient · IEEE Trans. Pattern Anal. Mach. Intell. 1990 |
Machine learning › Learning theory
statistical estimation |
0.0 | 1 | 1990 | The Quality of Training Sample Estimates of the Bhattacharyya Coefficient · IEEE Trans. Pattern Anal. Mach. Intell. 1990 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian classification |
0.0 | 1 | 1988 | Bounds on the Bayes Classification Error Based on Pairwise Risk Functions · IEEE Trans. Pattern Anal. Mach. Intell. 1988 |
Machine learning › Learning theory › statistical learning theory › bayesian learning theory
bayes risk bounds |
0.0 | 1 | 1988 | Bounds on the Bayes Classification Error Based on Pairwise Risk Functions · IEEE Trans. Pattern Anal. Mach. Intell. 1988 |
Machine learning › Learning theory › generalization bounds
classification error bounds |
0.0 | 1 | 1988 | Bounds on the Bayes Classification Error Based on Pairwise Risk Functions · IEEE Trans. Pattern Anal. Mach. Intell. 1988 |
Methods — techniques the papers use, named apart from their topics
polarization scheme · 0.02-NN rule · 0.0preprocessing · 0.0labeled sample search · 0.0maximum likelihood estimation · 0.0bias-variance analysis · 0.0pairwise risk functions · 0.0composite hypothesis testing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | On the Reduction of the Nearest-Neighbor Variation for More Accurate Classification and Error EstimatesabstractIn designing the nearest-neighbor (NN) classifier, a method is presented to produce a finite sample size risk close to the asymptotic one. It is based on an attempt to eliminate the first-order effects of the sample size, as well as all higher odd terms. This method uses the 2-NN rule without the rejection option and utilizes a polarization scheme. Simulation results are included as a means of verifying this analysis. Abdelhamid Djouadi |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 1997 | A Fast Algorithm for the Nearest-Neighbor ClassifierabstractA fast algorithm that finds the nearest neighbor (NN) of an unknown sample from a design set of labeled samples is proposed. This algorithm requires a quite moderate preprocessing effort and a rather excessive storage, but it accomplishes substantial computational savings during classification. The performance of the algorithm is described and compared to the performance of the conventional one. Results on simulated data are provided to illustrate the computational savings that may be achieved using this fast algorithm. Abdelhamid Djouadi, Essaid Bouktache |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 1990 | The Quality of Training Sample Estimates of the Bhattacharyya CoefficientabstractThe quality, in terms of the bias and variance, of estimates of the Bhattacharyya coefficient based on n training samples from two classes described by multivariate Gaussian distributions is considered. The case where the classes are described by a common covariance matrix, as well as the case where each class is described by a different covariance matrix, is analyzed. Expressions for the bias and the variance of estimates of the Bhattacharyya coefficient are derived, and numerical examples are used to show the relationship between these parameters, the number of training samples, and the dimensionality of the observation space.> Abdelhamid Djouadi, Ö. Snorrason, Frederick D. Garber |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 1988 | Bounds on the Bayes Classification Error Based on Pairwise Risk FunctionsabstractUpper and lower bounds on the Bayes risk for multiple, composite-hypothesis classification are obtained. Bounds on the Bayes risk for M simple classes are derived in terms of the risk functions for (M-1) classes, and so on, until the desired result depends only on the pairwise (M=2) Bayes risks. A method of computing upper and lower bounds on the pairwise Bayes risk for composite classes is developed. Algorithms for computing the upper and lower bounds for the general M-class case and for composite-hypothesis classes are presented. Numerical examples of the application of the bounding techniques to a problem involving the classification of aircraft are discussed. Results for the bounds and other performance measures are compared for the most interesting cases.> Frederick D. Garber, Abdelhamid Djouadi |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |