EDBT 2026 Demo / reviewers in the wild / expert
Frederic P. Fischer II
dblp:178/7407
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 1969
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1
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 |
Probabilistic and Bayesian machine learning · 50% Learning theory · 12% Kernel, tree and ensemble methods · 12% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning
clustering |
0.0 | 1 | 1969 | Cluster Mapping with Experimental Computer Graphics · IEEE Trans. Computers 1969 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
density estimation |
0.0 | 1 | 1969 | Nonparametric feature selection · IEEE Trans. Inf. Theory 1969 |
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
feature selection |
0.0 | 1 | 1969 | Nonparametric feature selection · IEEE Trans. Inf. Theory 1969 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › mixture model
gaussian mixture model |
0.0 | 1 | 1969 | Cluster Mapping with Experimental Computer Graphics · IEEE Trans. Computers 1969 |
Machine learning › Kernel, tree and ensemble methods › nearest neighbor methods
k-nearest neighbors |
0.0 | 1 | 1969 | A Generalization of the k-Nearest Neighbor Rule · IJCAI 1969 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
mixture model |
0.0 | 1 | 1969 | Cluster Mapping with Experimental Computer Graphics · IEEE Trans. Computers 1969 |
Machine learning › Learning theory › classification › nonparametric classification
nearest neighbor classification |
0.0 | 1 | 1969 | A Generalization of the k-Nearest Neighbor Rule · IJCAI 1969 |
Machine learning › Learning paradigms
unsupervised learning |
0.0 | 1 | 1969 | Cluster Mapping with Experimental Computer Graphics · IEEE Trans. Computers 1969 |
Visualization and visual analytics
interactive data analysis |
0.0 | 1 | 1969 | Cluster Mapping with Experimental Computer Graphics · IEEE Trans. Computers 1969 |
Algorithms and data structures › learning algorithms
classification algorithms |
0.0 | 1 | 1969 | A Generalization of the k-Nearest Neighbor Rule · IJCAI 1969 |
Methods — techniques the papers use, named apart from their topics
truncated gaussian assumption · 0.0l2 distance criterion · 0.0experimental computer graphics · 0.0computer simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1969 | A Generalization of the k-Nearest Neighbor Rule
Edward A. Patrick, Frederic P. Fischer II |
IJCAI | 2 |
| 1969 | Cluster Mapping with Experimental Computer GraphicsabstractThe unsupervised estimation problem has been conveniently formulated in terms of a mixture density. It has been shown that a criterion naturally arises whose maximum defines the Bayes minimum risk solution. This criterion is the expected value of the natural log of the mixture density. By making the assumptions that the component densities in the mixture are truncated Gaussian, the criterion has a greatly simplified form. This criterion can be used to resolve mixtures when the number of classes as well as the class covariances are unknown. In this paper a technique is presented where an assumed test covariance is supplied by an experimenter who uses a test function as a "portable magnifying glass" to examine data. Because the experimenter supplies the covariance and thus the test function, the technique is especially suited for interactive data analysis. Edward A. Patrick, Frederic P. Fischer II |
IEEE Trans. Computers | 2 |
| 1969 | Nonparametric feature selectionabstractTwo groups ofL-dimensional observations of sizeN_{1}andN_{2}are known to be random vector variables from two unknown probability distribution functions [1]. A method is discussed for obtaining anl-dimensional linear subspace of the observation space in which thel-variate marginal distributions are most separated, based on a nonparametric estimate of probability density functions and a distance criterion. The distance used essentially is theL_{2}norm of the difference between Parzen estimates of the two densities. An algorithm is developed that determines the subspace for which the distance between the two densities is maximized. Computer simulations are performed. Edward A. Patrick, Frederic P. Fischer II |
IEEE Trans. Inf. Theory | 2 |